Home
last modified time | relevance | path

Searched defs:__comp (Results 1 – 13 of 13) sorted by relevance

/external/stlport/stlport/stl/
D_heap.c77 _Distance __topIndex, _Tp __val, _Compare __comp) in __push_heap()
93 _RandomAccessIterator __last, _Compare __comp, in __push_heap_aux()
103 _Compare __comp) in push_heap()
147 _Distance __len, _Tp __val, _Compare __comp) in __adjust_heap()
172 _RandomAccessIterator __last, _Tp*, _Compare __comp) in __pop_heap_aux()
182 _RandomAccessIterator __last, _Compare __comp) in pop_heap()
217 _Compare __comp, _Tp*, _Distance*) in __make_heap()
234 _RandomAccessIterator __last, _Compare __comp) in make_heap()
D_algo.c83 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) { in __median()
885 _Tp __pivot, _Compare __comp) { in __unguarded_partition()
908 _Compare __comp) { in __unguarded_linear_insert()
922 _RandomAccessIter __last, _Tp __val, _Compare __comp) { in __linear_insert()
937 _Tp *, _Compare __comp) { in __insertion_sort()
946 _Tp*, _Compare __comp) { in __unguarded_insertion_sort_aux()
954 _Compare __comp) { in __unguarded_insertion_sort()
960 _RandomAccessIter __last, _Compare __comp) { in __final_insertion_sort()
972 _Size __depth_limit, _Compare __comp) { in __introsort_loop()
1006 void sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp) { in sort()
[all …]
D_heap.h75 _RandomAccessIterator __result, _Tp __val, _Compare __comp, in __pop_heap()
109 _RandomAccessIterator __last, _Compare __comp) in sort_heap()
D_algo.h146 _ForwardIter __first2, _ForwardIter __last2, _BinaryPredicate __comp) { in find_first_of()
492 const _Tp& __val, _Compare __comp) { in lower_bound()
518 const _Tp& __val, _Compare __comp) { in upper_bound()
546 _Compare __comp) { in equal_range()
566 _Compare __comp) { in binary_search()
729 _StrictWeakOrdering __comp) { in is_sorted()
D_slist.c149 _StrictWeakOrdering __comp) { in _Slist_merge()
184 void _Slist_sort(slist<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp) { in _Slist_sort()
D_list.c169 _StrictWeakOrdering __comp) { in _S_merge()
206 void _S_sort(list<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp) { in _S_sort()
D_algobase.c58 _Compare __comp) { in lexicographical_compare()
D_tree.c408 bool __comp = true; in insert_unique() local
/external/stlport/stlport/stl/debug/
D_tree.h123 _Rb_tree(const _Compare& __comp) in _Rb_tree()
125 _Rb_tree(const _Compare& __comp, const allocator_type& __a) in _Rb_tree()
D_list.h465 void merge(_Self& __x, _StrictWeakOrdering __comp) { in merge()
480 void sort(_StrictWeakOrdering __comp) { in sort()
D_slist.h600 void sort(_StrictWeakOrdering __comp) in sort()
/external/stlport/stlport/stl/pointers/
D_list.h317 void merge(_Self &__x, _StrictWeakOrdering __comp) in merge()
321 void sort(_StrictWeakOrdering __comp) in sort()
D_slist.h398 void merge(_Self& __x, _StrictWeakOrdering __comp) in merge()
402 void sort(_StrictWeakOrdering __comp) in sort()