Searched refs:__comp (Results 1 - 11 of 11) sorted by relevance

/haiku/headers/cpp/
H A Dstl_heap.h76 _Distance __topIndex, _Tp __value, _Compare __comp)
79 while (__holeIndex > __topIndex && __comp(*(__first + __parent), __value)) {
91 _RandomAccessIterator __last, _Compare __comp,
95 _Tp(*(__last - 1)), __comp);
101 _Compare __comp)
103 __push_heap_aux(__first, __last, __comp,
157 _Distance __len, _Tp __value, _Compare __comp)
162 if (__comp(*(__first + __secondChild), *(__first + (__secondChild - 1))))
172 __push_heap(__first, __holeIndex, __topIndex, __value, __comp);
179 _RandomAccessIterator __result, _Tp __value, _Compare __comp,
75 __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __topIndex, _Tp __value, _Compare __comp) argument
90 __push_heap_aux(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, _Distance*, _Tp*) argument
100 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
156 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value, _Compare __comp) argument
178 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Tp __value, _Compare __comp, _Distance*) argument
189 __pop_heap_aux(_RandomAccessIterator __first, _RandomAccessIterator __last, _Tp*, _Compare __comp) argument
198 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
231 __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, _Tp*, _Distance*) argument
248 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
264 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
[all...]
H A Dstl_algo.h63 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) { argument
64 if (__comp(__a, __b))
65 if (__comp(__b, __c))
67 else if (__comp(__a, __c))
71 else if (__comp(__a, __c))
73 else if (__comp(__b, __c))
1131 _Tp __pivot, _Compare __comp)
1134 while (__comp(*__first, __pivot))
1137 while (__comp(__pivot, *__last))
1164 _Compare __comp) {
1129 __unguarded_partition(_RandomAccessIter __first, _RandomAccessIter __last, _Tp __pivot, _Compare __comp) argument
1163 __unguarded_linear_insert(_RandomAccessIter __last, _Tp __val, _Compare __comp) argument
1188 __linear_insert(_RandomAccessIter __first, _RandomAccessIter __last, _Tp*, _Compare __comp) argument
1207 __insertion_sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp) argument
1228 __unguarded_insertion_sort_aux(_RandomAccessIter __first, _RandomAccessIter __last, _Tp*, _Compare __comp) argument
1236 __unguarded_insertion_sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp) argument
1255 __final_insertion_sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp) argument
1294 __introsort_loop(_RandomAccessIter __first, _RandomAccessIter __last, _Tp*, _Size __depth_limit, _Compare __comp) argument
1326 sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp) argument
1355 __inplace_stable_sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp) argument
1391 __merge_sort_loop(_RandomAccessIter1 __first, _RandomAccessIter1 __last, _RandomAccessIter2 __result, _Distance __step_size, _Compare __comp) argument
1426 __chunk_insertion_sort(_RandomAccessIter __first, _RandomAccessIter __last, _Distance __chunk_size, _Compare __comp) argument
1457 __merge_sort_with_buffer(_RandomAccessIter __first, _RandomAccessIter __last, _Pointer __buffer, _Distance*, _Compare __comp) argument
1494 __stable_sort_adaptive(_RandomAccessIter __first, _RandomAccessIter __last, _Pointer __buffer, _Distance __buffer_size, _Compare __comp) argument
1528 __stable_sort_aux(_RandomAccessIter __first, _RandomAccessIter __last, _Tp*, _Distance*, _Compare __comp) argument
1549 stable_sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp) argument
1578 __partial_sort(_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last, _Tp*, _Compare __comp) argument
1589 partial_sort(_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last, _Compare __comp) argument
1633 __partial_sort_copy(_InputIter __first, _InputIter __last, _RandomAccessIter __result_first, _RandomAccessIter __result_last, _Compare __comp, _Distance*, _Tp*) argument
1660 partial_sort_copy(_InputIter __first, _InputIter __last, _RandomAccessIter __result_first, _RandomAccessIter __result_last, _Compare __comp) argument
1695 __nth_element(_RandomAccessIter __first, _RandomAccessIter __nth, _RandomAccessIter __last, _Tp*, _Compare __comp) argument
1714 nth_element(_RandomAccessIter __first, _RandomAccessIter __nth, _RandomAccessIter __last, _Compare __comp) argument
1754 __lower_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp, _Distance*) argument
1778 lower_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp) argument
1816 __upper_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp, _Distance*) argument
1840 upper_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp) argument
1886 __equal_range(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp, _Distance*) argument
1917 equal_range(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp) argument
1931 binary_search(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp) argument
1960 merge(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp) argument
2016 __merge_without_buffer(_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Distance __len1, _Distance __len2, _Compare __comp) argument
2106 __merge_backward(_BidirectionalIter1 __first1, _BidirectionalIter1 __last1, _BidirectionalIter2 __first2, _BidirectionalIter2 __last2, _BidirectionalIter3 __result, _Compare __comp) argument
2177 __merge_adaptive(_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Distance __buffer_size, _Compare __comp) argument
2238 __inplace_merge_aux(_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Tp*, _Distance*, _Compare __comp) argument
2267 inplace_merge(_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Compare __comp) argument
2297 includes(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _Compare __comp) argument
2335 set_union(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp) argument
2377 set_intersection(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp) argument
2415 set_difference(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp) argument
2459 set_symmetric_difference(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp) argument
2495 max_element(_ForwardIter __first, _ForwardIter __last, _Compare __comp) argument
2515 min_element(_ForwardIter __first, _ForwardIter __last, _Compare __comp) argument
2558 next_permutation(_BidirectionalIter __first, _BidirectionalIter __last, _Compare __comp) argument
2617 prev_permutation(_BidirectionalIter __first, _BidirectionalIter __last, _Compare __comp) argument
2660 find_first_of(_InputIter __first1, _InputIter __last1, _ForwardIter __first2, _ForwardIter __last2, _BinaryPredicate __comp) argument
2703 __find_end(_ForwardIter1 __first1, _ForwardIter1 __last1, _ForwardIter2 __first2, _ForwardIter2 __last2, forward_iterator_tag, forward_iterator_tag, _BinaryPredicate __comp) argument
2755 __find_end(_BidirectionalIter1 __first1, _BidirectionalIter1 __last1, _BidirectionalIter2 __first2, _BidirectionalIter2 __last2, bidirectional_iterator_tag, bidirectional_iterator_tag, _BinaryPredicate __comp) argument
2794 find_end(_ForwardIter1 __first1, _ForwardIter1 __last1, _ForwardIter2 __first2, _ForwardIter2 __last2, _BinaryPredicate __comp) argument
2822 __is_heap(_RandomAccessIter __first, _StrictWeakOrdering __comp, _Distance __n) argument
2843 is_heap(_RandomAccessIter __first, _RandomAccessIter __last, _StrictWeakOrdering __comp) argument
2869 is_sorted(_ForwardIter __first, _ForwardIter __last, _StrictWeakOrdering __comp) argument
[all...]
H A Dstl_multiset.h76 explicit multiset(const _Compare& __comp, argument
78 : _M_t(__comp, __a) {}
89 const _Compare& __comp,
91 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); }
100 const _Compare& __comp,
102 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); }
109 const _Compare& __comp,
111 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); }
88 multiset(_InputIterator __first, _InputIterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument
99 multiset(const value_type* __first, const value_type* __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument
108 multiset(const_iterator __first, const_iterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument
H A Dstl_set.h76 explicit set(const _Compare& __comp, argument
78 : _M_t(__comp, __a) {}
87 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp, argument
89 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
96 const value_type* __last, const _Compare& __comp,
98 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
104 set(const_iterator __first, const_iterator __last, const _Compare& __comp, argument
106 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
95 set(const value_type* __first, const value_type* __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument
H A Dstl_map.h91 explicit map(const _Compare& __comp, argument
93 : _M_t(__comp, __a) {}
102 map(_InputIterator __first, _InputIterator __last, const _Compare& __comp, argument
104 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
111 const value_type* __last, const _Compare& __comp,
113 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
119 map(const_iterator __first, const_iterator __last, const _Compare& __comp, argument
121 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
110 map(const value_type* __first, const value_type* __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument
H A Dstl_multimap.h90 explicit multimap(const _Compare& __comp, argument
92 : _M_t(__comp, __a) { }
102 const _Compare& __comp,
104 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); }
110 const _Compare& __comp,
112 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); }
118 const _Compare& __comp,
120 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); }
101 multimap(_InputIterator __first, _InputIterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument
109 multimap(const value_type* __first, const value_type* __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument
117 multimap(const_iterator __first, const_iterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument
H A Dstl_algobase.h103 inline const _Tp& min(const _Tp& __a, const _Tp& __b, _Compare __comp) { argument
104 return __comp(__b, __a) ? __b : __a;
108 inline const _Tp& max(const _Tp& __a, const _Tp& __b, _Compare __comp) { argument
109 return __comp(__a, __b) ? __b : __a;
423 _Compare __comp) {
426 if (__comp(*__first1, *__first2))
428 if (__comp(*__first2, *__first1))
421 lexicographical_compare(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _Compare __comp) argument
H A Dstl_slist.h680 void sort(_StrictWeakOrdering __comp);
891 _StrictWeakOrdering __comp)
895 if (__comp(((_Node*) __x._M_head._M_next)->_M_data,
907 void slist<_Tp,_Alloc>::sort(_StrictWeakOrdering __comp) argument
917 __counter[__i].merge(__carry, __comp);
927 __counter[__i].merge(__counter[__i-1], __comp);
890 merge(slist<_Tp,_Alloc>& __x, _StrictWeakOrdering __comp) argument
H A Dstl_tree.h648 _Rb_tree(const _Compare& __comp) argument
649 : _Base(allocator_type()), _M_node_count(0), _M_key_compare(__comp)
652 _Rb_tree(const _Compare& __comp, const allocator_type& __a) argument
653 : _Base(__a), _M_node_count(0), _M_key_compare(__comp)
881 bool __comp = true; local
884 __comp = _M_key_compare(_KeyOfValue()(__v), _S_key(__x));
885 __x = __comp ? _S_left(__x) : _S_right(__x);
888 if (__comp)
1316 rb_tree(const _Compare& __comp = _Compare(),
1318 : _Base(__comp, __
[all...]
H A Dstl_list.h784 _StrictWeakOrdering __comp)
791 if (__comp(*__first2, *__first1)) {
802 void list<_Tp, _Alloc>::sort(_StrictWeakOrdering __comp) argument
814 __counter[__i].merge(__carry, __comp);
822 __counter[__i].merge(__counter[__i-1], __comp);
783 merge(list<_Tp, _Alloc>& __x, _StrictWeakOrdering __comp) argument
/haiku/src/libs/compat/openbsd_wlan/sys/
H A Dtree.h165 int __comp; \
167 __comp = (cmp)(elm, (head)->sph_root); \
168 if(__comp < 0) { \
172 } else if (__comp > 0) { \
208 int __comp; \
213 while ((__comp = (cmp)(elm, (head)->sph_root))) { \
214 if (__comp < 0) { \
224 } else if (__comp > 0) { \
242 void name##_SPLAY_MINMAX(struct name *head, int __comp) \
250 if (__comp <
[all...]

Completed in 94 milliseconds