• Home
  • History
  • Annotate
  • Raw
  • Download
  • only in /freebsd-12-stable/contrib/libstdc++/include/bits/

Lines Matching refs:__first

72     __is_heap(_RandomAccessIterator __first, _Distance __n)
77 if (__first[__parent] < __first[__child])
88 __is_heap(_RandomAccessIterator __first, _StrictWeakOrdering __comp,
94 if (__comp(__first[__parent], __first[__child]))
104 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
105 { return std::__is_heap(__first, std::distance(__first, __last)); }
109 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
111 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
117 __push_heap(_RandomAccessIterator __first,
121 while (__holeIndex > __topIndex && *(__first + __parent) < __value)
123 *(__first + __holeIndex) = *(__first + __parent);
127 *(__first + __holeIndex) = __value;
141 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
152 __glibcxx_requires_valid_range(__first, __last);
153 // __glibcxx_requires_heap(__first, __last - 1);
155 std::__push_heap(__first, _DistanceType((__last - __first) - 1),
162 __push_heap(_RandomAccessIterator __first, _Distance __holeIndex,
167 && __comp(*(__first + __parent), __value))
169 *(__first + __holeIndex) = *(__first + __parent);
173 *(__first + __holeIndex) = __value;
189 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
200 __glibcxx_requires_valid_range(__first, __last);
201 __glibcxx_requires_heap_pred(__first, __last - 1, __comp);
203 std::__push_heap(__first, _DistanceType((__last - __first) - 1),
209 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
216 if (*(__first + __secondChild) < *(__first + (__secondChild - 1)))
218 *(__first + __holeIndex) = *(__first + __secondChild);
224 *(__first + __holeIndex) = *(__first + (__secondChild - 1));
227 std::__push_heap(__first, __holeIndex, __topIndex, __value);
232 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
237 *__result = *__first;
238 std::__adjust_heap(__first, _Distance(0), _Distance(__last - __first),
253 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
262 __glibcxx_requires_valid_range(__first, __last);
263 __glibcxx_requires_heap(__first, __last);
265 std::__pop_heap(__first, __last - 1, __last - 1,
272 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
279 if (__comp(*(__first + __secondChild),
280 *(__first + (__secondChild - 1))))
282 *(__first + __holeIndex) = *(__first + __secondChild);
288 *(__first + __holeIndex) = *(__first + (__secondChild - 1));
291 std::__push_heap(__first, __holeIndex, __topIndex, __value, __comp);
296 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
301 *__result = *__first;
302 std::__adjust_heap(__first, _Distance(0), _Distance(__last - __first),
319 pop_heap(_RandomAccessIterator __first,
325 __glibcxx_requires_valid_range(__first, __last);
326 __glibcxx_requires_heap_pred(__first, __last, __comp);
330 std::__pop_heap(__first, __last - 1, __last - 1,
344 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
355 __glibcxx_requires_valid_range(__first, __last);
357 if (__last - __first < 2)
360 const _DistanceType __len = __last - __first;
364 std::__adjust_heap(__first, __parent, __len,
365 _ValueType(*(__first + __parent)));
384 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
395 __glibcxx_requires_valid_range(__first, __last);
397 if (__last - __first < 2)
400 const _DistanceType __len = __last - __first;
404 std::__adjust_heap(__first, __parent, __len,
405 _ValueType(*(__first + __parent)), __comp);
422 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
429 __glibcxx_requires_valid_range(__first, __last);
430 // __glibcxx_requires_heap(__first, __last);
432 while (__last - __first > 1)
433 std::pop_heap(__first, _RandomAccessIterator(__last--));
448 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
454 __glibcxx_requires_valid_range(__first, __last);
455 __glibcxx_requires_heap_pred(__first, __last, __comp);
457 while (__last - __first > 1)
458 std::pop_heap(__first, _RandomAccessIterator(__last--), __comp);