Home
last modified time | relevance | path

Searched refs:__result_first (Results 1 – 3 of 3) sorted by relevance

/external/stlport/stlport/stl/
D_algo.c1258 _RandomAccessIter __result_first, in __partial_sort_copy() argument
1261 if (__result_first == __result_last) return __result_last; in __partial_sort_copy()
1262 _RandomAccessIter __result_real_last = __result_first; in __partial_sort_copy()
1268 make_heap(__result_first, __result_real_last, __comp); in __partial_sort_copy()
1270 if (__comp(*__first, *__result_first)) { in __partial_sort_copy()
1271 … _STLP_VERBOSE_ASSERT(!__comp(*__result_first, *__first), _StlMsg_INVALID_STRICT_WEAK_PREDICATE) in __partial_sort_copy()
1272 __adjust_heap(__result_first, _Distance(0), in __partial_sort_copy()
1273 _Distance(__result_real_last - __result_first), in __partial_sort_copy()
1279 sort_heap(__result_first, __result_real_last, __comp); in __partial_sort_copy()
1288 _RandomAccessIter __result_first, _RandomAccessIter __result_last) { in partial_sort_copy() argument
[all …]
D_algo.h444 _RandomAccessIter __result_first, _RandomAccessIter __result_last);
449 _RandomAccessIter __result_first,
/external/libcxx/include/
Dalgorithm5039 … _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp)
5041 _RandomAccessIterator __r = __result_first;
5047 __make_heap<_Compare>(__result_first, __r, __comp);
5049 if (__comp(*__first, *__result_first))
5051 *__result_first = *__first;
5052 __push_heap_front<_Compare>(__result_first, __r, __comp, __len);
5054 __sort_heap<_Compare>(__result_first, __r, __comp);
5063 … _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp)
5068 return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c);
5071 return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp);
[all …]