Lines Matching full:__last
109 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
110 { return std::__is_heap(__first, std::distance(__first, __last)); }
114 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
116 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
141 * @param __last End of heap + element.
145 * over the range [__first,__last-1). After completion,
146 * [__first,__last) is a valid heap.
150 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
161 __glibcxx_requires_valid_range(__first, __last);
162 __glibcxx_requires_heap(__first, __last - 1);
164 _ValueType __value = _GLIBCXX_MOVE(*(__last - 1));
165 std::__push_heap(__first, _DistanceType((__last - __first) - 1),
173 * @param __last End of heap + element.
177 * This operation pushes the element at __last-1 onto the valid
178 * heap over the range [__first,__last-1). After completion,
179 * [__first,__last) is a valid heap. Compare operations are
184 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
195 __glibcxx_requires_valid_range(__first, __last);
196 __glibcxx_requires_heap_pred(__first, __last - 1, __comp);
198 _ValueType __value = _GLIBCXX_MOVE(*(__last - 1));
199 std::__push_heap(__first, _DistanceType((__last - __first) - 1),
235 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
246 _DistanceType(__last - __first),
253 * @param __last End of heap.
254 * @pre [__first, __last) is a valid, non-empty range.
258 * and __last-1 are swapped and [__first,__last-1) is made into a
263 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
272 __glibcxx_requires_non_empty_range(__first, __last);
273 __glibcxx_requires_valid_range(__first, __last);
274 __glibcxx_requires_heap(__first, __last);
276 if (__last - __first > 1)
278 --__last;
279 std::__pop_heap(__first, __last, __last,
287 * @param __last End of heap.
292 * and __last-1 are swapped and [__first,__last-1) is made into a
298 _RandomAccessIterator __last, _Compare __comp)
303 __glibcxx_requires_valid_range(__first, __last);
304 __glibcxx_requires_non_empty_range(__first, __last);
305 __glibcxx_requires_heap_pred(__first, __last, __comp);
307 if (__last - __first > 1)
309 --__last;
310 std::__pop_heap(__first, __last, __last,
317 __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
325 if (__last - __first < 2)
328 const _DistanceType __len = __last - __first;
344 * @param __last End of heap.
347 * This operation makes the elements in [__first,__last) into a heap.
351 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
358 __glibcxx_requires_valid_range(__first, __last);
360 std::__make_heap(__first, __last,
367 * @param __last End of heap.
371 * This operation makes the elements in [__first,__last) into a heap.
376 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
382 __glibcxx_requires_valid_range(__first, __last);
384 std::__make_heap(__first, __last,
390 __sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
393 while (__last - __first > 1)
395 --__last;
396 std::__pop_heap(__first, __last, __last, __comp);
403 * @param __last End of heap.
406 * This operation sorts the valid heap in the range [__first,__last).
410 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
417 __glibcxx_requires_valid_range(__first, __last);
418 __glibcxx_requires_heap(__first, __last);
420 std::__sort_heap(__first, __last,
427 * @param __last End of heap.
431 * This operation sorts the valid heap in the range [__first,__last).
436 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
442 __glibcxx_requires_valid_range(__first, __last);
443 __glibcxx_requires_heap_pred(__first, __last, __comp);
445 std::__sort_heap(__first, __last,
453 * @param __last End of range.
457 * This operation returns the last iterator i in [__first, __last) for which
462 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last)
469 __glibcxx_requires_valid_range(__first, __last);
472 std::__is_heap_until(__first, std::distance(__first, __last),
479 * @param __last End of range.
484 * This operation returns the last iterator i in [__first, __last) for which
489 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last,
495 __glibcxx_requires_valid_range(__first, __last);
498 + std::__is_heap_until(__first, std::distance(__first, __last),
505 * @param __last End of range.
511 is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
512 { return std::is_heap_until(__first, __last) == __last; }
517 * @param __last End of range.
524 is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
526 { return std::is_heap_until(__first, __last, __comp) == __last; }
