Home
last modified time | relevance | path

Searched refs:__j (Results 1 – 25 of 53) sorted by relevance

123

/freebsd/contrib/llvm-project/libcxx/include/__cxx03/__algorithm/
H A Dnth_element.h33 …_RandomAccessIterator& __i, _RandomAccessIterator& __j, _RandomAccessIterator __m, _Compare __comp… in __nth_element_find_guard() argument
36 if (__i == --__j) { in __nth_element_find_guard()
39 if (__comp(*__j, *__m)) { in __nth_element_find_guard()
85 _RandomAccessIterator __j = __lm1; in __nth_element() local
92 if (std::__nth_element_find_guard<_Compare>(__i, __j, __m, __comp)) { in __nth_element()
93 _Ops::iter_swap(__i, __j); in __nth_element()
99 __j = __last; in __nth_element()
100 if (!__comp(*__first, *--__j)) { // we need a guard if *__first == *(__last-1) in __nth_element()
102 if (__i == __j) { in __nth_element()
105 _Ops::iter_swap(__i, __j); in __nth_element()
[all …]
H A Dsort.h284 _BidirectionalIterator __j = __i;
285 --__j;
286 if (__comp(*__i, *__j)) {
288 _BidirectionalIterator __k = __j;
289 __j = __i;
291 *__j = _Ops::__iter_move(__k);
292 __j = __k;
293 } while (__j != __first && __comp(__t, *--__k));
294 *__j = std::move(__t);
315 _RandomAccessIterator __j = __i - difference_type(1);
[all …]
H A Dfind_first_of.h31 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) in __find_first_of_ce() local
32 if (__pred(*__first1, *__j)) in __find_first_of_ce()
H A Dis_permutation.h78 for (auto __j = __first2; __j != __last2; ++__j) {
79 if (std::__invoke(__pred, std::__invoke(__proj1, *__i), std::__invoke(__proj2, *__j)))
87 for (auto __j = _IterOps<_AlgPolicy>::next(__i); __j != __last1; ++__j) {
88 if (std::__invoke(__pred, std::__invoke(__proj1, *__i), std::__invoke(__proj1, *__j)))
H A Dnext_permutation.h43 _BidirectionalIterator __j = __last_iter; in __next_permutation() local
44 while (!__comp(*__i, *--__j)) in __next_permutation()
46 _IterOps<_AlgPolicy>::iter_swap(__i, __j); in __next_permutation()
H A Dprev_permutation.h43 _BidirectionalIterator __j = __last_iter; in __prev_permutation() local
44 while (!__comp(*--__j, *__i)) in __prev_permutation()
46 _IterOps<_AlgPolicy>::iter_swap(__i, __j); in __prev_permutation()
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dnth_element.h33 _RandomAccessIterator& __i, _RandomAccessIterator& __j, _RandomAccessIterator __m, _Compare __comp) { in __nth_element_find_guard()
34 // manually guard downward moving __j against __i in __nth_element_find_guard()
36 if (__i == --__j) { in __nth_element_find_guard()
39 if (__comp(*__j, *__m)) { in __nth_element_find_guard()
40 return true; // found guard for downward moving __j, now use unguarded partition in __nth_element_find_guard()
85 _RandomAccessIterator __j = __lm1; in __nth_element()
92 if (std::__nth_element_find_guard<_Compare>(__i, __j, __m, __comp)) { in __nth_element()
93 _Ops::iter_swap(__i, __j); in __nth_element()
99 __j = __last; in __nth_element()
100 if (!__comp(*__first, *--__j)) { // w in __nth_element()
29 __nth_element_find_guard(_RandomAccessIterator & __i,_RandomAccessIterator & __j,_RandomAccessIterator __m,_Compare __comp) __nth_element_find_guard() argument
86 _RandomAccessIterator __j = __lm1; __nth_element() local
[all...]
H A Dsort.h252 _BidirectionalIterator __j = __i; in __insertion_sort() local
253 --__j; in __insertion_sort()
254 if (__comp(*__i, *__j)) { in __insertion_sort()
256 _BidirectionalIterator __k = __j; in __insertion_sort()
257 __j = __i; in __insertion_sort()
259 *__j = _Ops::__iter_move(__k); in __insertion_sort()
260 __j = __k; in __insertion_sort()
261 } while (__j != __first && __comp(__t, *--__k)); in __insertion_sort()
262 *__j = std::move(__t); in __insertion_sort()
283 _RandomAccessIterator __j = __i - difference_type(1); in __insertion_sort_unguarded() local
[all …]
H A Dfind_first_of.h30 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) in __find_first_of_ce() local
31 if (__pred(*__first1, *__j)) in __find_first_of_ce()
H A Dis_permutation.h94 for (auto __j = __first2; __j != __last2; ++__j) {
95 if (std::__invoke(__pred, std::__invoke(__proj1, *__i), std::__invoke(__proj2, *__j)))
103 for (auto __j = _IterOps<_AlgPolicy>::next(__i); __j != __last1; ++__j) {
104 if (std::__invoke(__pred, std::__invoke(__proj1, *__i), std::__invoke(__proj1, *__j)))
H A Dranges_find_first_of.h46 for (auto __j = __first2; __j != __last2; ++__j) { in __find_first_of_impl() local
47 if (std::invoke(__pred, std::invoke(__proj1, *__first1), std::invoke(__proj2, *__j))) in __find_first_of_impl()
H A Dprev_permutation.h43 _BidirectionalIterator __j = __last_iter; in __prev_permutation()
44 while (!__comp(*--__j, *__i)) in __prev_permutation() local
46 _IterOps<_AlgPolicy>::iter_swap(__i, __j); in __prev_permutation()
H A Dnext_permutation.h43 _BidirectionalIterator __j = __last_iter; in __next_permutation() local
44 while (!__comp(*__i, *--__j)) in __next_permutation()
46 _IterOps<_AlgPolicy>::iter_swap(__i, __j); in __next_permutation()
/freebsd/contrib/llvm-project/libcxx/include/__pstl/cpu_algos/
H A Dtransform_reduce.h81 for (_Size __j = 0; __j < __block_size; ++__j) { in __simd_transform_reduce() local
82 __lane[__j] = __binary_op(std::move(__lane[__j]), __f(__i + __j)); in __simd_transform_reduce()
87 for (_Size __j = 0; __j < __n - __last_iteration; ++__j) { in __simd_transform_reduce() local
88 __lane[__j] = __binary_op(std::move(__lane[__j]), __f(__last_iteration + __j)); in __simd_transform_reduce()
91 for (_Size __j = 0; __j < __block_size; ++__j) { in __simd_transform_reduce() local
92 __init = __binary_op(std::move(__init), std::move(__lane[__j])); in __simd_transform_reduce()
96 for (_Size __j = 0; __j < __block_size; ++__j) { in __simd_transform_reduce() local
97 __lane[__j].~_Tp(); in __simd_transform_reduce()
/freebsd/contrib/llvm-project/libcxx/include/__functional/
H A Dboyer_moore_searcher.h155 difference_type __j = __pattern_length_; in __search() local
156 while (__pred_(__first_[__j - 1], __current[__j - 1])) { in __search()
157 --__j; in __search()
158 if (__j == 0) in __search()
162 difference_type __k = __skip_table[__current[__j - 1]]; in __search()
163 difference_type __m = __j - __k - 1; in __search()
164 if (__k < __j && __m > __suffix_[__j]) in __search()
167 __current += __suffix_[__j]; in __search()
207 const size_t __j = __count - __scratch[__i]; in __build_suffix_table() local
210 if (__suffix_[__j] > __k) in __build_suffix_table()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__random/
H A Dsubtract_with_carry_engine.h196 size_t __j = std::min(_Rp - __x.__i_, _Rp - __y.__i_); variable
197 if (!std::equal(__x.__x_ + __x.__i_, __x.__x_ + __x.__i_ + __j, __y.__x_ + __y.__i_))
200 return std::equal(__x.__x_ + __j, __x.__x_ + _Rp, __y.__x_);
201 return std::equal(__x.__x_, __x.__x_ + (_Rp - __j), __y.__x_ + __j);
204 size_t __j = _Rp - __y.__i_; variable
205 if (!std::equal(__x.__x_ + __x.__i_, __x.__x_ + (__x.__i_ + __j), __y.__x_ + __y.__i_))
207 if (!std::equal(__x.__x_ + (__x.__i_ + __j), __x.__x_ + _Rp, __y.__x_))
209 return std::equal(__x.__x_, __x.__x_ + __x.__i_, __y.__x_ + (_Rp - (__x.__i_ + __j)));
211 size_t __j = _Rp - __x.__i_; variable
212 if (!std::equal(__y.__x_ + __y.__i_, __y.__x_ + (__y.__i_ + __j), __x.__x_ + __x.__i_))
[all …]
H A Dmersenne_twister_engine.h415 const size_t __j = (__i_ + 1) % __n; in operator() local
417 const result_type __yp = (__x_[__i_] & ~__mask) | (__x_[__j] & __mask); in operator()
421 __i_ = __j; in operator()
447 size_t __j = std::min(_Np - __x.__i_, _Np - __y.__i_); variable
448 if (!std::equal(__x.__x_ + __x.__i_, __x.__x_ + __x.__i_ + __j, __y.__x_ + __y.__i_))
451 return std::equal(__x.__x_ + __j, __x.__x_ + _Np, __y.__x_);
452 return std::equal(__x.__x_, __x.__x_ + (_Np - __j), __y.__x_ + __j);
455 size_t __j = _Np - __y.__i_; variable
456 if (!std::equal(__x.__x_ + __x.__i_, __x.__x_ + (__x.__i_ + __j), __y.__x_ + __y.__i_))
458 if (!std::equal(__x.__x_ + (__x.__i_ + __j), __x.__x_ + _Np, __y.__x_))
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/__random/
H A Dsubtract_with_carry_engine.h202 size_t __j = std::min(_Rp - __x.__i_, _Rp - __y.__i_); variable
203 if (!std::equal(__x.__x_ + __x.__i_, __x.__x_ + __x.__i_ + __j, __y.__x_ + __y.__i_))
206 return std::equal(__x.__x_ + __j, __x.__x_ + _Rp, __y.__x_);
207 return std::equal(__x.__x_, __x.__x_ + (_Rp - __j), __y.__x_ + __j);
210 size_t __j = _Rp - __y.__i_; variable
211 if (!std::equal(__x.__x_ + __x.__i_, __x.__x_ + (__x.__i_ + __j), __y.__x_ + __y.__i_))
213 if (!std::equal(__x.__x_ + (__x.__i_ + __j), __x.__x_ + _Rp, __y.__x_))
215 return std::equal(__x.__x_, __x.__x_ + __x.__i_, __y.__x_ + (_Rp - (__x.__i_ + __j)));
217 size_t __j = _Rp - __x.__i_; variable
218 if (!std::equal(__y.__x_ + __y.__i_, __y.__x_ + (__y.__i_ + __j), __x.__x_ + __x.__i_))
[all …]
H A Dmersenne_twister_engine.h652 const size_t __j = (__i_ + 1) % __n; in operator() local
654 const result_type __yp = (__x_[__i_] & ~__mask) | (__x_[__j] & __mask); in operator()
658 __i_ = __j; in operator()
684 size_t __j = std::min(_Np - __x.__i_, _Np - __y.__i_); variable
685 if (!std::equal(__x.__x_ + __x.__i_, __x.__x_ + __x.__i_ + __j, __y.__x_ + __y.__i_))
688 return std::equal(__x.__x_ + __j, __x.__x_ + _Np, __y.__x_);
689 return std::equal(__x.__x_, __x.__x_ + (_Np - __j), __y.__x_ + __j);
692 size_t __j = _Np - __y.__i_; variable
693 if (!std::equal(__x.__x_ + __x.__i_, __x.__x_ + (__x.__i_ + __j), __y.__x_ + __y.__i_))
695 if (!std::equal(__x.__x_ + (__x.__i_ + __j), __x.__x_ + _Np, __y.__x_))
[all …]
/freebsd/contrib/llvm-project/libcxx/src/
H A Dvalarray.cpp36 for (size_t __j = __i + 1; __j != __indices.size(); ++__j) in __init()
37 __1d_[__k] -= __stride_[__j] * (__size_[__j] - 1); in __init()
42 for (size_t __j = __i + 1; __j != __indices.size(); ++__j) __init() local
/freebsd/contrib/llvm-project/libcxx/src/ryu/
H A Dd2fixed.cpp92 …ne uint32_t __mulShift_mod1e9(const uint64_t __m, const uint64_t* const __mul, const int32_t __j) { in __mulShift_mod1e9() argument
106 _LIBCPP_ASSERT_INTERNAL(__j >= 128, ""); in __mulShift_mod1e9()
107 _LIBCPP_ASSERT_INTERNAL(__j <= 180, ""); in __mulShift_mod1e9()
109 const uint32_t __dist = static_cast<uint32_t>(__j - 128); // __dist: [0, 52] in __mulShift_mod1e9()
114 if (__j < 160) { // __j: [128, 160) in __mulShift_mod1e9()
118 return __mod1e9(__r2 >> (__j - 128)); in __mulShift_mod1e9()
122 return __mod1e9(__r1 >> (__j - 160)); in __mulShift_mod1e9()
280 const uint32_t __j = __p10bits - __e2; in __d2fixed_buffered_n() local
284 static_cast<int32_t>(__j + 8)); in __d2fixed_buffered_n()
336 const int32_t __j = __ADDITIONAL_BITS_2 + (-__e2 - 16 * __idx); in __d2fixed_buffered_n() local
[all …]
H A Dd2s.cpp96 …BI inline uint64_t __mulShift(const uint64_t __m, const uint64_t* const __mul, const int32_t __j) { in __mulShift() argument
106 return __ryu_shiftright128(__sum, __high1, static_cast<uint32_t>(__j - 64)); in __mulShift()
109 …I inline uint64_t __mulShiftAll(const uint64_t __m, const uint64_t* const __mul, const int32_t __j, in __mulShiftAll() argument
111 *__vp = __mulShift(4 * __m + 2, __mul, __j); in __mulShiftAll()
112 *__vm = __mulShift(4 * __m - 1 - __mmShift, __mul, __j); in __mulShiftAll()
113 return __mulShift(4 * __m, __mul, __j); in __mulShiftAll()
118 …_ALWAYS_INLINE uint64_t __mulShiftAll(uint64_t __m, const uint64_t* const __mul, const int32_t __j,
131 *__vp = __ryu_shiftright128(__mid2, __hi2, static_cast<uint32_t>(__j - 64 - 1));
137 *__vm = __ryu_shiftright128(__mid3, __hi3, static_cast<uint32_t>(__j - 64 - 1));
145 *__vm = __ryu_shiftright128(__mid4, __hi4, static_cast<uint32_t>(__j - 64));
[all …]
H A Df2s.cpp144 …BI inline uint32_t __mulPow5InvDivPow2(const uint32_t __m, const uint32_t __q, const int32_t __j) { in __mulPow5InvDivPow2() argument
145 return __mulShift(__m, __FLOAT_POW5_INV_SPLIT[__q], __j); in __mulPow5InvDivPow2()
148 …M_ABI inline uint32_t __mulPow5divPow2(const uint32_t __m, const uint32_t __i, const int32_t __j) { in __mulPow5divPow2() argument
149 return __mulShift(__m, __FLOAT_POW5_SPLIT[__i], __j); in __mulPow5divPow2()
217 int32_t __j = static_cast<int32_t>(__q) - __k; in __f2d() local
218 __vr = __mulPow5divPow2(__mv, static_cast<uint32_t>(__i), __j); in __f2d()
219 __vp = __mulPow5divPow2(__mp, static_cast<uint32_t>(__i), __j); in __f2d()
220 __vm = __mulPow5divPow2(__mm, static_cast<uint32_t>(__i), __j); in __f2d()
222 __j = static_cast<int32_t>(__q) - 1 - (__pow5bits(__i + 1) - __FLOAT_POW5_BITCOUNT); in __f2d()
223 …ovedDigit = static_cast<uint8_t>(__mulPow5divPow2(__mv, static_cast<uint32_t>(__i + 1), __j) % 10); in __f2d()
/freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/
H A Dalgorithm_impl.h
H A Dparallel_backend_utils.h

123