Home
last modified time | relevance | path

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

12

/external/llvm-project/pstl/include/pstl/internal/
Dparallel_backend_utils.h53 …_RandomAccessIterator2 __ye, _RandomAccessIterator3 __zs, _Compare __comp, _MoveValueX __move_valu… in operator()
72 if (__comp(*__ys, *__xs)) in operator()
144 _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp, in __set_union_construct() argument
153 if (__comp(*__first2, *__first1)) in __set_union_construct()
161 if (!__comp(*__first1, *__first2)) in __set_union_construct()
172 _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp) in __set_intersection_construct() argument
178 if (__comp(*__first1, *__first2)) in __set_intersection_construct()
182 if (!__comp(*__first2, *__first1)) in __set_intersection_construct()
198 _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp, in __set_difference_construct() argument
208 if (__comp(*__first1, *__first2)) in __set_difference_construct()
[all …]
Dalgorithm_impl.h2109 …t(_ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, in __pattern_sort() argument
2112 std::sort(__first, __last, __comp); in __pattern_sort()
2117 …utionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, in __pattern_sort() argument
2121 …ar_backend::__parallel_stable_sort(std::forward<_ExecutionPolicy>(__exec), __first, __last, __comp, in __pattern_sort()
2123 … _Compare __comp) { std::sort(__first, __last, __comp); }); in __pattern_sort()
2133 …t(_ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, in __pattern_stable_sort() argument
2136 std::stable_sort(__first, __last, __comp); in __pattern_stable_sort()
2142 _Compare __comp, _IsVector /*is_vector*/, /*is_parallel=*/std::true_type) in __pattern_stable_sort() argument
2145 …ar_backend::__parallel_stable_sort(std::forward<_ExecutionPolicy>(__exec), __first, __last, __comp, in __pattern_stable_sort()
2147 … _Compare __comp) { std::stable_sort(__first, __last, __comp); }); in __pattern_stable_sort()
[all …]
Dparallel_impl.h33 …ecutionPolicy&& __exec, _Index __first, _Index __last, _Brick __f, _Compare __comp, bool __b_first) in __parallel_find() argument
41 [__comp, __f, __first, &__extremum](_Index __i, _Index __j) { in __parallel_find()
44 if (__comp(__i - __first, __extremum)) in __parallel_find()
51 … for (_DifferenceType __old = __extremum; __comp(__k, __old); in __parallel_find()
Dglue_algorithm_impl.h636 …utionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in sort() argument
640 std::forward<_ExecutionPolicy>(__exec), __first, __last, __comp, in sort()
658 …utionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in stable_sort() argument
661 std::forward<_ExecutionPolicy>(__exec), __first, __last, __comp, in stable_sort()
778 _RandomAccessIterator __last, _Compare __comp) in partial_sort() argument
781 std::forward<_ExecutionPolicy>(__exec), __first, __middle, __last, __comp, in partial_sort()
800 _RandomAccessIterator __d_first, _RandomAccessIterator __d_last, _Compare __comp) in partial_sort_copy() argument
803 std::forward<_ExecutionPolicy>(__exec), __first, __last, __d_first, __d_last, __comp, in partial_sort_copy()
822 …ntil(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Compare __comp) in is_sorted_until() argument
825 …d<_ExecutionPolicy>(__exec), __first, __last, __pstl::__internal::__reorder_pred<_Compare>(__comp), in is_sorted_until()
[all …]
Dglue_algorithm_defs.h296 …tionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp);
306 …tionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp);
364 _RandomAccessIterator __last, _Compare __comp);
376 _RandomAccessIterator __d_first, _RandomAccessIterator __d_last, _Compare __comp);
386 …til(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Compare __comp);
394 …ted(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Compare __comp);
405 _RandomAccessIterator __last, _Compare __comp);
417 _ForwardIterator2 __last2, _ForwardIterator __d_first, _Compare __comp);
427 _BidirectionalIterator __last, _Compare __comp);
439 _ForwardIterator2 __last2, _Compare __comp);
[all …]
Dparallel_backend_serial.h107 …t(_ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
110 __leaf_sort(__first, __last, __comp);
118 _Compare __comp, _LeafMerge __leaf_merge) in __parallel_merge() argument
120 __leaf_merge(__first1, __last1, __first2, __last2, __outit, __comp); in __parallel_merge()
Dutils.h160 __cmp_iterators_by_values(_ForwardIterator __a, _ForwardIterator __b, _Compare __comp) in __cmp_iterators_by_values() argument
164 return __comp(*__b, *__a) ? __b : __a; in __cmp_iterators_by_values()
168 return __comp(*__a, *__b) ? __a : __b; in __cmp_iterators_by_values()
Dunseq_backend_simd.h106 __simd_first(_Index __first, _DifferenceType __begin, _DifferenceType __end, _Compare __comp) noexc… in __simd_first() argument
113 if (__comp(__first, __i)) in __simd_first()
131 const _DifferenceType __t = __comp(__first, __i); in __simd_first()
154 if (__comp(__first, __begin)) in __simd_first()
616 __simd_min_element(_ForwardIterator __first, _Size __n, _Compare __comp) noexcept in __simd_min_element() argument
653 _ComplexType __init{*__first, &__comp}; in __simd_min_element()
662 if (__comp(__current, __min_val)) in __simd_min_element()
675 __simd_minmax_element(_ForwardIterator __first, _Size __n, _Compare __comp) noexcept in __simd_minmax_element() argument
732 _ComplexType __init{*__first, *__first, &__comp}; in __simd_minmax_element()
742 if (__comp(*__current, __min_val)) in __simd_minmax_element()
[all …]
Dparallel_backend_tbb.h827 …nc(_SizeType __xs, _SizeType __xe, _SizeType __ys, _SizeType __ye, _SizeType __zs, _Compare __comp, in __merge_func() argument
831 _M_comp(__comp), _M_leaf_merge(__leaf_merge), _M_nsort(__nsort), _root(__root), in __merge_func()
1108 bool __root, _Compare __comp, _LeafSort __leaf_sort, _SizeType __nsort, in __stable_sort_func() argument
1110 … : _M_xs(__xs), _M_xe(__xe), _M_x_beg(__x_beg), _M_zs(__zs), _M_z_beg(__z_beg), _M_comp(__comp), in __stable_sort_func()
1160 …e_sort(_ExecutionPolicy&&, _RandomAccessIterator __xs, _RandomAccessIterator __xe, _Compare __comp,
1176 __xs, __xe, __buf.get(), true, __comp, __leaf_sort, __nsort, __xs, __buf.get()};
1181 __leaf_sort(__xs, __xe, __comp);
1200 _RandomAccessIterator2 __ye, _RandomAccessIterator3 __zs, _Compare __comp, in __merge_func_static() argument
1202 …: _M_xs(__xs), _M_xe(__xe), _M_ys(__ys), _M_ye(__ye), _M_zs(__zs), _M_comp(__comp), _M_leaf_merge(… in __merge_func_static()
1255 …domAccessIterator2 __ys, _RandomAccessIterator2 __ye, _RandomAccessIterator3 __zs, _Compare __comp, in __parallel_merge() argument
[all …]
/external/libcxx/include/
Dalgorithm2426 min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2434 if (__comp(*__i, *__first))
2454 min(const _Tp& __a, const _Tp& __b, _Compare __comp)
2456 return __comp(__b, __a) ? __b : __a;
2472 min(initializer_list<_Tp> __t, _Compare __comp)
2474 return *_VSTD::min_element(__t.begin(), __t.end(), __comp);
2492 max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2500 if (__comp(*__first, *__i))
2521 max(const _Tp& __a, const _Tp& __b, _Compare __comp)
2523 return __comp(__a, __b) ? __b : __a;
[all …]
Dqueue472 explicit priority_queue(const value_compare& __comp)
473 : c(), comp(__comp) {}
475 priority_queue(const value_compare& __comp, const container_type& __c);
478 explicit priority_queue(const value_compare& __comp, container_type&& __c);
483 const value_compare& __comp = value_compare());
487 const value_compare& __comp, const container_type& __c);
492 const value_compare& __comp, container_type&& __c);
501 priority_queue(const value_compare& __comp, const _Alloc& __a,
506 priority_queue(const value_compare& __comp, const container_type& __c,
518 priority_queue(const value_compare& __comp, container_type&& __c,
[all …]
Dset494 explicit set(const value_compare& __comp)
498 : __tree_(__comp) {}
501 explicit set(const value_compare& __comp, const allocator_type& __a)
502 : __tree_(__comp, __a) {}
506 const value_compare& __comp = value_compare())
507 : __tree_(__comp)
514 set(_InputIterator __f, _InputIterator __l, const value_compare& __comp,
516 : __tree_(__comp, __a)
564 set(initializer_list<value_type> __il, const value_compare& __comp = value_compare())
565 : __tree_(__comp)
[all …]
Dforward_list835 void merge(forward_list&& __x, _Compare __comp)
836 {merge(__x, _VSTD::move(__comp));}
840 template <class _Compare> void merge(forward_list& __x, _Compare __comp);
843 template <class _Compare> _LIBCPP_INLINE_VISIBILITY void sort(_Compare __comp);
857 __merge(__node_pointer __f1, __node_pointer __f2, _Compare& __comp);
862 __sort(__node_pointer __f, difference_type __sz, _Compare& __comp);
1570 forward_list<_Tp, _Alloc>::merge(forward_list& __x, _Compare __comp)
1576 __comp);
1585 _Compare& __comp)
1592 if (__comp(__f2->__value_, __f1->__value_))
[all …]
Dmap970 explicit map(const key_compare& __comp)
974 : __tree_(__vc(__comp)) {}
977 explicit map(const key_compare& __comp, const allocator_type& __a)
978 : __tree_(__vc(__comp), typename __base::allocator_type(__a)) {}
983 const key_compare& __comp = key_compare())
984 : __tree_(__vc(__comp))
992 const key_compare& __comp, const allocator_type& __a)
993 : __tree_(__vc(__comp), typename __base::allocator_type(__a))
1048 map(initializer_list<value_type> __il, const key_compare& __comp = key_compare())
1049 : __tree_(__vc(__comp))
[all …]
Dlist1088 void merge(list&& __c, _Comp __comp) {merge(__c, __comp);}
1091 void merge(list& __c, _Comp __comp);
1097 void sort(_Comp __comp);
1131 static iterator __sort(iterator __f1, iterator __e2, size_type __n, _Comp& __comp);
2215 list<_Tp, _Alloc>::merge(list& __c, _Comp __comp)
2225 if (__comp(*__f2, *__f1))
2229 for (; __m2 != __e2 && __comp(*__m2, *__f1); ++__m2, ++__ds)
2278 list<_Tp, _Alloc>::sort(_Comp __comp)
2280 __sort(begin(), end(), base::__sz(), __comp);
2286 list<_Tp, _Alloc>::__sort(iterator __f1, iterator __e2, size_type __n, _Comp& __comp)
[all …]
/external/llvm-project/libcxx/include/
Dalgorithm2545 min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2553 if (__comp(*__i, *__first))
2575 min(const _Tp& __a, const _Tp& __b, _Compare __comp)
2577 return __comp(__b, __a) ? __b : __a;
2595 min(initializer_list<_Tp> __t, _Compare __comp)
2597 return *_VSTD::min_element(__t.begin(), __t.end(), __comp);
2617 max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2625 if (__comp(*__first, *__i))
2648 max(const _Tp& __a, const _Tp& __b, _Compare __comp)
2650 return __comp(__a, __b) ? __b : __a;
[all …]
Dqueue471 explicit priority_queue(const value_compare& __comp)
472 : c(), comp(__comp) {}
474 priority_queue(const value_compare& __comp, const container_type& __c);
477 explicit priority_queue(const value_compare& __comp, container_type&& __c);
482 const value_compare& __comp = value_compare());
486 const value_compare& __comp, const container_type& __c);
491 const value_compare& __comp, container_type&& __c);
500 priority_queue(const value_compare& __comp, const _Alloc& __a,
505 priority_queue(const value_compare& __comp, const container_type& __c,
517 priority_queue(const value_compare& __comp, container_type&& __c,
[all …]
Dset496 explicit set(const value_compare& __comp)
500 : __tree_(__comp) {}
503 explicit set(const value_compare& __comp, const allocator_type& __a)
504 : __tree_(__comp, __a) {}
508 const value_compare& __comp = value_compare())
509 : __tree_(__comp)
516 set(_InputIterator __f, _InputIterator __l, const value_compare& __comp,
518 : __tree_(__comp, __a)
566 set(initializer_list<value_type> __il, const value_compare& __comp = value_compare())
567 : __tree_(__comp)
[all …]
Dforward_list841 void merge(forward_list&& __x, _Compare __comp)
842 {merge(__x, _VSTD::move(__comp));}
846 template <class _Compare> void merge(forward_list& __x, _Compare __comp);
849 template <class _Compare> _LIBCPP_INLINE_VISIBILITY void sort(_Compare __comp);
863 __merge(__node_pointer __f1, __node_pointer __f2, _Compare& __comp);
868 __sort(__node_pointer __f, difference_type __sz, _Compare& __comp);
1585 forward_list<_Tp, _Alloc>::merge(forward_list& __x, _Compare __comp)
1591 __comp);
1600 _Compare& __comp)
1607 if (__comp(__f2->__value_, __f1->__value_))
[all …]
Dmap970 explicit map(const key_compare& __comp)
974 : __tree_(__vc(__comp)) {}
977 explicit map(const key_compare& __comp, const allocator_type& __a)
978 : __tree_(__vc(__comp), typename __base::allocator_type(__a)) {}
983 const key_compare& __comp = key_compare())
984 : __tree_(__vc(__comp))
992 const key_compare& __comp, const allocator_type& __a)
993 : __tree_(__vc(__comp), typename __base::allocator_type(__a))
1048 map(initializer_list<value_type> __il, const key_compare& __comp = key_compare())
1049 : __tree_(__vc(__comp))
[all …]
Dlist1095 void merge(list&& __c, _Comp __comp) {merge(__c, __comp);}
1098 void merge(list& __c, _Comp __comp);
1104 void sort(_Comp __comp);
1138 static iterator __sort(iterator __f1, iterator __e2, size_type __n, _Comp& __comp);
2231 list<_Tp, _Alloc>::merge(list& __c, _Comp __comp)
2241 if (__comp(*__f2, *__f1))
2245 for (; __m2 != __e2 && __comp(*__m2, *__f1); ++__m2, ++__ds)
2294 list<_Tp, _Alloc>::sort(_Comp __comp)
2296 __sort(begin(), end(), base::__sz(), __comp);
2302 list<_Tp, _Alloc>::__sort(iterator __f1, iterator __e2, size_type __n, _Comp& __comp)
[all …]
/external/libevent/WIN32-Code/
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 < 0) { \
[all …]
/external/openssh/openbsd-compat/
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 < 0) { \
[all …]
/external/clang/www/
Dlibstdc++4.4-clang0x.patch222 + merge(list& __l, _StrictWeakOrdering __comp)
223 + { merge(std::move(__l), __comp); }
486 return std::__is_heap(__first, __comp, __last - __first);
/external/llvm-project/clang/www/
Dlibstdc++4.4-clang0x.patch222 + merge(list& __l, _StrictWeakOrdering __comp)
223 + { merge(std::move(__l), __comp); }
486 return std::__is_heap(__first, __comp, __last - __first);

12