Home
last modified time | relevance | path

Searched refs:__comp (Results 1 – 25 of 30) sorted by relevance

12

/external/stlport/stlport/stl/
D_algo.c46 _Compare __comp);
56 _Compare __comp);
83 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) { in __median() argument
84 if (__comp(__a, __b)) { in __median()
85 _STLP_VERBOSE_ASSERT(!__comp(__b, __a), _StlMsg_INVALID_STRICT_WEAK_PREDICATE) in __median()
86 if (__comp(__b, __c)) { in __median()
87 _STLP_VERBOSE_ASSERT(!__comp(__c, __b), _StlMsg_INVALID_STRICT_WEAK_PREDICATE) in __median()
90 else if (__comp(__a, __c)) { in __median()
91 _STLP_VERBOSE_ASSERT(!__comp(__c, __a), _StlMsg_INVALID_STRICT_WEAK_PREDICATE) in __median()
97 else if (__comp(__a, __c)) { in __median()
[all …]
D_heap.c77 _Distance __topIndex, _Tp __val, _Compare __comp) in __push_heap() argument
80 while (__holeIndex > __topIndex && __comp(*(__first + __parent), __val)) { in __push_heap()
81 … _STLP_VERBOSE_ASSERT(!__comp(__val, *(__first + __parent)), _StlMsg_INVALID_STRICT_WEAK_PREDICATE) in __push_heap()
93 _RandomAccessIterator __last, _Compare __comp, in __push_heap_aux() argument
97 _Tp(*(__last - 1)), __comp); in __push_heap_aux()
103 _Compare __comp) in push_heap() argument
105 __push_heap_aux(__first, __last, __comp, in push_heap()
147 _Distance __len, _Tp __val, _Compare __comp) in __adjust_heap() argument
152 if (__comp(*(__first + __secondChild), *(__first + (__secondChild - 1)))) { in __adjust_heap()
153 _STLP_VERBOSE_ASSERT(!__comp(*(__first + (__secondChild - 1)), *(__first + __secondChild)), in __adjust_heap()
[all …]
D_set.h89 explicit set(const _Compare& __comp = _Compare(), in _STLP_CREATE_ITERATOR_TRAITS()
94 explicit set(const _Compare& __comp) in _STLP_CREATE_ITERATOR_TRAITS()
95 : _M_t(__comp, allocator_type()) {} in _STLP_CREATE_ITERATOR_TRAITS()
96 set(const _Compare& __comp, const allocator_type& __a) in _STLP_CREATE_ITERATOR_TRAITS()
98 : _M_t(__comp, __a) {} in _STLP_CREATE_ITERATOR_TRAITS()
108 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp) in _STLP_CREATE_ITERATOR_TRAITS()
109 : _M_t(__comp, allocator_type()) { _M_t.insert_unique(__first, __last); } in _STLP_CREATE_ITERATOR_TRAITS()
112 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp, in _STLP_CREATE_ITERATOR_TRAITS()
114 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); } in _STLP_CREATE_ITERATOR_TRAITS()
121 const value_type* __last, const _Compare& __comp, in _STLP_CREATE_ITERATOR_TRAITS()
[all …]
D_heap.h45 _Compare __comp);
69 _Distance __len, _Tp __val, _Compare __comp);
75 _RandomAccessIterator __result, _Tp __val, _Compare __comp, in __pop_heap() argument
80 __val, __comp); in __pop_heap()
86 _RandomAccessIterator __last, _Compare __comp);
95 _RandomAccessIterator __last, _Compare __comp);
109 _RandomAccessIterator __last, _Compare __comp) in sort_heap() argument
112 pop_heap(__first, __last--, __comp); in sort_heap()
D_map.h101 explicit map(const _Compare& __comp, in _STLP_CREATE_ITERATOR_TRAITS()
104 explicit map(const _Compare& __comp) in _STLP_CREATE_ITERATOR_TRAITS()
105 : _M_t(__comp, allocator_type()) {} in _STLP_CREATE_ITERATOR_TRAITS()
106 explicit map(const _Compare& __comp, const allocator_type& __a) in _STLP_CREATE_ITERATOR_TRAITS()
108 : _M_t(__comp, __a) {} in _STLP_CREATE_ITERATOR_TRAITS()
117 map(_InputIterator __first, _InputIterator __last, const _Compare& __comp, in _STLP_CREATE_ITERATOR_TRAITS()
119 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); } in _STLP_CREATE_ITERATOR_TRAITS()
123 map(_InputIterator __first, _InputIterator __last, const _Compare& __comp) in _STLP_CREATE_ITERATOR_TRAITS()
124 : _M_t(__comp, allocator_type()) { _M_t.insert_unique(__first, __last); } in _STLP_CREATE_ITERATOR_TRAITS()
133 const value_type* __last, const _Compare& __comp, in _STLP_CREATE_ITERATOR_TRAITS()
[all …]
D_algo.h146 _ForwardIter __first2, _ForwardIter __last2, _BinaryPredicate __comp) { in find_first_of() argument
149 return _STLP_PRIV __find_first_of(__first1, __last1, __first2, __last2, __comp); in find_first_of()
420 void sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp);
429 _RandomAccessIter __last, _Compare __comp);
439 _RandomAccessIter __last, _Compare __comp);
450 _RandomAccessIter __result_last, _Compare __comp);
459 _RandomAccessIter __last, _Compare __comp);
492 const _Tp& __val, _Compare __comp) { in lower_bound() argument
494 return _STLP_PRIV __lower_bound(__first, __last, __val, __comp, __comp, in lower_bound()
518 const _Tp& __val, _Compare __comp) { in upper_bound() argument
[all …]
D_slist.c149 _StrictWeakOrdering __comp) { in _Slist_merge() argument
154 if (__comp(__x.front(), __STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data)) { in _Slist_merge()
155 … _STLP_VERBOSE_ASSERT(!__comp(__STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data, __x.front()), in _Slist_merge()
168 if (__comp(__STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data, *__i2)) { in _Slist_merge()
169 _STLP_VERBOSE_ASSERT(!__comp(*__i2, __STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data), in _Slist_merge()
183 void _Slist_sort(slist<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp) { in _Slist_sort() argument
195 _STLP_PRIV _Slist_merge(__counter[__i], __carry, __comp); in _Slist_sort()
210 _STLP_PRIV _Slist_merge(__counter[__i], __counter[__i - 1], __comp); in _Slist_sort()
D_list.c169 _StrictWeakOrdering __comp) { in _S_merge() argument
177 if (__comp(*__first2, *__first1)) { in _S_merge()
178 _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE) in _S_merge()
191 if (__comp(*__first2, *__first1)) { in _S_merge()
192 _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE) in _S_merge()
206 void _S_sort(list<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp) { in _S_sort() argument
220 _S_merge(__counter[__i], __carry, __comp); in _S_sort()
234 _S_merge(__counter[__i], __counter[__i - 1], __comp); in _S_sort()
D_algobase.c58 _Compare __comp) { in lexicographical_compare() argument
63 if (__comp(*__first1, *__first2)) { in lexicographical_compare()
64 _STLP_VERBOSE_ASSERT(!__comp(*__first2, *__first1), in lexicographical_compare()
68 if (__comp(*__first2, *__first1)) in lexicographical_compare()
350 _BinaryPredicate __comp) {
353 if (__comp(*__first1, *__iter)) {
372 _BinaryPredicate __comp) {
378 _ForwardIter1 __new_result = _STLP_STD::search(__first1, __last1, __first2, __last2, __comp);
409 _BinaryPredicate __comp) {
417 __comp);
[all …]
D_algobase.h152 inline const _Tp& (min)(const _Tp& __a, const _Tp& __b, _Compare __comp) {
153 return __comp(__b, __a) ? __b : __a;
157 inline const _Tp& (max)(const _Tp& __a, const _Tp& __b, _Compare __comp) {
158 return __comp(__a, __b) ? __b : __a;
162 inline const _Tp (min)(const _Tp __a, const _Tp __b, _Compare __comp) { in _Tp()
163 return __comp(__b, __a) ? __b : __a; in _Tp()
167 inline const _Tp (max)(const _Tp __a, const _Tp __b, _Compare __comp) { in _Tp()
168 return __comp(__a, __b) ? __b : __a; in _Tp()
584 _Compare __comp);
687 _BinaryPredicate __comp);
[all …]
D_list.h243 _StrictWeakOrdering __comp);
246 void _S_sort(list<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp);
673 _StrictWeakOrdering __comp) {
674 _STLP_PRIV _S_merge(*this, __x, __comp);
678 void sort(_StrictWeakOrdering __comp)
679 { _STLP_PRIV _S_sort(*this, __comp); }
D_slist.h210 _StrictWeakOrdering __comp);
213 void _Slist_sort(slist<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp);
809 void merge(_Self& __x, _StrictWeakOrdering __comp)
810 { _STLP_PRIV _Slist_merge(*this, __x, __comp); }
813 void sort(_StrictWeakOrdering __comp)
814 { _STLP_PRIV _Slist_sort(*this, __comp); }
D_tree.h386 _Rb_tree(const _Compare& __comp)
387 : _Rb_tree_base<_Value, _Alloc>(allocator_type()), _M_node_count(0), _M_key_compare(__comp)
390 _Rb_tree(const _Compare& __comp, const allocator_type& __a)
391 : _Rb_tree_base<_Value, _Alloc>(__a), _M_node_count(0), _M_key_compare(__comp)
/external/libcxx/include/
Dalgorithm2527 __min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2533 if (__comp(*__i, *__first))
2542 min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2544 return __min_element(__first, __last, __comp);
2561 min(const _Tp& __a, const _Tp& __b, _Compare __comp)
2563 return __comp(__b, __a) ? __b : __a;
2579 min(initializer_list<_Tp> __t, _Compare __comp)
2581 return *__min_element(__t.begin(), __t.end(), __comp);
2599 __max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2605 if (__comp(*__first, *__i))
[all …]
Dqueue431 explicit priority_queue(const value_compare& __comp)
432 : c(), comp(__comp) {}
433 priority_queue(const value_compare& __comp, const container_type& __c);
435 explicit priority_queue(const value_compare& __comp, container_type&& __c);
439 const value_compare& __comp = value_compare());
442 const value_compare& __comp, const container_type& __c);
446 const value_compare& __comp, container_type&& __c);
453 priority_queue(const value_compare& __comp, const _Alloc& __a,
457 priority_queue(const value_compare& __comp, const container_type& __c,
467 priority_queue(const value_compare& __comp, container_type&& __c,
[all …]
Dset436 explicit set(const value_compare& __comp)
441 : __tree_(__comp) {}
444 explicit set(const value_compare& __comp, const allocator_type& __a)
445 : __tree_(__comp, __a) {}
449 const value_compare& __comp = value_compare())
450 : __tree_(__comp)
457 set(_InputIterator __f, _InputIterator __l, const value_compare& __comp,
459 : __tree_(__comp, __a)
509 set(initializer_list<value_type> __il, const value_compare& __comp = value_compare())
510 : __tree_(__comp)
[all …]
Dforward_list750 void merge(forward_list&& __x, _Compare __comp)
751 {merge(__x, _VSTD::move(__comp));}
755 template <class _Compare> void merge(forward_list& __x, _Compare __comp);
758 template <class _Compare> void sort(_Compare __comp);
772 __merge(__node_pointer __f1, __node_pointer __f2, _Compare& __comp);
777 __sort(__node_pointer __f, difference_type __sz, _Compare& __comp);
1484 forward_list<_Tp, _Alloc>::merge(forward_list& __x, _Compare __comp)
1490 __comp);
1499 _Compare& __comp)
1506 if (__comp(__f2->__value_, __f1->__value_))
[all …]
Dmap846 explicit map(const key_compare& __comp)
851 : __tree_(__vc(__comp)) {}
854 explicit map(const key_compare& __comp, const allocator_type& __a)
855 : __tree_(__vc(__comp), __a) {}
860 const key_compare& __comp = key_compare())
861 : __tree_(__vc(__comp))
869 const key_compare& __comp, const allocator_type& __a)
870 : __tree_(__vc(__comp), __a)
929 map(initializer_list<value_type> __il, const key_compare& __comp = key_compare())
930 : __tree_(__vc(__comp))
[all …]
/external/stlport/stlport/stl/pointers/
D_set.h130 explicit set(const _Compare& __comp,
132 : _M_t(__comp, _STLP_CONVERT_ALLOCATOR(__a, _KeyStorageType)) {}
148 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp)
149 : _M_t(__comp, _StorageTypeAlloc()) {
159 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
161 : _M_t(__comp, _STLP_CONVERT_ALLOCATOR(__a, _KeyStorageType)) {
177 const _Compare& __comp, const allocator_type& __a = allocator_type())
178 : _M_t(__comp, _STLP_CONVERT_ALLOCATOR(__a, _KeyStorageType)) {
188 const _Compare& __comp, const allocator_type& __a = allocator_type())
189 : _M_t(__comp, _STLP_CONVERT_ALLOCATOR(__a, _KeyStorageType))
[all …]
D_list.h317 void merge(_Self &__x, _StrictWeakOrdering __comp) in merge() argument
318 …erge(__x._M_impl, _STLP_PRIV _BinaryPredWrapper<_StorageType, _Tp, _StrictWeakOrdering>(__comp)); } in merge()
321 void sort(_StrictWeakOrdering __comp) in sort() argument
322 { _M_impl.sort(_STLP_PRIV _BinaryPredWrapper<_StorageType, _Tp, _StrictWeakOrdering>(__comp)); } in sort()
D_slist.h398 void merge(_Self& __x, _StrictWeakOrdering __comp) in merge() argument
399 …erge(__x._M_impl, _STLP_PRIV _BinaryPredWrapper<_StorageType, _Tp, _StrictWeakOrdering>(__comp)); } in merge()
402 void sort(_StrictWeakOrdering __comp) in sort() argument
403 { _M_impl.sort(_STLP_PRIV _BinaryPredWrapper<_StorageType, _Tp, _StrictWeakOrdering>(__comp)); } in sort()
/external/chromium_org/third_party/bsdtrees/
Dtree.h163 int __comp; \
165 __comp = (cmp)(elm, (head)->sph_root); \
166 if(__comp < 0) { \
170 } else if (__comp > 0) { \
206 int __comp; \
211 while ((__comp = (cmp)(elm, (head)->sph_root))) { \
212 if (__comp < 0) { \
222 } else if (__comp > 0) { \
240 void name##_SPLAY_MINMAX(struct name *head, int __comp) \
248 if (__comp < 0) { \
[all …]
/external/qemu/
Dsys-tree.h174 int __comp; \
176 __comp = (cmp)(elm, (head)->sph_root); \
177 if(__comp < 0) { \
181 } else if (__comp > 0) { \
217 int __comp; \
222 while ((__comp = (cmp)(elm, (head)->sph_root)) != 0) { \
223 if (__comp < 0) { \
233 } else if (__comp > 0) { \
251 void name##_SPLAY_MINMAX(SYS_TREE_STRUCT name *head, int __comp) \
259 if (__comp < 0) { \
[all …]
/external/stlport/stlport/stl/debug/
D_list.h465 void merge(_Self& __x, _StrictWeakOrdering __comp) { in merge() argument
467 _STLP_DEBUG_CHECK(_STLP_STD::is_sorted(_M_non_dbg_impl.begin(), _M_non_dbg_impl.end(), __comp)) in merge()
468 _STLP_DEBUG_CHECK(_STLP_STD::is_sorted(__x.begin()._M_iterator, __x.end()._M_iterator, __comp)) in merge()
470 _M_non_dbg_impl.merge(__x._M_non_dbg_impl, __comp); in merge()
480 void sort(_StrictWeakOrdering __comp) { in sort() argument
481 _M_non_dbg_impl.sort(__comp); in sort()
D_tree.h123 _Rb_tree(const _Compare& __comp) in _Rb_tree() argument
124 : _M_non_dbg_impl(__comp), _M_iter_list(&_M_non_dbg_impl) {} in _Rb_tree()
125 _Rb_tree(const _Compare& __comp, const allocator_type& __a) in _Rb_tree() argument
126 : _M_non_dbg_impl(__comp, __a), _M_iter_list(&_M_non_dbg_impl) {} in _Rb_tree()

12