| /dragonfly/contrib/gcc-8.0/libstdc++-v3/include/bits/ |
| D | stl_heap.h | 75 _Compare& __comp) in _GLIBCXX_VISIBILITY()
80 if (__comp(__first + __parent, __first + __child)) in _GLIBCXX_VISIBILITY()
94 __gnu_cxx::__ops::_Iter_less_iter __comp; in _GLIBCXX_VISIBILITY() local
95 return std::__is_heap_until(__first, __n, __comp) == __n; in _GLIBCXX_VISIBILITY()
101 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n) in _GLIBCXX_VISIBILITY()
103 typedef __decltype(__comp) _Cmp; in _GLIBCXX_VISIBILITY()
104 __gnu_cxx::__ops::_Iter_comp_iter<_Cmp> __cmp(_GLIBCXX_MOVE(__comp)); in _GLIBCXX_VISIBILITY()
116 _Compare __comp) in _GLIBCXX_VISIBILITY()
118 return std::__is_heap(__first, _GLIBCXX_MOVE(__comp), in _GLIBCXX_VISIBILITY()
130 _Compare& __comp) in _GLIBCXX_VISIBILITY()
[all …]
|
| D | predefined_ops.h | 135 _Iter_comp_iter(_Compare __comp) in _Iter_comp_iter()
136 : _M_comp(_GLIBCXX_MOVE(__comp)) in _Iter_comp_iter()
149 __iter_comp_iter(_Compare __comp) in __iter_comp_iter() argument
150 { return _Iter_comp_iter<_Compare>(_GLIBCXX_MOVE(__comp)); } in __iter_comp_iter()
158 _Iter_comp_val(_Compare __comp) in _Iter_comp_val()
159 : _M_comp(_GLIBCXX_MOVE(__comp)) in _Iter_comp_val()
163 _Iter_comp_val(const _Iter_comp_iter<_Compare>& __comp) in _Iter_comp_val()
164 : _M_comp(__comp._M_comp) in _Iter_comp_val()
169 _Iter_comp_val(_Iter_comp_iter<_Compare>&& __comp) in _Iter_comp_val()
170 : _M_comp(std::move(__comp._M_comp)) in _Iter_comp_val()
[all …]
|
| D | stl_algo.h | 79 _Iterator __c, _Compare __comp) in _GLIBCXX_VISIBILITY()
81 if (__comp(__a, __b)) in _GLIBCXX_VISIBILITY()
83 if (__comp(__b, __c)) in _GLIBCXX_VISIBILITY()
85 else if (__comp(__a, __c)) in _GLIBCXX_VISIBILITY()
90 else if (__comp(__a, __c)) in _GLIBCXX_VISIBILITY()
92 else if (__comp(__b, __c)) in _GLIBCXX_VISIBILITY()
340 _BinaryPredicate __comp) in _GLIBCXX_VISIBILITY()
349 = std::__search(__first1, __last1, __first2, __last2, __comp); in _GLIBCXX_VISIBILITY()
370 _BinaryPredicate __comp) in _GLIBCXX_VISIBILITY()
385 __comp); in _GLIBCXX_VISIBILITY()
[all …]
|
| /dragonfly/contrib/gcc-4.7/libstdc++-v3/include/parallel/ |
| 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 …]
|
| 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 …]
|
| D | balanced_quicksort.h | 101 _Compare __comp, _ThreadIndex __num_threads) in __qsb_divide() argument
111 __end - 1, __comp); in __qsb_divide()
117 _GLIBCXX_PARALLEL_ASSERT((!__comp(*__pivot_pos, *__begin) in __qsb_divide()
118 && !__comp(*(__begin + __n / 2), in __qsb_divide()
120 || (!__comp(*__pivot_pos, *__begin) in __qsb_divide()
121 && !__comp(*(__end - 1), *__pivot_pos)) in __qsb_divide()
122 || (!__comp(*__pivot_pos, *(__begin + __n / 2)) in __qsb_divide()
123 && !__comp(*__begin, *__pivot_pos)) in __qsb_divide()
124 || (!__comp(*__pivot_pos, *(__begin + __n / 2)) in __qsb_divide()
125 && !__comp(*(__end - 1), *__pivot_pos)) in __qsb_divide()
[all …]
|
| 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()
|
| 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 …]
|
| 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()
|
| 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 …]
|
| D | set_operations.h | 74 __symmetric_difference_func(_Compare __comp) : _M_comp(__comp) {} in __symmetric_difference_func()
151 __difference_func(_Compare __comp) : _M_comp(__comp) {} in __difference_func()
219 __intersection_func(_Compare __comp) : _M_comp(__comp) {} in __intersection_func()
282 __union_func(_Compare __comp) : _M_comp(__comp) {} in __union_func()
477 _OutputIterator __result, _Compare __comp) in __parallel_set_union() argument
482 _Compare>(__comp)); in __parallel_set_union()
491 _OutputIterator __result, _Compare __comp) in __parallel_set_intersection() argument
496 _OutputIterator, _Compare>(__comp)); in __parallel_set_intersection()
505 _OutputIterator __result, _Compare __comp) in __parallel_set_difference() argument
510 _OutputIterator, _Compare>(__comp)); in __parallel_set_difference()
[all …]
|
| D | multiseq_selection.h | 61 _Lexicographic(_Compare& __comp) : _M_comp(__comp) { } in _Lexicographic() argument
86 _LexicographicReverse(_Compare& __comp) : _M_comp(__comp) { } in _LexicographicReverse() argument
125 _Compare __comp = std::less<
140 _Lexicographic<_ValueType, _SeqNumber, _Compare> __lcomp(__comp);
141 _LexicographicReverse<_ValueType, _SeqNumber, _Compare> __lrcomp(__comp);
244 if (!__comp(__S(__i)[__a[__i] - 1], *__lmax))
344 if (!__comp(__S(__i)[__a[__i] - 1], *__maxleft))
355 if (__comp(__S(__i)[__b[__i]], *__minright))
390 _RankType& __offset, _Compare __comp = std::less<_Tp>())
401 _Lexicographic<_Tp, _SeqNumber, _Compare> __lcomp(__comp);
[all …]
|
| D | algo.h | 154 __comp(__gnu_parallel::_EqualTo<_ValueType, const _Tp&>(), __val); in _GLIBCXX_VISIBILITY()
156 __begin, __end, __begin, __comp, in _GLIBCXX_VISIBILITY()
226 _BinaryPredicate __comp, __gnu_parallel::sequential_tag) in _GLIBCXX_VISIBILITY()
228 __begin1, __end1, __begin2, __end2, __comp); } in _GLIBCXX_VISIBILITY()
247 _BinaryPredicate __comp, random_access_iterator_tag, in _GLIBCXX_VISIBILITY()
251 __find_template(__begin1, __end1, __begin1, __comp, in _GLIBCXX_VISIBILITY()
263 _BinaryPredicate __comp, _IteratorTag1, _IteratorTag2) in _GLIBCXX_VISIBILITY()
264 { return find_first_of(__begin1, __end1, __begin2, __end2, __comp, in _GLIBCXX_VISIBILITY()
273 _BinaryPredicate __comp) in _GLIBCXX_VISIBILITY()
280 return __find_first_of_switch(__begin1, __end1, __begin2, __end2, __comp, in _GLIBCXX_VISIBILITY()
[all …]
|
| /dragonfly/contrib/gcc-8.0/libstdc++-v3/include/parallel/ |
| 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 …]
|
| 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 …]
|
| 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 …]
|
| 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()
|
| 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 …]
|
| 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()
|
| 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 …]
|
| D | set_operations.h | 74 __symmetric_difference_func(_Compare __comp) : _M_comp(__comp) {} in __symmetric_difference_func()
151 __difference_func(_Compare __comp) : _M_comp(__comp) {} in __difference_func()
219 __intersection_func(_Compare __comp) : _M_comp(__comp) {} in __intersection_func()
282 __union_func(_Compare __comp) : _M_comp(__comp) {} in __union_func()
477 _OutputIterator __result, _Compare __comp) in __parallel_set_union() argument
482 _Compare>(__comp)); in __parallel_set_union()
491 _OutputIterator __result, _Compare __comp) in __parallel_set_intersection() argument
496 _OutputIterator, _Compare>(__comp)); in __parallel_set_intersection()
505 _OutputIterator __result, _Compare __comp) in __parallel_set_difference() argument
510 _OutputIterator, _Compare>(__comp)); in __parallel_set_difference()
[all …]
|
| D | multiseq_selection.h | 61 _Lexicographic(_Compare& __comp) : _M_comp(__comp) { } in _Lexicographic() argument
86 _LexicographicReverse(_Compare& __comp) : _M_comp(__comp) { } in _LexicographicReverse() argument
125 _Compare __comp = std::less<
140 _Lexicographic<_ValueType, _SeqNumber, _Compare> __lcomp(__comp);
141 _LexicographicReverse<_ValueType, _SeqNumber, _Compare> __lrcomp(__comp);
244 if (!__comp(__S(__i)[__a[__i] - 1], *__lmax))
344 if (!__comp(__S(__i)[__a[__i] - 1], *__maxleft))
355 if (__comp(__S(__i)[__b[__i]], *__minright))
390 _RankType& __offset, _Compare __comp = std::less<_Tp>())
401 _Lexicographic<_Tp, _SeqNumber, _Compare> __lcomp(__comp);
[all …]
|
| D | algo.h | 151 __comp(__gnu_parallel::_EqualTo<_ValueType, const _Tp&>(), __val); in _GLIBCXX_VISIBILITY()
153 __begin, __end, __begin, __comp, in _GLIBCXX_VISIBILITY()
222 _BinaryPredicate __comp, __gnu_parallel::sequential_tag) in _GLIBCXX_VISIBILITY()
224 __begin1, __end1, __begin2, __end2, __comp); } in _GLIBCXX_VISIBILITY()
243 _BinaryPredicate __comp, random_access_iterator_tag, in _GLIBCXX_VISIBILITY()
247 __find_template(__begin1, __end1, __begin1, __comp, in _GLIBCXX_VISIBILITY()
259 _BinaryPredicate __comp, _IteratorTag1, _IteratorTag2) in _GLIBCXX_VISIBILITY()
260 { return find_first_of(__begin1, __end1, __begin2, __end2, __comp, in _GLIBCXX_VISIBILITY()
269 _BinaryPredicate __comp) in _GLIBCXX_VISIBILITY()
271 return __find_first_of_switch(__begin1, __end1, __begin2, __end2, __comp, in _GLIBCXX_VISIBILITY()
[all …]
|
| /dragonfly/contrib/gcc-4.7/libstdc++-v3/include/bits/ |
| D | stl_heap.h | 90 _Compare __comp) in _GLIBCXX_VISIBILITY()
95 if (__comp(__first[__parent], __first[__child])) in _GLIBCXX_VISIBILITY()
113 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n) in _GLIBCXX_VISIBILITY()
114 { return std::__is_heap_until(__first, __n, __comp) == __n; } in _GLIBCXX_VISIBILITY()
124 _Compare __comp) in _GLIBCXX_VISIBILITY()
125 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); } in _GLIBCXX_VISIBILITY()
180 _Distance __topIndex, _Tp __value, _Compare __comp) in _GLIBCXX_VISIBILITY()
184 && __comp(*(__first + __parent), __value)) in _GLIBCXX_VISIBILITY()
208 _Compare __comp) in _GLIBCXX_VISIBILITY()
219 __glibcxx_requires_heap_pred(__first, __last - 1, __comp); in _GLIBCXX_VISIBILITY()
[all …]
|
| D | stl_algo.h | 109 _Compare __comp) in _GLIBCXX_VISIBILITY()
116 if (__comp(*__a, *__b)) in _GLIBCXX_VISIBILITY()
118 if (__comp(*__b, *__c)) in _GLIBCXX_VISIBILITY()
120 else if (__comp(*__a, *__c)) in _GLIBCXX_VISIBILITY()
125 else if (__comp(*__a, *__c)) in _GLIBCXX_VISIBILITY()
127 else if (__comp(*__b, *__c)) in _GLIBCXX_VISIBILITY()
557 _BinaryPredicate __comp) in _GLIBCXX_VISIBILITY()
568 __last2, __comp); in _GLIBCXX_VISIBILITY()
624 _BinaryPredicate __comp) in _GLIBCXX_VISIBILITY()
639 __comp); in _GLIBCXX_VISIBILITY()
[all …]
|