Home
last modified time | relevance | path

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

/reactos/sdk/include/c++/stlport/stl/
H A D_algo.c84 if (__comp(__a, __b)) { in __median()
86 if (__comp(__b, __c)) { in __median()
90 else if (__comp(__a, __c)) { in __median()
97 else if (__comp(__a, __c)) { in __median()
101 else if (__comp(__b, __c)) { in __median()
984 __comp); in __introsort_loop()
1047 __comp); in __merge_sort_loop()
1055 __comp); in __merge_sort_loop()
1178 __comp); in __stable_sort_adaptive()
1275 __comp); in __partial_sort_copy()
[all …]
H A D_heap.c77 _Distance __topIndex, _Tp __val, _Compare __comp) in __push_heap() argument
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
182 _RandomAccessIterator __last, _Compare __comp) in pop_heap() argument
217 _Compare __comp, _Tp*, _Distance*) in __make_heap() argument
225 __comp); in __make_heap()
234 _RandomAccessIterator __last, _Compare __comp) in make_heap() argument
[all …]
H A 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()
98 : _M_t(__comp, __a) {} in _STLP_CREATE_ITERATOR_TRAITS()
263 explicit multiset(const _Compare& __comp) in _STLP_CREATE_ITERATOR_TRAITS()
264 : _M_t(__comp, allocator_type()) {} in _STLP_CREATE_ITERATOR_TRAITS()
267 : _M_t(__comp, __a) {} in _STLP_CREATE_ITERATOR_TRAITS()
277 const _Compare& __comp, in _STLP_CREATE_ITERATOR_TRAITS()
283 const _Compare& __comp) in _STLP_CREATE_ITERATOR_TRAITS()
292 const _Compare& __comp, in _STLP_CREATE_ITERATOR_TRAITS()
[all …]
H A 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()
H A 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()
108 : _M_t(__comp, __a) {} in _STLP_CREATE_ITERATOR_TRAITS()
133 const value_type* __last, const _Compare& __comp, in _STLP_CREATE_ITERATOR_TRAITS()
293 explicit multimap(const _Compare& __comp, in _STLP_CREATE_ITERATOR_TRAITS()
295 : _M_t(__comp, __a) { } in _STLP_CREATE_ITERATOR_TRAITS()
305 const _Compare& __comp) in _STLP_CREATE_ITERATOR_TRAITS()
310 const _Compare& __comp, in _STLP_CREATE_ITERATOR_TRAITS()
318 const _Compare& __comp, in _STLP_CREATE_ITERATOR_TRAITS()
[all …]
H A D_algo.h494 return _STLP_PRIV __lower_bound(__first, __last, __val, __comp, __comp, in lower_bound()
520 return _STLP_PRIV __upper_bound(__first, __last, __val, __comp, __comp, in upper_bound()
546 _Compare __comp) { in equal_range() argument
548 return _STLP_PRIV __equal_range(__first, __last, __val, __comp, __comp, in equal_range()
566 _Compare __comp) { in binary_search() argument
568 _ForwardIter __i = _STLP_PRIV __lower_bound(__first, __last, __val, __comp, __comp, in binary_search()
661 _Compare __comp);
671 _Compare __comp);
688 _Compare __comp);
697 _Compare __comp);
[all …]
H A D_slist.c149 _StrictWeakOrdering __comp) { in _Slist_merge() argument
155 if (__comp(__x.front(), __STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data)) { in _Slist_merge()
156 … _STLP_VERBOSE_ASSERT(!__comp(__STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data, __x.front()), in _Slist_merge()
169 if (__comp(__STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data, *__i2)) { in _Slist_merge()
170 _STLP_VERBOSE_ASSERT(!__comp(*__i2, __STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data), in _Slist_merge()
184 void _Slist_sort(slist<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp) { in _Slist_sort() argument
196 _STLP_PRIV _Slist_merge(__counter[__i], __carry, __comp); in _Slist_sort()
211 _STLP_PRIV _Slist_merge(__counter[__i], __counter[__i - 1], __comp); in _Slist_sort()
H A 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()
H A 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) {
409 _BinaryPredicate __comp) {
417 __comp);
436 _BinaryPredicate __comp) {
[all …]
H A 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 …]
H A 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); }
H A 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); }
H A 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)
H A D_tree.c408 bool __comp = true; in insert_unique() local
411 __comp = _M_key_compare(_KeyOfValue()(__val), _S_key(__x)); in insert_unique()
412 __x = __comp ? _S_left(__x) : _S_right(__x); in insert_unique()
415 if (__comp) { in insert_unique()
/reactos/sdk/include/c++/stlport/stl/pointers/
H A D_set.h130 explicit set(const _Compare& __comp,
149 : _M_t(__comp, _StorageTypeAlloc()) {
161 : _M_t(__comp, _STLP_CONVERT_ALLOCATOR(__a, _KeyStorageType)) {
189 : _M_t(__comp, _STLP_CONVERT_ALLOCATOR(__a, _KeyStorageType))
377 explicit multiset(const _Compare& __comp,
396 const _Compare& __comp)
397 : _M_t(__comp, _StorageTypeAlloc()) {
408 const _Compare& __comp,
427 const _Compare& __comp,
439 const _Compare& __comp,
[all …]
H A 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()
H A 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()
/reactos/base/services/nfsd/
H A Dtree.h168 int __comp; \
170 __comp = (cmp)(elm, (head)->sph_root); \
171 if(__comp < 0) { \
175 } else if (__comp > 0) { \
211 int __comp; \
217 if (__comp < 0) { \
227 } else if (__comp > 0) { \
253 if (__comp < 0) { \
257 if (__comp < 0){ \
263 } else if (__comp > 0) { \
[all …]
/reactos/sdk/include/c++/stlport/stl/debug/
H A 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()
H A 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()
H A D_slist.h600 void sort(_StrictWeakOrdering __comp) in sort() argument
601 { _M_non_dbg_impl.sort(__comp); } in sort()