Home
last modified time | relevance | path

Searched refs:_AlgPolicy (Results 1 – 25 of 35) sorted by relevance

12

/llvm-project-15.0.7/libcxx/include/__algorithm/
H A Drotate.h28 template <class _AlgPolicy, class _ForwardIterator>
33 using _Ops = _IterOps<_AlgPolicy>; in __rotate_left()
36 _ForwardIterator __lm1 = std::__move<_AlgPolicy>( in __rotate_left()
42 template <class _AlgPolicy, class _BidirectionalIterator>
47 using _Ops = _IterOps<_AlgPolicy>; in __rotate_right()
56 template <class _AlgPolicy, class _ForwardIterator>
63 _IterOps<_AlgPolicy>::iter_swap(__first, __i); in __rotate_forward()
76 _IterOps<_AlgPolicy>::iter_swap(__first, __i); in __rotate_forward()
111 using _Ops = _IterOps<_AlgPolicy>; in __rotate_gcd()
141 template <class _AlgPolicy, class _ForwardIterator>
[all …]
H A Dsort.h42 using _AlgPolicy = _PolicyT; member
62 using _AlgPolicy = _ClassicAlgPolicy;
73 using _AlgPolicy = typename _Wrapped::_AlgPolicy;
85 using _Ops = _IterOps<_AlgPolicy>;
123 using _Ops = _IterOps<_AlgPolicy>;
147 using _AlgPolicy = typename _Unwrap::_AlgPolicy;
148 using _Ops = _IterOps<_AlgPolicy>;
296 using _Ops = _IterOps<_AlgPolicy>;
313 using _Ops = _IterOps<_AlgPolicy>;
338 using _AlgPolicy = typename _Unwrap::_AlgPolicy;
[all …]
H A Dstable_sort.h29 template <class _AlgPolicy, class _Compare, class _InputIterator1, class _InputIterator2>
35 using _Ops = _IterOps<_AlgPolicy>; in __merge_move_construct()
77 using _Ops = _IterOps<_AlgPolicy>; in __merge_move_assign()
102 template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
108 template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
114 using _Ops = _IterOps<_AlgPolicy>; in __stable_sort_move()
162 template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
177 _IterOps<_AlgPolicy>::iter_swap(__first, __last); in __stable_sort()
182 std::__insertion_sort<_AlgPolicy, _Compare>(__first, __last, __comp); in __stable_sort()
195 std::__merge_move_assign<_AlgPolicy, _Compare>( in __stable_sort()
[all …]
H A Dpartial_sort.h31 template <class _AlgPolicy, class _Compare, class _RandomAccessIterator, class _Sentinel>
36 return _IterOps<_AlgPolicy>::next(__middle, __last); in __partial_sort_impl()
39 std::__make_heap<_AlgPolicy>(__first, __middle, __comp); in __partial_sort_impl()
47 _IterOps<_AlgPolicy>::iter_swap(__i, __first); in __partial_sort_impl()
48 std::__sift_down<_AlgPolicy>(__first, __comp, __len, __first); in __partial_sort_impl()
52 std::__sort_heap<_AlgPolicy>(std::move(__first), std::move(__middle), __comp); in __partial_sort_impl()
57 template <class _AlgPolicy, class _Compare, class _RandomAccessIterator, class _Sentinel>
62 return _IterOps<_AlgPolicy>::next(__middle, __last); in __partial_sort()
64 std::__debug_randomize_range<_AlgPolicy>(__first, __last); in __partial_sort()
67 …auto __last_iter = std::__partial_sort_impl<_AlgPolicy>(__first, __middle, __last, static_cast<_Co… in __partial_sort()
[all …]
H A Dinplace_merge.h67 std::__move<_AlgPolicy>(__first1, __last1, __result); in __half_inplace_merge()
73 *__result = _IterOps<_AlgPolicy>::__iter_move(__first2); in __half_inplace_merge()
78 *__result = _IterOps<_AlgPolicy>::__iter_move(__first1); in __half_inplace_merge()
85 template <class _AlgPolicy, class _Compare, class _BidirectionalIterator>
112 std::__half_inplace_merge<_AlgPolicy>(_Rv(__p), _Rv(__buff), in __buffered_inplace_merge()
118 template <class _AlgPolicy, class _Compare, class _BidirectionalIterator>
128 using _Ops = _IterOps<_AlgPolicy>; in __inplace_merge()
137 return std::__buffered_inplace_merge<_AlgPolicy> in __inplace_merge()
192 std::__inplace_merge<_AlgPolicy>( in __inplace_merge()
201 std::__inplace_merge<_AlgPolicy>( in __inplace_merge()
[all …]
H A Dstable_partition.h32 using _Ops = _IterOps<_AlgPolicy>; in __stable_partition_impl()
106 __second_false = std::__stable_partition_impl<_AlgPolicy, _Predicate&>( in __stable_partition_impl()
116 template <class _AlgPolicy, class _Predicate, class _ForwardIterator>
135 difference_type __len = _IterOps<_AlgPolicy>::distance(__first, __last); in __stable_partition_impl()
146 return std::__stable_partition_impl<_AlgPolicy, _Predicate&>( in __stable_partition_impl()
155 using _Ops = _IterOps<_AlgPolicy>; in __stable_partition_impl()
233 __first_false = std::__stable_partition_impl<_AlgPolicy, _Predicate&>( in __stable_partition_impl()
251 __second_false = std::__stable_partition_impl<_AlgPolicy, _Predicate&>( in __stable_partition_impl()
261 template <class _AlgPolicy, class _Predicate, class _BidirectionalIterator>
300 return std::__stable_partition_impl<_AlgPolicy, _Predicate&>( in __stable_partition_impl()
[all …]
H A Dmove_backward.h25 template <class _AlgPolicy, class _InputIterator, class _OutputIterator>
31 *--__result = _IterOps<_AlgPolicy>::__iter_move(--__last); in __move_backward_constexpr()
35 template <class _AlgPolicy, class _InputIterator, class _OutputIterator>
40 return _VSTD::__move_backward_constexpr<_AlgPolicy>(__first, __last, __result); in __move_backward_impl()
43 template <class _AlgPolicy, class _Tp, class _Up>
62 template <class _AlgPolicy, class _BidirectionalIterator1, class _BidirectionalIterator2>
69 return _VSTD::__move_backward_constexpr<_AlgPolicy>(__first, __last, __result); in __move_backward()
72 _VSTD::__move_backward_impl<_AlgPolicy>(_VSTD::__unwrap_iter(__first), in __move_backward()
H A Dreverse.h24 template <class _AlgPolicy, class _BidirectionalIterator>
33 _IterOps<_AlgPolicy>::iter_swap(__first, __last); in __reverse_impl()
38 template <class _AlgPolicy, class _RandomAccessIterator>
45 _IterOps<_AlgPolicy>::iter_swap(__first, __last); in __reverse_impl()
48 template <class _AlgPolicy, class _BidirectionalIterator, class _Sentinel>
51 …using _IterCategory = typename _IterOps<_AlgPolicy>::template __iterator_category<_BidirectionalIt… in __reverse()
52 std::__reverse_impl<_AlgPolicy>(std::move(__first), std::move(__last), _IterCategory()); in __reverse()
H A Dnth_element.h44 template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
48 using _Ops = _IterOps<_AlgPolicy>; in __nth_element()
70 std::__sort3<_AlgPolicy, _Compare>(__first, ++__m, --__last, __comp); in __nth_element()
76 std::__selection_sort<_AlgPolicy, _Compare>(__first, __last, __comp); in __nth_element()
82 unsigned __n_swaps = std::__sort3<_AlgPolicy, _Compare>(__first, __m, --__lm1, __comp); in __nth_element()
225 template <class _AlgPolicy, class _RandomAccessIterator, class _Compare>
232 std::__debug_randomize_range<_AlgPolicy>(__first, __last); in __nth_element_impl()
235 std::__nth_element<_AlgPolicy, _Comp_ref>(__first, __nth, __last, __comp); in __nth_element_impl()
237 std::__debug_randomize_range<_AlgPolicy>(__first, __nth); in __nth_element_impl()
239 std::__debug_randomize_range<_AlgPolicy>(++__nth, __last); in __nth_element_impl()
H A Dmove.h30 template <class _AlgPolicy, class _InIter, class _Sent, class _OutIter>
34 *__result = _IterOps<_AlgPolicy>::__iter_move(__first); in __move_impl()
41 template <class _AlgPolicy,
54 return std::__move_impl<_AlgPolicy, _InType*, _InType*, _OutType*>(__first, __last, __result); in __move_impl()
70 template <class _AlgPolicy,
87 std::__move_impl<_AlgPolicy>(__last_base, __first_base, __result_first);
91 template <class _AlgPolicy, class _InIter, class _Sent, class _OutIter>
97 auto __ret = std::__move_impl<_AlgPolicy>(
102 template <class _AlgPolicy, class _InIter, class _Sent, class _OutIter>
108 return std::__move_impl<_AlgPolicy>(std::move(__first), std::move(__last), std::move(__result));
H A Dis_permutation.h55 template <class _AlgPolicy,
111 _D1 __l1 = _IterOps<_AlgPolicy>::distance(__first1, __last1);
114 auto __last2 = _IterOps<_AlgPolicy>::next(__first2, __l1);
116 return std::__is_permutation_impl<_AlgPolicy>(
122 template <class _AlgPolicy,
143 _D1 __l1 = _IterOps<_AlgPolicy>::distance(__first1, __last1);
150 return std::__is_permutation_impl<_AlgPolicy>(
156 template <class _AlgPolicy,
165 return std::__is_permutation<_AlgPolicy>(
172 template <class _AlgPolicy,
[all …]
H A Dpartition.h25 template <class _Predicate, class _AlgPolicy, class _ForwardIterator, class _Sentinel>
43 _IterOps<_AlgPolicy>::iter_swap(__first, __p); in __partition_impl()
50 template <class _Predicate, class _AlgPolicy, class _BidirectionalIterator, class _Sentinel>
55 _BidirectionalIterator __original_last = _IterOps<_AlgPolicy>::next(__first, __sentinel); in __partition_impl()
73 _IterOps<_AlgPolicy>::iter_swap(__first, __last); in __partition_impl()
78 template <class _AlgPolicy, class _ForwardIterator, class _Sentinel, class _Predicate, class _IterC…
82 return std::__partition_impl<__uncvref_t<_Predicate>&, _AlgPolicy>( in __partition()
H A Dsample.h31 template <class _AlgPolicy,
53 template <class _AlgPolicy,
62 _Distance __unsampled_sz = _IterOps<_AlgPolicy>::distance(__first, __last); in __sample()
73 template <class _AlgPolicy,
82 …using _PopIterCategory = typename _IterOps<_AlgPolicy>::template __iterator_category<_PopulationIt… in __sample()
83 …using _Difference = typename _IterOps<_AlgPolicy>::template __difference_type<_PopulationIterator>; in __sample()
86 return std::__sample<_AlgPolicy>( in __sample()
H A Dequal_range.h36 template <class _AlgPolicy, class _Compare, class _Iter, class _Sent, class _Tp, class _Proj>
39 auto __len = _IterOps<_AlgPolicy>::distance(__first, __last); in __equal_range()
40 _Iter __end = _IterOps<_AlgPolicy>::next(__first, __last); in __equal_range()
43 _Iter __mid = _IterOps<_AlgPolicy>::next(__first, __half_len); in __equal_range()
53 std::__lower_bound_impl<_AlgPolicy>(__first, __mid, __value, __comp, __proj), in __equal_range()
54 std::__upper_bound<_AlgPolicy>(++__mp1, __end, __value, __comp, __proj)); in __equal_range()
H A Dcopy_backward.h31 template <class _AlgPolicy, class _InputIterator, class _OutputIterator,
32 __enable_if_t<is_same<_AlgPolicy, _ClassicAlgPolicy>::value, int> = 0>
43 template <class _AlgPolicy, class _Iter1, class _Sent1, class _Iter2,
44 __enable_if_t<is_same<_AlgPolicy, _RangeAlgPolicy>::value, int> = 0>
46 auto __last_iter = _IterOps<_AlgPolicy>::next(__first, std::move(__last)); in __copy_backward()
H A Dprev_permutation.h27 template <class _AlgPolicy, class _Compare, class _BidirectionalIterator, class _Sentinel>
34 _BidirectionalIterator __last_iter = _IterOps<_AlgPolicy>::next(__first, __last); in __prev_permutation()
47 _IterOps<_AlgPolicy>::iter_swap(__i, __j); in __prev_permutation()
48 std::__reverse<_AlgPolicy>(__ip1, __last_iter); in __prev_permutation()
53 std::__reverse<_AlgPolicy>(__first, __last_iter); in __prev_permutation()
H A Dnext_permutation.h27 template <class _AlgPolicy, class _Compare, class _BidirectionalIterator, class _Sentinel>
34 _BidirectionalIterator __last_iter = _IterOps<_AlgPolicy>::next(__first, __last); in __next_permutation()
47 _IterOps<_AlgPolicy>::iter_swap(__i, __j); in __next_permutation()
48 std::__reverse<_AlgPolicy>(__ip1, __last_iter); in __next_permutation()
53 std::__reverse<_AlgPolicy>(__first, __last_iter); in __next_permutation()
H A Dpop_heap.h29 template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
40 value_type __top = _IterOps<_AlgPolicy>::__iter_move(__first); // create a hole at __first in __pop_heap()
41 _RandomAccessIterator __hole = std::__floyd_sift_down<_AlgPolicy>(__first, __comp_ref, __len); in __pop_heap()
47 *__hole = _IterOps<_AlgPolicy>::__iter_move(__last); in __pop_heap()
50 std::__sift_up<_AlgPolicy>(__first, __hole, __comp_ref, __hole - __first); in __pop_heap()
H A Dpush_heap.h26 template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
37 value_type __t(_IterOps<_AlgPolicy>::__iter_move(__last)); in __sift_up()
39 *__last = _IterOps<_AlgPolicy>::__iter_move(__ptr); in __sift_up()
52 template <class _AlgPolicy, class _RandomAccessIterator, class _Compare>
57 std::__sift_up<_AlgPolicy, _CompRef>(std::move(__first), std::move(__last), __comp, __len); in __push_heap()
H A Dpartial_sort_copy.h33 template <class _AlgPolicy, class _Compare,
48 std::__make_heap<_AlgPolicy>(__result_first, __r, __projected_comp); in __partial_sort_copy()
53 … std::__sift_down<_AlgPolicy>(__result_first, __projected_comp, __len, __result_first); in __partial_sort_copy()
55 std::__sort_heap<_AlgPolicy>(__result_first, __r, __projected_comp); in __partial_sort_copy()
59 _IterOps<_AlgPolicy>::next(std::move(__first), std::move(__last)), std::move(__r)); in __partial_sort_copy()
H A Dswap_ranges.h24 template <class _AlgPolicy, class _ForwardIterator1, class _Sentinel1, class _ForwardIterator2, cla…
29 _IterOps<_AlgPolicy>::iter_swap(__first1, __first2); in __swap_ranges()
38 template <class _AlgPolicy, class _ForwardIterator1, class _Sentinel1, class _ForwardIterator2>
43 _IterOps<_AlgPolicy>::iter_swap(__first1, __first2); in __swap_ranges()
H A Dsift_down.h24 template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
30 using _Ops = _IterOps<_AlgPolicy>; in __sift_down()
80 template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
103 *__hole = _IterOps<_AlgPolicy>::__iter_move(__child_i); in __floyd_sift_down()
H A Dsearch_n.h31 template <class _AlgPolicy, class _Pred, class _Iter, class _Sent, class _SizeT, class _Type, class…
44 _IterOps<_AlgPolicy>::__advance_to(__first, __last); in __search_n_forward_impl()
58 _IterOps<_AlgPolicy>::__advance_to(__first, __last); in __search_n_forward_impl()
73 template <class _AlgPolicy, class _Pred, class _Iter, class _Sent, class _SizeT, class _Type, class…
85 _IterOps<_AlgPolicy>::__advance_to(__first, __last); in __search_n_random_access_impl()
94 _IterOps<_AlgPolicy>::__advance_to(__first, __last); in __search_n_random_access_impl()
H A Dlower_bound.h31 template <class _AlgPolicy, class _Iter, class _Sent, class _Type, class _Proj, class _Comp>
34 auto __len = _IterOps<_AlgPolicy>::distance(__first, __last); in __lower_bound_impl()
39 _IterOps<_AlgPolicy>::advance(__m, __l2); in __lower_bound_impl()
H A Dupper_bound.h30 template <class _AlgPolicy, class _Compare, class _Iter, class _Sent, class _Tp, class _Proj>
33 auto __len = _IterOps<_AlgPolicy>::distance(__first, __last); in __upper_bound()
36 auto __mid = _IterOps<_AlgPolicy>::next(__first, __half_len); in __upper_bound()

12