Home
last modified time | relevance | path

Searched refs:_Ops (Results 1 – 14 of 14) sorted by relevance

/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dstable_partition.h44 using _Ops = _IterOps<_AlgPolicy>; in __stable_partition_impl() local
53 _Ops::iter_swap(__first, __m); in __stable_partition_impl()
65 std::__construct_at(__t, _Ops::__iter_move(__first)); in __stable_partition_impl()
71 *__first = _Ops::__iter_move(__i); in __stable_partition_impl()
74 std::__construct_at(__t, _Ops::__iter_move(__i)); in __stable_partition_impl()
83 *__i = _Ops::__iter_move(__t2); in __stable_partition_impl()
91 _Ops::advance(__m, __len2); in __stable_partition_impl()
156 using _Ops = _IterOps<_AlgPolicy>; in __stable_partition_impl() local
162 _Ops::iter_swap(__first, __last); in __stable_partition_impl()
168 _Ops::iter_swap(__first, __m); in __stable_partition_impl()
[all …]
H A Dsort.h113 using _Ops = _IterOps<_AlgPolicy>; in __sort3() local
120 _Ops::iter_swap(__y, __z); // x <= z && y < z in __sort3()
122 _Ops::iter_swap(__x, __y); // x < y && y <= z in __sort3()
127 _Ops::iter_swap(__x, __z); // x < y && y < z in __sort3()
130 _Ops::iter_swap(__x, __y); // x > y && y <= z in __sort3()
133 _Ops::iter_swap(__y, __z); // x <= y && y < z in __sort3()
166 using _Ops = _IterOps<_AlgPolicy>; in __sort4() local
169 _Ops::iter_swap(__x3, __x4); in __sort4()
171 _Ops::iter_swap(__x2, __x3); in __sort4()
173 _Ops::iter_swap(__x1, __x2); in __sort4()
[all …]
H A Dstable_sort.h49 using _Ops = _IterOps<_AlgPolicy>; in __insertion_sort_move() local
56 std::__construct_at(__last2, _Ops::__iter_move(__first1)); in __insertion_sort_move()
66 *__j2 = _Ops::__iter_move(__first1); in __insertion_sort_move()
68 std::__construct_at(__j2, _Ops::__iter_move(__first1)); in __insertion_sort_move()
84 using _Ops = _IterOps<_AlgPolicy>; in __merge_move_construct() local
92 std::__construct_at(__result, _Ops::__iter_move(__first2)); in __merge_move_construct()
98 std::__construct_at(__result, _Ops::__iter_move(__first1)); in __merge_move_construct()
103 std::__construct_at(__result, _Ops::__iter_move(__first2)); in __merge_move_construct()
107 std::__construct_at(__result, _Ops::__iter_move(__first1)); in __merge_move_construct()
122 using _Ops = _IterOps<_AlgPolicy>; in __merge_move_assign() local
[all …]
H A Drotate.h42 using _Ops = _IterOps<_AlgPolicy>; in __rotate_left() local
44 value_type __tmp = _Ops::__iter_move(__first); in __rotate_left()
45 _ForwardIterator __lm1 = std::__move<_AlgPolicy>(_Ops::next(__first), __last, __first).second; in __rotate_left()
54 using _Ops = _IterOps<_AlgPolicy>; in __rotate_right() local
56 _BidirectionalIterator __lm1 = _Ops::prev(__last); in __rotate_right()
57 value_type __tmp = _Ops::__iter_move(__lm1); in __rotate_right()
107 using _Ops = _IterOps<_AlgPolicy>; in __rotate_gcd() local
110 const difference_type __m2 = _Ops::distance(__middle, __last); in __rotate_gcd()
117 value_type __t(_Ops::__iter_move(--__p)); in __rotate_gcd()
121 *__p1 = _Ops::__iter_move(__p2); in __rotate_gcd()
[all …]
H A Dnth_element.h50 using _Ops = _IterOps<_AlgPolicy>; in __nth_element()
65 _Ops::iter_swap(__first, __last); in __nth_element()
93 _Ops::iter_swap(__i, __j); in __nth_element()
105 _Ops::iter_swap(__i, __j); in __nth_element()
132 _Ops::iter_swap(__i, __j); in __nth_element()
169 _Ops::iter_swap(__i, __j); in __nth_element()
180 _Ops::iter_swap(__i, __m); in __nth_element()
47 using _Ops = _IterOps<_AlgPolicy>; __nth_element() local
H A Dinplace_merge.h135 using _Ops = _IterOps<_AlgPolicy>; in __inplace_merge() local
167 _Ops::advance(__m2, __len21); in __inplace_merge()
169 __len11 = _Ops::distance(__first, __m1); in __inplace_merge()
173 _Ops::iter_swap(__first, __middle); in __inplace_merge()
179 _Ops::advance(__m1, __len11); in __inplace_merge()
181 __len21 = _Ops::distance(__middle, __m2); in __inplace_merge()
H A Dsift_down.h33 using _Ops = _IterOps<_AlgPolicy>; in __sift_down() local
58 value_type __top(_Ops::__iter_move(__start)); in __sift_down()
61 *__start = _Ops::__iter_move(__child_i); in __sift_down()
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/__algorithm/
H A Dstable_partition.h42 using _Ops = _IterOps<_AlgPolicy>; in __stable_partition_impl() local
51 _Ops::iter_swap(__first, __m); in __stable_partition_impl()
63 ::new ((void*)__t) value_type(_Ops::__iter_move(__first)); in __stable_partition_impl()
69 *__first = _Ops::__iter_move(__i); in __stable_partition_impl()
72 ::new ((void*)__t) value_type(_Ops::__iter_move(__i)); in __stable_partition_impl()
81 *__i = _Ops::__iter_move(__t2); in __stable_partition_impl()
89 _Ops::advance(__m, __len2); in __stable_partition_impl()
156 using _Ops = _IterOps<_AlgPolicy>; in __stable_partition_impl() local
162 _Ops::iter_swap(__first, __last); in __stable_partition_impl()
168 _Ops::iter_swap(__first, __m); in __stable_partition_impl()
[all …]
H A Dstable_sort.h43 using _Ops = _IterOps<_AlgPolicy>; in __insertion_sort_move() local
50 ::new ((void*)__last2) value_type(_Ops::__iter_move(__first1)); in __insertion_sort_move()
60 *__j2 = _Ops::__iter_move(__first1); in __insertion_sort_move()
62 ::new ((void*)__j2) value_type(_Ops::__iter_move(__first1)); in __insertion_sort_move()
78 using _Ops = _IterOps<_AlgPolicy>; in __merge_move_construct() local
86 ::new ((void*)__result) value_type(_Ops::__iter_move(__first2)); in __merge_move_construct()
92 ::new ((void*)__result) value_type(_Ops::__iter_move(__first1)); in __merge_move_construct()
97 ::new ((void*)__result) value_type(_Ops::__iter_move(__first2)); in __merge_move_construct()
101 ::new ((void*)__result) value_type(_Ops::__iter_move(__first1)); in __merge_move_construct()
116 using _Ops = _IterOps<_AlgPolicy>; in __merge_move_assign() local
[all …]
H A Dsort.h50 using _Ops = _IterOps<_AlgPolicy>; in __sort3() local
58 _Ops::iter_swap(__y, __z); // x <= z && y < z in __sort3()
62 _Ops::iter_swap(__x, __y); // x < y && y <= z in __sort3()
69 _Ops::iter_swap(__x, __z); // x < y && y < z in __sort3()
73 _Ops::iter_swap(__x, __y); // x > y && y <= z in __sort3()
77 _Ops::iter_swap(__y, __z); // x <= y && y < z in __sort3()
88 using _Ops = _IterOps<_AlgPolicy>; in __sort4() local
91 _Ops::iter_swap(__x3, __x4); in __sort4()
93 _Ops::iter_swap(__x2, __x3); in __sort4()
95 _Ops::iter_swap(__x1, __x2); in __sort4()
[all …]
H A Drotate.h34 using _Ops = _IterOps<_AlgPolicy>; in __rotate_left() local
36 value_type __tmp = _Ops::__iter_move(__first); in __rotate_left()
37 _ForwardIterator __lm1 = std::__move<_AlgPolicy>(_Ops::next(__first), __last, __first).second; in __rotate_left()
46 using _Ops = _IterOps<_AlgPolicy>; in __rotate_right() local
48 _BidirectionalIterator __lm1 = _Ops::prev(__last); in __rotate_right()
49 value_type __tmp = _Ops::__iter_move(__lm1); in __rotate_right()
99 using _Ops = _IterOps<_AlgPolicy>; in __rotate_gcd() local
102 const difference_type __m2 = _Ops::distance(__middle, __last); in __rotate_gcd()
109 value_type __t(_Ops::__iter_move(--__p)); in __rotate_gcd()
113 *__p1 = _Ops::__iter_move(__p2); in __rotate_gcd()
[all …]
H A Dnth_element.h50 using _Ops = _IterOps<_AlgPolicy>; in __nth_element() local
65 _Ops::iter_swap(__first, __last); in __nth_element()
93 _Ops::iter_swap(__i, __j); in __nth_element()
105 _Ops::iter_swap(__i, __j); in __nth_element()
132 _Ops::iter_swap(__i, __j); in __nth_element()
169 _Ops::iter_swap(__i, __j); in __nth_element()
180 _Ops::iter_swap(__i, __m); in __nth_element()
H A Dinplace_merge.h135 using _Ops = _IterOps<_AlgPolicy>; in __inplace_merge() local
167 _Ops::advance(__m2, __len21); in __inplace_merge()
169 __len11 = _Ops::distance(__first, __m1); in __inplace_merge()
173 _Ops::iter_swap(__first, __middle); in __inplace_merge()
179 _Ops::advance(__m1, __len11); in __inplace_merge()
181 __len21 = _Ops::distance(__middle, __m2); in __inplace_merge()
H A Dsift_down.h33 using _Ops = _IterOps<_AlgPolicy>; in __sift_down() local
58 value_type __top(_Ops::__iter_move(__start)); in __sift_down()
61 *__start = _Ops::__iter_move(__child_i); in __sift_down()