Home | History | Annotate | Download | only in bits

Lines Matching refs:__comp

88 		    _Compare __comp)
93 if (__comp(__first[__parent], __first[__child]))
111 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n)
112 { return std::__is_heap_until(__first, __n, __comp) == __n; }
122 _Compare __comp)
123 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
177 _Distance __topIndex, _Tp __value, _Compare __comp)
181 && __comp(*(__first + __parent), __value))
204 _Compare __comp)
215 __glibcxx_requires_heap_pred(__first, __last - 1, __comp);
219 _DistanceType(0), _GLIBCXX_MOVE(__value), __comp);
296 _Distance __len, _Tp __value, _Compare __comp)
303 if (__comp(*(__first + __secondChild),
317 _GLIBCXX_MOVE(__value), __comp);
323 _RandomAccessIterator __result, _Compare __comp)
334 _GLIBCXX_MOVE(__value), __comp);
351 _RandomAccessIterator __last, _Compare __comp)
357 __glibcxx_requires_heap_pred(__first, __last, __comp);
360 std::__pop_heap(__first, __last, __last, __comp);
414 _Compare __comp)
435 __comp);
482 _Compare __comp)
488 __glibcxx_requires_heap_pred(__first, __last, __comp);
493 std::__pop_heap(__first, __last, __last, __comp);
537 _Compare __comp)
546 __comp);
572 _Compare __comp)
573 { return std::is_heap_until(__first, __last, __comp) == __last; }