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

/freebsd-11-stable/contrib/libstdc++/include/bits/
H A Dstl_heap.h88 __is_heap(_RandomAccessIterator __first, _StrictWeakOrdering __comp, argument
94 if (__comp(__first[__parent], __first[__child]))
110 _StrictWeakOrdering __comp)
111 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
163 _Distance __topIndex, _Tp __value, _Compare __comp)
167 && __comp(*(__first + __parent), __value))
190 _Compare __comp)
201 __glibcxx_requires_heap_pred(__first, __last - 1, __comp);
204 _DistanceType(0), _ValueType(*(__last - 1)), __comp);
273 _Distance __len, _Tp __value, _Compare __comp)
109 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _StrictWeakOrdering __comp) argument
162 __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __topIndex, _Tp __value, _Compare __comp) argument
189 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
272 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value, _Compare __comp) argument
296 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Tp __value, _Compare __comp) argument
319 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
384 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
448 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
[all...]
H A Dstl_algo.h121 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) argument
125 if (__comp(__a, __b))
126 if (__comp(__b, __c))
128 else if (__comp(__a, __c))
132 else if (__comp(__a, __c))
134 else if (__comp(__b, __c))
2274 _Tp __pivot, _Compare __comp)
2278 while (__comp(*__first, __pivot))
2281 while (__comp(__pivot, *__last))
2326 _Compare __comp)
2272 __unguarded_partition(_RandomAccessIterator __first, _RandomAccessIterator __last, _Tp __pivot, _Compare __comp) argument
2325 __unguarded_linear_insert(_RandomAccessIterator __last, _Tp __val, _Compare __comp) argument
2373 __insertion_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
2416 __unguarded_insertion_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
2452 __final_insertion_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
2492 __heap_select(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp) argument
2575 partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp) argument
2679 partial_sort_copy(_InputIterator __first, _InputIterator __last, _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) argument
2771 __introsort_loop(_RandomAccessIterator __first, _RandomAccessIterator __last, _Size __depth_limit, _Compare __comp) argument
2851 sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
2934 lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) argument
3031 upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) argument
3121 __merge_without_buffer(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Compare __comp) argument
3194 __inplace_stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
3291 merge(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) argument
3356 __merge_sort_loop(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 __result, _Distance __step_size, _Compare __comp) argument
3397 __chunk_insertion_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Distance __chunk_size, _Compare __comp) argument
3435 __merge_sort_with_buffer(_RandomAccessIterator __first, _RandomAccessIterator __last, _Pointer __buffer, _Compare __comp) argument
3506 __merge_backward(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BidirectionalIterator3 __result, _Compare __comp) argument
3641 __merge_adaptive(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Distance __buffer_size, _Compare __comp) argument
3767 inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Compare __comp) argument
3832 __stable_sort_adaptive(_RandomAccessIterator __first, _RandomAccessIterator __last, _Pointer __buffer, _Distance __buffer_size, _Compare __comp) argument
3917 stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
3980 __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Size __depth_limit, _Compare __comp) argument
4070 nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) argument
4170 equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) argument
4260 binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) argument
4348 includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) argument
4463 set_union(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) argument
4585 set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) argument
4702 set_difference(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) argument
4824 set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) argument
4908 max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) argument
4960 min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) argument
5051 next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) argument
5162 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) argument
5258 find_first_of(_InputIterator __first1, _InputIterator __last1, _ForwardIterator __first2, _ForwardIterator __last2, _BinaryPredicate __comp) argument
5315 __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, forward_iterator_tag, forward_iterator_tag, _BinaryPredicate __comp) argument
5377 __find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, bidirectional_iterator_tag, bidirectional_iterator_tag, _BinaryPredicate __comp) argument
5483 find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __comp) argument
[all...]
H A Dstl_multimap.h162 multimap(const _Compare& __comp, argument
164 : _M_t(__comp, __a) { }
203 const _Compare& __comp,
205 : _M_t(__comp, __a)
202 multimap(_InputIterator __first, _InputIterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument
H A Dstl_multiset.h140 multiset(const _Compare& __comp, argument
142 : _M_t(__comp, __a) { }
171 const _Compare& __comp,
173 : _M_t(__comp, __a)
170 multiset(_InputIterator __first, _InputIterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument
H A Dstl_set.h150 set(const _Compare& __comp, argument
152 : _M_t(__comp, __a) {}
181 const _Compare& __comp,
183 : _M_t(__comp, __a)
180 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument
H A Dstl_map.h165 map(const _Compare& __comp, const allocator_type& __a = allocator_type()) argument
166 : _M_t(__comp, __a) { }
205 const _Compare& __comp, const allocator_type& __a = allocator_type())
206 : _M_t(__comp, __a)
204 map(_InputIterator __first, _InputIterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument
H A Dstl_algobase.h226 min(const _Tp& __a, const _Tp& __b, _Compare __comp) argument
228 //return __comp(__b, __a) ? __b : __a;
229 if (__comp(__b, __a))
246 max(const _Tp& __a, const _Tp& __b, _Compare __comp) argument
248 //return __comp(__a, __b) ? __b : __a;
249 if (__comp(__a, __b))
878 _Compare __comp)
889 if (__comp(*__first1, *__first2))
891 if (__comp(*__first2, *__first1))
876 lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) argument
H A Dstl_tree.h420 _Rb_tree_impl(const _Key_compare& __comp, const _Node_allocator& __a) argument
421 : _Node_allocator(__a), _M_key_compare(__comp), _M_header(),
450 _Rb_tree_impl(const _Key_compare& __comp, const _Node_allocator& __a) argument
451 : _Node_allocator(__a), _M_key_compare(__comp), _M_header(),
591 _Rb_tree(const _Compare& __comp, argument
593 : _M_impl(__comp, __a)
993 bool __comp = true; local
997 __comp = _M_impl._M_key_compare(_KeyOfValue()(__v), _S_key(__x));
998 __x = __comp ? _S_left(__x) : _S_right(__x);
1001 if (__comp)
[all...]
/freebsd-11-stable/contrib/ntp/sntp/libevent/WIN32-Code/
H A 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 <
[all...]
/freebsd-11-stable/contrib/ipfilter/sys/
H A Dtree.h166 int __comp; \
168 __comp = (cmp)(elm, (head)->sph_root); \
169 if(__comp < 0) { \
173 } else if (__comp > 0) { \
209 int __comp; \
214 while ((__comp = (cmp)(elm, (head)->sph_root)) != 0) { \
215 if (__comp < 0) { \
225 } else if (__comp > 0) { \
243 void name##_SPLAY_MINMAX(struct name *head, int __comp) \
251 if (__comp <
[all...]
/freebsd-11-stable/crypto/openssh/openbsd-compat/
H A Dsys-tree.h170 int __comp; \
172 __comp = (cmp)(elm, (head)->sph_root); \
173 if(__comp < 0) { \
177 } else if (__comp > 0) { \
213 int __comp; \
218 while ((__comp = (cmp)(elm, (head)->sph_root))) { \
219 if (__comp < 0) { \
229 } else if (__comp > 0) { \
247 void name##_SPLAY_MINMAX(struct name *head, int __comp) \
255 if (__comp <
[all...]
/freebsd-11-stable/contrib/libstdc++/include/debug/
H A Dmultiset.h78 explicit multiset(const _Compare& __comp = _Compare(),
80 : _Base(__comp, __a) { }
84 const _Compare& __comp = _Compare(),
87 __comp, __a) { }
H A Dset.h78 explicit set(const _Compare& __comp = _Compare(),
80 : _Base(__comp, __a) { }
84 const _Compare& __comp = _Compare(),
87 __comp, __a) { }
H A Dmap.h78 explicit map(const _Compare& __comp = _Compare(),
80 : _Base(__comp, __a) { }
84 const _Compare& __comp = _Compare(),
87 __comp, __a), _Safe_base() { }
H A Dmultimap.h78 explicit multimap(const _Compare& __comp = _Compare(),
80 : _Base(__comp, __a) { }
84 const _Compare& __comp = _Compare(),
87 __comp, __a) { }
/freebsd-11-stable/sys/sys/
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; \
216 while ((__comp = (cmp)(elm, (head)->sph_root)) != 0) { \
217 if (__comp < 0) { \
227 } else if (__comp > 0) { \
245 void name##_SPLAY_MINMAX(struct name *head, int __comp) \
253 if (__comp <
[all...]
/freebsd-11-stable/contrib/libstdc++/include/ext/
H A Dbitmap_allocator.h255 const _Tp& __val, _Compare __comp)
271 if (__comp(*__middle, __val))
254 __lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) argument

Completed in 321 milliseconds