| /netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/ |
| H A D | stl_heap.h | 77 _Compare& __comp) in _GLIBCXX_VISIBILITY()
82 if (__comp(__first + __parent, __first + __child)) in _GLIBCXX_VISIBILITY()
97 __gnu_cxx::__ops::_Iter_less_iter __comp; in _GLIBCXX_VISIBILITY() local
98 return std::__is_heap_until(__first, __n, __comp) == __n; in _GLIBCXX_VISIBILITY()
105 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n) in _GLIBCXX_VISIBILITY()
107 typedef __decltype(__comp) _Cmp; in _GLIBCXX_VISIBILITY()
108 __gnu_cxx::__ops::_Iter_comp_iter<_Cmp> __cmp(_GLIBCXX_MOVE(__comp)); in _GLIBCXX_VISIBILITY()
122 _Compare __comp) in _GLIBCXX_VISIBILITY()
124 return std::__is_heap(__first, _GLIBCXX_MOVE(__comp), in _GLIBCXX_VISIBILITY()
137 _Compare& __comp) in _GLIBCXX_VISIBILITY()
[all …]
|
| H A D | predefined_ops.h | 150 _Iter_comp_iter(_Compare __comp) in _Iter_comp_iter()
151 : _M_comp(_GLIBCXX_MOVE(__comp)) in _Iter_comp_iter()
164 __iter_comp_iter(_Compare __comp) in __iter_comp_iter() argument
165 { return _Iter_comp_iter<_Compare>(_GLIBCXX_MOVE(__comp)); } in __iter_comp_iter()
174 _Iter_comp_val(_Compare __comp) in _Iter_comp_val()
175 : _M_comp(_GLIBCXX_MOVE(__comp)) in _Iter_comp_val()
180 _Iter_comp_val(const _Iter_comp_iter<_Compare>& __comp) in _Iter_comp_val()
181 : _M_comp(__comp._M_comp) in _Iter_comp_val()
187 _Iter_comp_val(_Iter_comp_iter<_Compare>&& __comp) in _Iter_comp_val()
188 : _M_comp(std::move(__comp._M_comp)) in _Iter_comp_val()
[all …]
|
| H A D | stl_algo.h | 83 _Iterator __c, _Compare __comp) in _GLIBCXX_VISIBILITY()
85 if (__comp(__a, __b)) in _GLIBCXX_VISIBILITY()
87 if (__comp(__b, __c)) in _GLIBCXX_VISIBILITY()
89 else if (__comp(__a, __c)) in _GLIBCXX_VISIBILITY()
94 else if (__comp(__a, __c)) in _GLIBCXX_VISIBILITY()
96 else if (__comp(__b, __c)) in _GLIBCXX_VISIBILITY()
283 _BinaryPredicate __comp) in _GLIBCXX_VISIBILITY()
292 = std::__search(__first1, __last1, __first2, __last2, __comp); in _GLIBCXX_VISIBILITY()
314 _BinaryPredicate __comp) in _GLIBCXX_VISIBILITY()
329 __comp); in _GLIBCXX_VISIBILITY()
[all …]
|
| H A D | ranges_algo.h | 49 __make_comp_proj(_Comp& __comp, _Proj& __proj) in _GLIBCXX_VISIBILITY()
54 return std::__invoke(__comp, in _GLIBCXX_VISIBILITY()
1158 _Comp __comp = {}, _Proj __proj = {}) const in _GLIBCXX_VISIBILITY()
1160 __first = ranges::adjacent_find(__first, __last, __comp, __proj); in _GLIBCXX_VISIBILITY()
1167 if (!std::__invoke(__comp, in _GLIBCXX_VISIBILITY()
1179 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const in _GLIBCXX_VISIBILITY()
1182 std::move(__comp), std::move(__proj)); in _GLIBCXX_VISIBILITY()
1210 _Comp __comp = {}, _Proj __proj = {}) const in _GLIBCXX_VISIBILITY()
1221 if (!std::__invoke(__comp, in _GLIBCXX_VISIBILITY()
1234 if (!std::__invoke(__comp, in _GLIBCXX_VISIBILITY()
[all …]
|
| /netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/ |
| H A D | stl_heap.h | 76 _Compare& __comp) in _GLIBCXX_VISIBILITY()
81 if (__comp(__first + __parent, __first + __child)) in _GLIBCXX_VISIBILITY()
96 __gnu_cxx::__ops::_Iter_less_iter __comp; in _GLIBCXX_VISIBILITY() local
97 return std::__is_heap_until(__first, __n, __comp) == __n; in _GLIBCXX_VISIBILITY()
104 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n) in _GLIBCXX_VISIBILITY()
106 typedef __decltype(__comp) _Cmp; in _GLIBCXX_VISIBILITY()
107 __gnu_cxx::__ops::_Iter_comp_iter<_Cmp> __cmp(_GLIBCXX_MOVE(__comp)); in _GLIBCXX_VISIBILITY()
121 _Compare __comp) in _GLIBCXX_VISIBILITY()
123 return std::__is_heap(__first, _GLIBCXX_MOVE(__comp), in _GLIBCXX_VISIBILITY()
136 _Compare& __comp) in _GLIBCXX_VISIBILITY()
[all …]
|
| H A D | predefined_ops.h | 148 _Iter_comp_iter(_Compare __comp) in _Iter_comp_iter()
149 : _M_comp(_GLIBCXX_MOVE(__comp)) in _Iter_comp_iter()
162 __iter_comp_iter(_Compare __comp) in __iter_comp_iter() argument
163 { return _Iter_comp_iter<_Compare>(_GLIBCXX_MOVE(__comp)); } in __iter_comp_iter()
172 _Iter_comp_val(_Compare __comp) in _Iter_comp_val()
173 : _M_comp(_GLIBCXX_MOVE(__comp)) in _Iter_comp_val()
178 _Iter_comp_val(const _Iter_comp_iter<_Compare>& __comp) in _Iter_comp_val()
179 : _M_comp(__comp._M_comp) in _Iter_comp_val()
185 _Iter_comp_val(_Iter_comp_iter<_Compare>&& __comp) in _Iter_comp_val()
186 : _M_comp(std::move(__comp._M_comp)) in _Iter_comp_val()
[all …]
|
| H A D | stl_algo.h | 80 _Iterator __c, _Compare __comp) in _GLIBCXX_VISIBILITY()
82 if (__comp(__a, __b)) in _GLIBCXX_VISIBILITY()
84 if (__comp(__b, __c)) in _GLIBCXX_VISIBILITY()
86 else if (__comp(__a, __c)) in _GLIBCXX_VISIBILITY()
91 else if (__comp(__a, __c)) in _GLIBCXX_VISIBILITY()
93 else if (__comp(__b, __c)) in _GLIBCXX_VISIBILITY()
280 _BinaryPredicate __comp) in _GLIBCXX_VISIBILITY()
289 = std::__search(__first1, __last1, __first2, __last2, __comp); in _GLIBCXX_VISIBILITY()
311 _BinaryPredicate __comp) in _GLIBCXX_VISIBILITY()
326 __comp); in _GLIBCXX_VISIBILITY()
[all …]
|
| H A D | ranges_algo.h | 48 __make_comp_proj(_Comp& __comp, _Proj& __proj) in _GLIBCXX_VISIBILITY()
53 return std::__invoke(__comp, in _GLIBCXX_VISIBILITY()
1368 _Comp __comp = {}, _Proj __proj = {}) const in _GLIBCXX_VISIBILITY()
1370 __first = ranges::adjacent_find(__first, __last, __comp, __proj); in _GLIBCXX_VISIBILITY()
1377 if (!std::__invoke(__comp, in _GLIBCXX_VISIBILITY()
1389 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const in _GLIBCXX_VISIBILITY()
1392 std::move(__comp), std::move(__proj)); in _GLIBCXX_VISIBILITY()
1420 _Comp __comp = {}, _Proj __proj = {}) const in _GLIBCXX_VISIBILITY()
1431 if (!std::__invoke(__comp, in _GLIBCXX_VISIBILITY()
1444 if (!std::__invoke(__comp, in _GLIBCXX_VISIBILITY()
[all …]
|
| /netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/include/parallel/ |
| H A D | multiway_merge.h | 83 _Compare& __comp; variable
91 _GuardedIterator(_RAIter __begin, _RAIter __end, _Compare& __comp) in _GuardedIterator() argument
92 : _M_current(__begin), _M_end(__end), __comp(__comp) in _GuardedIterator()
127 return (__bi1.__comp)(*__bi1, *__bi2); // normal compare
142 return !(__bi1.__comp)(*__bi2, *__bi1); // normal compare
153 _Compare& __comp; variable
161 _RAIter /* __end */, _Compare& __comp) in _UnguardedIterator() argument
162 : _M_current(__begin), __comp(__comp) in _UnguardedIterator()
194 return (__bi1.__comp)(*__bi1, *__bi2);
206 return !(__bi1.__comp)(*__bi2, *__bi1);
[all …]
|
| H A D | sort.h | 62 _Compare __comp, _Parallelism __parallelism);
76 _Compare __comp, multiway_mergesort_tag __parallelism) in __parallel_sort() argument
82 (__begin, __end, __comp, __parallelism.__get_num_threads()); in __parallel_sort()
85 (__begin, __end, __comp, __parallelism.__get_num_threads()); in __parallel_sort()
100 _Compare __comp, in __parallel_sort() argument
106 (__begin, __end, __comp, __parallelism.__get_num_threads()); in __parallel_sort()
121 _Compare __comp, in __parallel_sort() argument
127 (__begin, __end, __comp, __parallelism.__get_num_threads()); in __parallel_sort()
141 _Compare __comp, quicksort_tag __parallelism) in __parallel_sort() argument
147 __parallel_sort_qs(__begin, __end, __comp, in __parallel_sort()
[all …]
|
| H A D | balanced_quicksort.h | 104 _Compare __comp, _ThreadIndex __num_threads) in __qsb_divide() argument
114 __end - 1, __comp); in __qsb_divide()
120 _GLIBCXX_PARALLEL_ASSERT((!__comp(*__pivot_pos, *__begin) in __qsb_divide()
121 && !__comp(*(__begin + __n / 2), in __qsb_divide()
123 || (!__comp(*__pivot_pos, *__begin) in __qsb_divide()
124 && !__comp(*(__end - 1), *__pivot_pos)) in __qsb_divide()
125 || (!__comp(*__pivot_pos, *(__begin + __n / 2)) in __qsb_divide()
126 && !__comp(*__begin, *__pivot_pos)) in __qsb_divide()
127 || (!__comp(*__pivot_pos, *(__begin + __n / 2)) in __qsb_divide()
128 && !__comp(*(__end - 1), *__pivot_pos)) in __qsb_divide()
[all …]
|
| H A D | quicksort.h | 52 _Compare __comp, typename std::iterator_traits in __parallel_sort_qs_divide() argument
76 __gnu_sequential::sort(__samples, __samples + __num_samples, __comp); in __parallel_sort_qs_divide()
81 __pred(__comp, __pivot); in __parallel_sort_qs_divide()
102 _Compare __comp, in __parallel_sort_qs_conquer() argument
111 __gnu_sequential::sort(__begin, __end, __comp); in __parallel_sort_qs_conquer()
130 (__begin, __end, __comp, __pivot_rank, in __parallel_sort_qs_conquer()
137 __comp, __num_threads_left); in __parallel_sort_qs_conquer()
140 __comp, __num_threads - __num_threads_left); in __parallel_sort_qs_conquer()
155 _Compare __comp, in __parallel_sort_qs() argument
171 __begin, __begin + __n, __comp, __num_threads); in __parallel_sort_qs()
|
| H A D | multiway_mergesort.h | 133 _Compare& __comp,
155 __comp);
192 _Compare& __comp,
209 __comp);
223 __comp)
237 __comp)
255 const _RAIter& __end, _Compare& __comp) const
256 { __gnu_sequential::stable_sort(__begin, __end, __comp); }
263 const _RAIter __end, _Compare& __comp) const
264 { __gnu_sequential::sort(__begin, __end, __comp); }
[all …]
|
| H A D | merge.h | 60 _DifferenceTp __max_length, _Compare __comp) in __merge_advance_usual() argument
66 if (__comp(*__begin2, *__begin1)) in __merge_advance_usual()
108 _DifferenceTp __max_length, _Compare __comp) in __merge_advance_movc() argument
127 if (__comp(__element2, __element1)) in __merge_advance_movc()
174 _Compare __comp) in __merge_advance() argument
179 __target, __max_length, __comp); in __merge_advance()
201 difference_type __max_length, _Compare __comp) in __parallel_merge_advance() argument
203 __max_length, __comp); } in __parallel_merge_advance()
227 difference_type __max_length, _Compare __comp) in __parallel_merge_advance() argument
244 _Compare, _DifferenceType1>, __max_length, __comp, in __parallel_merge_advance()
|
| /netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/parallel/ |
| H A D | multiway_merge.h | 83 _Compare& __comp; variable
91 _GuardedIterator(_RAIter __begin, _RAIter __end, _Compare& __comp) in _GuardedIterator() argument
92 : _M_current(__begin), _M_end(__end), __comp(__comp) in _GuardedIterator()
127 return (__bi1.__comp)(*__bi1, *__bi2); // normal compare
142 return !(__bi1.__comp)(*__bi2, *__bi1); // normal compare
153 _Compare& __comp; variable
161 _RAIter /* __end */, _Compare& __comp) in _UnguardedIterator() argument
162 : _M_current(__begin), __comp(__comp) in _UnguardedIterator()
194 return (__bi1.__comp)(*__bi1, *__bi2);
206 return !(__bi1.__comp)(*__bi2, *__bi1);
[all …]
|
| H A D | sort.h | 62 _Compare __comp, _Parallelism __parallelism);
76 _Compare __comp, multiway_mergesort_tag __parallelism) in __parallel_sort() argument
82 (__begin, __end, __comp, __parallelism.__get_num_threads()); in __parallel_sort()
85 (__begin, __end, __comp, __parallelism.__get_num_threads()); in __parallel_sort()
100 _Compare __comp, in __parallel_sort() argument
106 (__begin, __end, __comp, __parallelism.__get_num_threads()); in __parallel_sort()
121 _Compare __comp, in __parallel_sort() argument
127 (__begin, __end, __comp, __parallelism.__get_num_threads()); in __parallel_sort()
141 _Compare __comp, quicksort_tag __parallelism) in __parallel_sort() argument
147 __parallel_sort_qs(__begin, __end, __comp, in __parallel_sort()
[all …]
|
| H A D | balanced_quicksort.h | 104 _Compare __comp, _ThreadIndex __num_threads) in __qsb_divide() argument
114 __end - 1, __comp); in __qsb_divide()
120 _GLIBCXX_PARALLEL_ASSERT((!__comp(*__pivot_pos, *__begin) in __qsb_divide()
121 && !__comp(*(__begin + __n / 2), in __qsb_divide()
123 || (!__comp(*__pivot_pos, *__begin) in __qsb_divide()
124 && !__comp(*(__end - 1), *__pivot_pos)) in __qsb_divide()
125 || (!__comp(*__pivot_pos, *(__begin + __n / 2)) in __qsb_divide()
126 && !__comp(*__begin, *__pivot_pos)) in __qsb_divide()
127 || (!__comp(*__pivot_pos, *(__begin + __n / 2)) in __qsb_divide()
128 && !__comp(*(__end - 1), *__pivot_pos)) in __qsb_divide()
[all …]
|
| H A D | quicksort.h | 52 _Compare __comp, typename std::iterator_traits in __parallel_sort_qs_divide() argument
76 __gnu_sequential::sort(__samples, __samples + __num_samples, __comp); in __parallel_sort_qs_divide()
81 __pred(__comp, __pivot); in __parallel_sort_qs_divide()
102 _Compare __comp, in __parallel_sort_qs_conquer() argument
111 __gnu_sequential::sort(__begin, __end, __comp); in __parallel_sort_qs_conquer()
130 (__begin, __end, __comp, __pivot_rank, in __parallel_sort_qs_conquer()
137 __comp, __num_threads_left); in __parallel_sort_qs_conquer()
140 __comp, __num_threads - __num_threads_left); in __parallel_sort_qs_conquer()
155 _Compare __comp, in __parallel_sort_qs() argument
171 __begin, __begin + __n, __comp, __num_threads); in __parallel_sort_qs()
|
| H A D | multiway_mergesort.h | 133 _Compare& __comp,
155 __comp);
192 _Compare& __comp,
209 __comp);
223 __comp)
237 __comp)
255 const _RAIter& __end, _Compare& __comp) const
256 { __gnu_sequential::stable_sort(__begin, __end, __comp); }
263 const _RAIter __end, _Compare& __comp) const
264 { __gnu_sequential::sort(__begin, __end, __comp); }
[all …]
|
| H A D | merge.h | 60 _DifferenceTp __max_length, _Compare __comp) in __merge_advance_usual() argument
66 if (__comp(*__begin2, *__begin1)) in __merge_advance_usual()
108 _DifferenceTp __max_length, _Compare __comp) in __merge_advance_movc() argument
127 if (__comp(__element2, __element1)) in __merge_advance_movc()
174 _Compare __comp) in __merge_advance() argument
179 __target, __max_length, __comp); in __merge_advance()
201 difference_type __max_length, _Compare __comp) in __parallel_merge_advance() argument
203 __max_length, __comp); } in __parallel_merge_advance()
227 difference_type __max_length, _Compare __comp) in __parallel_merge_advance() argument
244 _Compare, _DifferenceType1>, __max_length, __comp, in __parallel_merge_advance()
|
| H A D | losertree.h | 94 _LoserTreeBase(unsigned int __k, _Compare __comp) in _LoserTreeBase() argument
95 : _M_comp(__comp) in _LoserTreeBase()
179 _LoserTree(unsigned int __k, _Compare __comp) in _LoserTree() argument
180 : _Base::_LoserTreeBase(__k, __comp) in _LoserTree()
272 _LoserTree(unsigned int __k, _Compare __comp) in _LoserTree() argument
273 : _Base::_LoserTreeBase(__k, __comp) in _LoserTree()
374 _Compare __comp = std::less<_Tp>())
375 : _M_comp(__comp) in _M_comp() argument
418 _LoserTreePointer(unsigned int __k, _Compare __comp = std::less<_Tp>())
419 : _Base::_LoserTreePointerBase(__k, __comp) in _LoserTreePointerBase() argument
[all …]
|
| /netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/include/pstl/ |
| H A D | parallel_backend_utils.h | 49 …_RandomAccessIterator2 __ye, _RandomAccessIterator3 __zs, _Compare __comp, _MoveValueX __move_valu… in operator()
68 if (__comp(*__ys, *__xs)) in operator()
140 _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp, in __set_union_construct() argument
149 if (__comp(*__first2, *__first1)) in __set_union_construct()
157 if (!__comp(*__first1, *__first2)) in __set_union_construct()
168 _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp) in __set_intersection_construct() argument
174 if (__comp(*__first1, *__first2)) in __set_intersection_construct()
178 if (!__comp(*__first2, *__first1)) in __set_intersection_construct()
194 _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp, in __set_difference_construct() argument
204 if (__comp(*__first1, *__first2)) in __set_difference_construct()
[all …]
|
| H A D | algorithm_impl.h | 2107 …t(_ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, in __pattern_sort() argument
2110 std::sort(__first, __last, __comp); in __pattern_sort()
2115 …utionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, in __pattern_sort() argument
2119 …ar_backend::__parallel_stable_sort(std::forward<_ExecutionPolicy>(__exec), __first, __last, __comp, in __pattern_sort()
2121 … _Compare __comp) { std::sort(__first, __last, __comp); }); in __pattern_sort()
2131 …t(_ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, in __pattern_stable_sort() argument
2134 std::stable_sort(__first, __last, __comp); in __pattern_stable_sort()
2140 _Compare __comp, _IsVector /*is_vector*/, /*is_parallel=*/std::true_type) in __pattern_stable_sort() argument
2143 …ar_backend::__parallel_stable_sort(std::forward<_ExecutionPolicy>(__exec), __first, __last, __comp, in __pattern_stable_sort()
2145 … _Compare __comp) { std::stable_sort(__first, __last, __comp); }); in __pattern_stable_sort()
[all …]
|
| /netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/pstl/ |
| H A D | algorithm_impl.h | 2076 …t(_ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, in __pattern_sort() argument
2079 std::sort(__first, __last, __comp); in __pattern_sort()
2084 …utionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, in __pattern_sort() argument
2088 …ar_backend::__parallel_stable_sort(std::forward<_ExecutionPolicy>(__exec), __first, __last, __comp, in __pattern_sort()
2090 … _Compare __comp) { std::sort(__first, __last, __comp); }, in __pattern_sort()
2101 …t(_ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, in __pattern_stable_sort() argument
2104 std::stable_sort(__first, __last, __comp); in __pattern_stable_sort()
2110 _Compare __comp, _IsVector /*is_vector*/, /*is_parallel=*/std::true_type) in __pattern_stable_sort() argument
2113 …ar_backend::__parallel_stable_sort(std::forward<_ExecutionPolicy>(__exec), __first, __last, __comp, in __pattern_stable_sort()
2115 … _Compare __comp) { std::stable_sort(__first, __last, __comp); }); in __pattern_stable_sort()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/libcxx/include/ |
| H A D | algorithm | 2559 min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2567 if (__comp(*__i, *__first))
2589 min(const _Tp& __a, const _Tp& __b, _Compare __comp)
2591 return __comp(__b, __a) ? __b : __a;
2609 min(initializer_list<_Tp> __t, _Compare __comp)
2611 return *_VSTD::min_element(__t.begin(), __t.end(), __comp);
2631 max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2639 if (__comp(*__first, *__i))
2662 max(const _Tp& __a, const _Tp& __b, _Compare __comp)
2664 return __comp(__a, __b) ? __b : __a;
[all …]
|