Home
last modified time | relevance | path

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

12

/openbsd/src/gnu/gcc/libstdc++-v3/include/bits/
Dstl_heap.h88 __is_heap(_RandomAccessIterator __first, _StrictWeakOrdering __comp, in __is_heap() argument
94 if (__comp(__first[__parent], __first[__child])) in __is_heap()
110 _StrictWeakOrdering __comp) in __is_heap() argument
111 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); } in __is_heap()
163 _Distance __topIndex, _Tp __value, _Compare __comp) in __push_heap() argument
167 && __comp(*(__first + __parent), __value)) in __push_heap()
190 _Compare __comp) in push_heap() argument
201 __glibcxx_requires_heap_pred(__first, __last - 1, __comp); in push_heap()
204 _DistanceType(0), _ValueType(*(__last - 1)), __comp); in push_heap()
273 _Distance __len, _Tp __value, _Compare __comp) in __adjust_heap() argument
[all …]
Dstl_algo.h121 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) in __median() argument
125 if (__comp(__a, __b)) in __median()
126 if (__comp(__b, __c)) in __median()
128 else if (__comp(__a, __c)) in __median()
132 else if (__comp(__a, __c)) in __median()
134 else if (__comp(__b, __c)) in __median()
2274 _Tp __pivot, _Compare __comp) in __unguarded_partition() argument
2278 while (__comp(*__first, __pivot)) in __unguarded_partition()
2281 while (__comp(__pivot, *__last)) in __unguarded_partition()
2326 _Compare __comp) in __unguarded_linear_insert() argument
[all …]
Dlist.tcc242 merge(list& __x, _StrictWeakOrdering __comp) in merge() argument
255 if (__comp(*__first2, *__first1)) in merge()
348 sort(_StrictWeakOrdering __comp) in sort() argument
367 __counter->merge(__carry, __comp); in sort()
377 __counter->merge(*(__counter - 1), __comp); in sort()
Dstl_multiset.h140 multiset(const _Compare& __comp, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
142 : _M_t(__comp, __a) { } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
171 const _Compare& __comp, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
173 : _M_t(__comp, __a) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
Dstl_set.h150 set(const _Compare& __comp, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
152 : _M_t(__comp, __a) {} in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
181 const _Compare& __comp, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
183 : _M_t(__comp, __a) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
Dstl_multimap.h162 multimap(const _Compare& __comp, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
164 : _M_t(__comp, __a) { } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
203 const _Compare& __comp, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
205 : _M_t(__comp, __a) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
Dstl_algobase.h226 min(const _Tp& __a, const _Tp& __b, _Compare __comp)
229 if (__comp(__b, __a))
246 max(const _Tp& __a, const _Tp& __b, _Compare __comp)
249 if (__comp(__a, __b))
878 _Compare __comp)
889 if (__comp(*__first1, *__first2))
891 if (__comp(*__first2, *__first1))
Dstl_map.h165 map(const _Compare& __comp, const allocator_type& __a = allocator_type()) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
166 : _M_t(__comp, __a) { } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
205 const _Compare& __comp, const allocator_type& __a = allocator_type()) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
206 : _M_t(__comp, __a) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
/openbsd/src/gnu/lib/libstdc++/libstdc++/include/bits/
Dstl_heap.h104 _Distance __topIndex, _Tp __value, _Compare __comp) in __push_heap() argument
107 while (__holeIndex > __topIndex && __comp(*(__first + __parent), __value)) { in __push_heap()
118 _Compare __comp) in push_heap() argument
130 _ValueType(*(__last - 1)), __comp); in push_heap()
182 _Distance __len, _Tp __value, _Compare __comp) in __adjust_heap() argument
187 if (__comp(*(__first + __secondChild), *(__first + (__secondChild - 1)))) in __adjust_heap()
197 __push_heap(__first, __holeIndex, __topIndex, __value, __comp); in __adjust_heap()
203 _RandomAccessIterator __result, _Tp __value, _Compare __comp) in __pop_heap() argument
208 __value, __comp); in __pop_heap()
214 _RandomAccessIterator __last, _Compare __comp) in pop_heap() argument
[all …]
Dstl_algo.h120 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) in __median() argument
124 if (__comp(__a, __b)) in __median()
125 if (__comp(__b, __c)) in __median()
127 else if (__comp(__a, __c)) in __median()
131 else if (__comp(__a, __c)) in __median()
133 else if (__comp(__b, __c)) in __median()
1909 _Tp __pivot, _Compare __comp) in __unguarded_partition() argument
1912 while (__comp(*__first, __pivot)) in __unguarded_partition()
1915 while (__comp(__pivot, *__last)) in __unguarded_partition()
1959 __unguarded_linear_insert(_RandomAccessIter __last, _Tp __val, _Compare __comp) in __unguarded_linear_insert() argument
[all …]
Dlist.tcc323 merge(list& __x, _StrictWeakOrdering __comp) in merge() argument
334 if (__comp(*__first2, *__first1)) in merge()
350 sort(_StrictWeakOrdering __comp) in sort() argument
364 __counter[__i].merge(__carry, __comp); in sort()
372 __counter[__i].merge(__counter[__i-1], __comp); in sort()
Dstl_algobase.h188 min(const _Tp& __a, const _Tp& __b, _Compare __comp) in min() argument
191 if (__comp(__b, __a)) return __b; return __a; in min()
206 max(const _Tp& __a, const _Tp& __b, _Compare __comp) in max() argument
209 if (__comp(__a, __b)) return __b; return __a; in max()
771 _Compare __comp)
779 if (__comp(*__first1, *__first2))
781 if (__comp(*__first2, *__first1))
Dstl_multiset.h118 explicit multiset(const _Compare& __comp,
120 : _M_t(__comp, __a) {} in _M_t() argument
129 const _Compare& __comp,
131 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } in _M_t() argument
Dstl_map.h151 map(const _Compare& __comp, const allocator_type& __a = allocator_type())
152 : _M_t(__comp, __a) { } in _M_t() argument
191 const _Compare& __comp, const allocator_type& __a = allocator_type())
192 : _M_t(__comp, __a) in _M_t() argument
Dstl_set.h117 explicit set(const _Compare& __comp,
119 : _M_t(__comp, __a) {} in _M_t() argument
127 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
129 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); } in _M_t() argument
Dstl_multimap.h164 multimap(const _Compare& __comp, const allocator_type& __a = allocator_type())
165 : _M_t(__comp, __a) { } in _M_t() argument
204 const _Compare& __comp,
206 : _M_t(__comp, __a) in _M_t() argument
/openbsd/src/gnu/llvm/clang/lib/Headers/
D__clang_cuda_texture_intrinsics.h444 (float __x, float __y, int __comp), instr, "f32", \
449 (float __x, float __y, unsigned char *__ir, int __comp), \
463 int __comp) {
464 switch (__comp) {
467 __obj, __x, __y, __comp);
470 __obj, __x, __y, __comp);
473 __obj, __x, __y, __comp);
476 __obj, __x, __y, __comp);
485 float __y, int __comp) {
486 switch (__comp) {
[all …]
/openbsd/src/gnu/llvm/libcxx/include/
Dqueue539 explicit priority_queue(const value_compare& __comp)
540 : c(), comp(__comp) {}
542 priority_queue(const value_compare& __comp, const container_type& __c);
545 priority_queue(const value_compare& __comp, container_type&& __c);
550 const value_compare& __comp = value_compare());
554 const value_compare& __comp, const container_type& __c);
559 const value_compare& __comp, container_type&& __c);
567 priority_queue(const value_compare& __comp, const _Alloc& __a,
571 priority_queue(const value_compare& __comp, const container_type& __c,
581 priority_queue(const value_compare& __comp, container_type&& __c,
[all …]
Dset569 explicit set(const value_compare& __comp)
573 : __tree_(__comp) {}
576 explicit set(const value_compare& __comp, const allocator_type& __a)
577 : __tree_(__comp, __a) {}
581 const value_compare& __comp = value_compare())
582 : __tree_(__comp)
589 set(_InputIterator __f, _InputIterator __l, const value_compare& __comp,
591 : __tree_(__comp, __a)
639 set(initializer_list<value_type> __il, const value_compare& __comp = value_compare())
640 : __tree_(__comp)
[all …]
Dforward_list855 void merge(forward_list&& __x, _Compare __comp)
856 {merge(__x, _VSTD::move(__comp));}
860 template <class _Compare> void merge(forward_list& __x, _Compare __comp);
863 template <class _Compare> _LIBCPP_INLINE_VISIBILITY void sort(_Compare __comp);
877 __merge(__node_pointer __f1, __node_pointer __f2, _Compare& __comp);
882 __sort(__node_pointer __f, difference_type __sz, _Compare& __comp);
1581 forward_list<_Tp, _Alloc>::merge(forward_list& __x, _Compare __comp)
1587 __comp);
1596 _Compare& __comp)
1603 if (__comp(__f2->__value_, __f1->__value_))
[all …]
/openbsd/src/sys/sys/
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 < 0) { \
[all …]
/openbsd/src/gnu/gcc/libstdc++-v3/include/debug/
Dset.h78 explicit set(const _Compare& __comp = _Compare(),
80 : _Base(__comp, __a) { } in _Base() argument
84 const _Compare& __comp = _Compare(),
87 __comp, __a) { } in _Base() argument
Dmultiset.h78 explicit multiset(const _Compare& __comp = _Compare(),
80 : _Base(__comp, __a) { } in _Base() argument
84 const _Compare& __comp = _Compare(),
87 __comp, __a) { } in _Base() argument
Dmultimap.h80 explicit multimap(const _Compare& __comp = _Compare(),
82 : _Base(__comp, __a) { } in _Base() argument
86 const _Compare& __comp = _Compare(),
89 __comp, __a) { } in _Base() argument
Dmap.h80 explicit map(const _Compare& __comp = _Compare(),
82 : _Base(__comp, __a) { } in _Base() argument
86 const _Compare& __comp = _Compare(),
89 __comp, __a), _Safe_base() { } in _Base() argument

12