Lines Matching refs:__first
72 __is_heap_until(_RandomAccessIterator __first, _Distance __n)
77 if (__first[__parent] < __first[__child])
88 __is_heap_until(_RandomAccessIterator __first, _Distance __n,
94 if (__comp(__first[__parent], __first[__child]))
106 __is_heap(_RandomAccessIterator __first, _Distance __n)
107 { return std::__is_heap_until(__first, __n) == __n; }
112 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n)
113 { return std::__is_heap_until(__first, __n, __comp) == __n; }
117 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
118 { return std::__is_heap(__first, std::distance(__first, __last)); }
122 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
124 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
131 __push_heap(_RandomAccessIterator __first,
135 while (__holeIndex > __topIndex && *(__first + __parent) < __value)
137 *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __parent));
141 *(__first + __holeIndex) = _GLIBCXX_MOVE(__value);
146 * @param __first Start of heap.
151 * over the range [__first,__last-1). After completion,
152 * [__first,__last) is a valid heap.
156 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
167 __glibcxx_requires_valid_range(__first, __last);
168 __glibcxx_requires_heap(__first, __last - 1);
171 std::__push_heap(__first, _DistanceType((__last - __first) - 1),
178 __push_heap(_RandomAccessIterator __first, _Distance __holeIndex,
183 && __comp(*(__first + __parent), __value))
185 *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __parent));
189 *(__first + __holeIndex) = _GLIBCXX_MOVE(__value);
194 * @param __first Start of heap.
200 * heap over the range [__first,__last-1). After completion,
201 * [__first,__last) is a valid heap. Compare operations are
206 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
217 __glibcxx_requires_valid_range(__first, __last);
218 __glibcxx_requires_heap_pred(__first, __last - 1, __comp);
221 std::__push_heap(__first, _DistanceType((__last - __first) - 1),
227 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
235 if (*(__first + __secondChild) < *(__first + (__secondChild - 1)))
237 *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __secondChild));
243 *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first
247 std::__push_heap(__first, __holeIndex, __topIndex,
253 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
262 *__result = _GLIBCXX_MOVE(*__first);
263 std::__adjust_heap(__first, _DistanceType(0),
264 _DistanceType(__last - __first),
270 * @param __first Start of heap.
272 * @pre [__first, __last) is a valid, non-empty range.
275 * This operation pops the top of the heap. The elements __first
276 * and __last-1 are swapped and [__first,__last-1) is made into a
281 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
290 __glibcxx_requires_non_empty_range(__first, __last);
291 __glibcxx_requires_valid_range(__first, __last);
292 __glibcxx_requires_heap(__first, __last);
294 if (__last - __first > 1)
297 std::__pop_heap(__first, __last, __last);
304 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
312 if (__comp(*(__first + __secondChild),
313 *(__first + (__secondChild - 1))))
315 *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __secondChild));
321 *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first
325 std::__push_heap(__first, __holeIndex, __topIndex,
331 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
340 *__result = _GLIBCXX_MOVE(*__first);
341 std::__adjust_heap(__first, _DistanceType(0),
342 _DistanceType(__last - __first),
348 * @param __first Start of heap.
353 * This operation pops the top of the heap. The elements __first
354 * and __last-1 are swapped and [__first,__last-1) is made into a
359 pop_heap(_RandomAccessIterator __first,
365 __glibcxx_requires_valid_range(__first, __last);
366 __glibcxx_requires_non_empty_range(__first, __last);
367 __glibcxx_requires_heap_pred(__first, __last, __comp);
369 if (__last - __first > 1)
372 std::__pop_heap(__first, __last, __last, __comp);
378 * @param __first Start of heap.
382 * This operation makes the elements in [__first,__last) into a heap.
386 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
397 __glibcxx_requires_valid_range(__first, __last);
399 if (__last - __first < 2)
402 const _DistanceType __len = __last - __first;
406 _ValueType __value = _GLIBCXX_MOVE(*(__first + __parent));
407 std::__adjust_heap(__first, __parent, __len, _GLIBCXX_MOVE(__value));
416 * @param __first Start of heap.
421 * This operation makes the elements in [__first,__last) into a heap.
426 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
437 __glibcxx_requires_valid_range(__first, __last);
439 if (__last - __first < 2)
442 const _DistanceType __len = __last - __first;
446 _ValueType __value = _GLIBCXX_MOVE(*(__first + __parent));
447 std::__adjust_heap(__first, __parent, __len, _GLIBCXX_MOVE(__value),
457 * @param __first Start of heap.
461 * This operation sorts the valid heap in the range [__first,__last).
465 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
472 __glibcxx_requires_valid_range(__first, __last);
473 __glibcxx_requires_heap(__first, __last);
475 while (__last - __first > 1)
478 std::__pop_heap(__first, __last, __last);
484 * @param __first Start of heap.
489 * This operation sorts the valid heap in the range [__first,__last).
494 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
500 __glibcxx_requires_valid_range(__first, __last);
501 __glibcxx_requires_heap_pred(__first, __last, __comp);
503 while (__last - __first > 1)
506 std::__pop_heap(__first, __last, __last, __comp);
513 * @param __first Start of range.
518 * This operation returns the last iterator i in [__first, __last) for which
519 * the range [__first, i) is a heap.
523 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last)
530 __glibcxx_requires_valid_range(__first, __last);
532 return __first + std::__is_heap_until(__first, std::distance(__first,
538 * @param __first Start of range.
544 * This operation returns the last iterator i in [__first, __last) for which
545 * the range [__first, i) is a heap. Comparisons are made using __comp.
549 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last,
555 __glibcxx_requires_valid_range(__first, __last);
557 return __first + std::__is_heap_until(__first, std::distance(__first,
564 * @param __first Start of range.
571 is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
572 { return std::is_heap_until(__first, __last) == __last; }
576 * @param __first Start of range.
584 is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
586 { return std::is_heap_until(__first, __last, __comp) == __last; }