Home
last modified time | relevance | path

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

12

/llvm-project-15.0.7/libcxx/include/__algorithm/
H A Dnth_element.h35 if (__i == --__j) { in __nth_element_find_guard()
38 if (__comp(*__j, *__m)) { in __nth_element_find_guard()
101 __j = __last; in __nth_element()
116 if (__i == __j) { in __nth_element()
124 if (__i >= __j) in __nth_element()
144 if (__i < __j) in __nth_element()
155 if (__i >= __j) in __nth_element()
162 __m = __j; in __nth_element()
191 __m = __j; in __nth_element()
197 __j = __m = __i; in __nth_element()
[all …]
H A Dsort.h323 __j = __i;
326 __j = __k;
330 __j = __i;
375 __j = __i;
378 __j = __k;
384 __j = __i;
498 __j = __last;
514 if (__i == __j)
544 if (__i < __j) {
554 if (__i > __j)
[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.h74 for (auto __j = __first2; __j != __last2; ++__j) {
75 if (std::__invoke(__pred, std::__invoke(__proj1, *__i), std::__invoke(__proj2, *__j)))
83 for (auto __j = _IterOps<_AlgPolicy>::next(__i); __j != __last1; ++__j) {
84 if (std::__invoke(__pred, std::__invoke(__proj1, *__i), std::__invoke(__proj1, *__j)))
H A Dranges_find_first_of.h43 for (auto __j = __first2; __j != __last2; ++__j) { in __find_first_of_impl() local
44 if (std::invoke(__pred, std::invoke(__proj1, *__first1), std::invoke(__proj2, *__j))) in __find_first_of_impl()
H A Dprev_permutation.h44 _BidirectionalIterator __j = __last_iter; in __prev_permutation() local
45 while (!__comp(*--__j, *__i)) in __prev_permutation()
47 _IterOps<_AlgPolicy>::iter_swap(__i, __j); in __prev_permutation()
H A Dnext_permutation.h44 _BidirectionalIterator __j = __last_iter; in __next_permutation() local
45 while (!__comp(*__i, *--__j)) in __next_permutation()
47 _IterOps<_AlgPolicy>::iter_swap(__i, __j); in __next_permutation()
/llvm-project-15.0.7/libcxx/include/__functional/
H A Dboyer_moore_searcher.h169 while (__pred_(__first_[__j - 1], __current[__j - 1])) { in __search()
170 --__j; in __search()
171 if (__j == 0) in __search()
176 difference_type __m = __j - __k - 1; in __search()
177 if (__k < __j && __m > __suffix_[__j]) in __search()
180 __current += __suffix_[__j]; in __search()
221 if (__suffix_[__j] > __k) in __build_suffix_table()
222 __suffix_[__j] = __k; in __build_suffix_table()
296 while (__pred_(__first_[__j - 1], __current[__j - 1])) { in __search()
297 --__j; in __search()
[all …]
/llvm-project-15.0.7/libcxx/include/__random/
H A Dsubtract_with_carry_engine.h265 size_t __j = _VSTD::min(_Rp - __x.__i_, _Rp - __y.__i_); variable
271 return _VSTD::equal(__x.__x_, __x.__x_ + (_Rp - __j), __y.__x_ + __j);
275 size_t __j = _Rp - __y.__i_; variable
283 __y.__x_ + (_Rp - (__x.__i_ + __j)));
285 size_t __j = _Rp - __x.__i_; variable
289 if (!_VSTD::equal(__y.__x_ + (__y.__i_ + __j), __y.__x_ + _Rp,
293 __x.__x_ + (_Rp - (__y.__i_ + __j)));
318 for (size_t __j = __x.__i_ + 1; __j < _Rp; ++__j) variable
319 __os << __sp << __x.__x_[__j];
320 for (size_t __j = 0; __j < __x.__i_; ++__j) variable
[all …]
H A Dmersenne_twister_engine.h403 const size_t __j = (__i_ + 1) % __n; in operator() local
410 __i_ = __j; in operator()
429 size_t __j = _VSTD::min(_Np - __x.__i_, _Np - __y.__i_); variable
435 return _VSTD::equal(__x.__x_, __x.__x_ + (_Np - __j), __y.__x_ + __j);
439 size_t __j = _Np - __y.__i_; variable
449 size_t __j = _Np - __x.__i_; variable
457 __x.__x_ + (_Np - (__y.__i_ + __j)));
488 for (size_t __j = __x.__i_ + 1; __j < _Np; ++__j) variable
489 __os << __sp << __x.__x_[__j];
490 for (size_t __j = 0; __j < __x.__i_; ++__j) variable
[all …]
H A Dshuffle_order_engine.h193 const size_t __j = static_cast<size_t>(__uratio<_Np, _Dp>::num * (_Y_ - _Min)
195 _Y_ = _V_[__j];
196 _V_[__j] = __e_();
207 const size_t __j = static_cast<size_t>(_Fp * (_Y_ - _Min));
208 _Y_ = _V_[__j];
209 _V_[__j] = __e_();
/llvm-project-15.0.7/libcxx/src/
H A Dvalarray.cpp42 for (size_t __j = __i + 1; __j != __indices.size(); ++__j) in __init() local
43 __1d_[__k] -= __stride_[__j] * (__size_[__j] - 1); in __init()
/llvm-project-15.0.7/pstl/include/pstl/internal/
H A Dparallel_impl.h42 [__comp, __f, __first, &__extremum](_Index __i, _Index __j) in __parallel_find()
48 _Index __res = __f(__i, __j); in __parallel_find()
50 if (__res != __j) in __parallel_find()
74 [__f, &__found](_Index __i, _Index __j) in __parallel_or()
76 if (!__found.load(std::memory_order_relaxed) && __f(__i, __j)) in __parallel_or()
H A Dunseq_backend_simd.h481 for (_Size __j = 0; __j < __block_size; ++__j) in __simd_transform_reduce() local
483 __lane[__j] = __binary_op(__lane[__j], __f(__i + __j)); in __simd_transform_reduce()
488 for (_Size __j = 0; __j < __n - last_iteration; ++__j) in __simd_transform_reduce() local
490 __lane[__j] = __binary_op(__lane[__j], __f(last_iteration + __j)); in __simd_transform_reduce()
493 for (_Size __j = 0; __j < __block_size; ++__j) in __simd_transform_reduce() local
495 __init = __binary_op(__init, __lane[__j]); in __simd_transform_reduce()
499 for (_Size __j = 0; __j < __block_size; ++__j) in __simd_transform_reduce() local
501 __lane[__j].~_Tp(); in __simd_transform_reduce()
H A Dparallel_backend_utils.h86 const auto __j = __zs - __zs_beg; in operator() local
87 if (__same_move_seq || __j < __nx) in operator()
104 const auto __j = __zs - __zs_beg; in operator() local
105 if (__same_move_seq || __j < __nx) in operator()
113 const auto __j = __zs - __zs_beg; in operator() local
114 if (__same_move_seq || __j < __nx) in operator()
H A Dalgorithm_impl.h211 … [__brick](_RandomAccessIterator __i, _RandomAccessIterator __j) { __brick(__i, __j - __i); }); in __pattern_walk_brick_n()
1265 if (__result - __mask == __j) in __remove_elements()
1864 if (__x != __j) in __pattern_is_partitioned()
1869 if (__y != __j) in __pattern_is_partitioned()
1887 if (__internal::__brick_find_if(__i + 1, __j, __pred, _IsVector{}) != __j) in __pattern_is_partitioned()
2342 if (__n2 < __j - __i) in __pattern_partial_sort_copy()
2355 … [](_T1* __i, _T1* __j) { __brick_destroy(__i, __j, _IsVector{}); }); in __pattern_partial_sort_copy()
2864 _PSTL_ASSERT(__j > __i); in __pattern_includes()
2882 if (__j < __last2 && __is_equal(__j - 1, __j)) in __pattern_includes()
2883 __j = std::upper_bound(__j, __last2, *__j, __comp); in __pattern_includes()
[all …]
H A Dnumeric_impl.h86 …rst1, __first2, __binary_op1, __binary_op2](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j, in __pattern_transform_reduce()
89 … return __internal::__brick_transform_reduce(__i, __j, __first2 + (__i - __first1), __init, in __pattern_transform_reduce()
144 … [__unary_op, __binary_op](_RandomAccessIterator __i, _RandomAccessIterator __j, _Tp __init) { in __pattern_transform_reduce()
145 …return __internal::__brick_transform_reduce(__i, __j, __init, __binary_op, __unary_op, _IsVector{}… in __pattern_transform_reduce()
253 … [__first, __unary_op, __binary_op](_DifferenceType __i, _DifferenceType __j, _Tp __init) in __pattern_transform_scan()
256 … return __internal::__brick_transform_reduce(__first + __i, __first + __j, __init, __binary_op, in __pattern_transform_scan()
260 … [__first, __unary_op, __binary_op, __result](_DifferenceType __i, _DifferenceType __j, _Tp __init) in __pattern_transform_scan()
262 …return __internal::__brick_transform_scan(__first + __i, __first + __j, __result + __i, __unary_op, in __pattern_transform_scan()
/llvm-project-15.0.7/libcxx/include/experimental/
H A Dfunctional259 while (__pred_(__first_ [__j-1], __cur [__j-1])) {
260 __j--;
262 if ( __j == 0 )
268 difference_type __m = __j - __k - 1;
269 if (__k < __j && __m > __suffix[ __j ])
272 __cur += __suffix[ __j ];
318 if (__suffix[__j] > __k)
319 __suffix[__j] = __k;
405 while (__pred_(__first_[__j-1], __cur[__j-1]))
407 __j--;
[all …]
/llvm-project-15.0.7/libcxx/src/ryu/
H A Dd2fixed.cpp106 _LIBCPP_ASSERT(__j >= 128, ""); in __mulShift_mod1e9()
107 _LIBCPP_ASSERT(__j <= 180, ""); 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
476 const uint32_t __j = __p10bits - __e2; in __d2exp_buffered_n() local
480 static_cast<int32_t>(__j + 8)); in __d2exp_buffered_n()
[all …]
H A Dd2s.cpp95 …BI inline uint64_t __mulShift(const uint64_t __m, const uint64_t* const __mul, const int32_t __j) { in __mulShift() argument
105 return __ryu_shiftright128(__sum, __high1, static_cast<uint32_t>(__j - 64)); in __mulShift()
110 *__vp = __mulShift(4 * __m + 2, __mul, __j); in __mulShiftAll()
111 *__vm = __mulShift(4 * __m - 1 - __mmShift, __mul, __j); in __mulShiftAll()
112 return __mulShift(4 * __m, __mul, __j); in __mulShiftAll()
130 *__vp = __ryu_shiftright128(__mid2, __hi2, static_cast<uint32_t>(__j - 64 - 1));
136 *__vm = __ryu_shiftright128(__mid3, __hi3, static_cast<uint32_t>(__j - 64 - 1));
144 *__vm = __ryu_shiftright128(__mid4, __hi4, static_cast<uint32_t>(__j - 64));
147 return __ryu_shiftright128(__mid, __hi, static_cast<uint32_t>(__j - 64 - 1));
241 const int32_t __j = static_cast<int32_t>(__q) - __k; in __d2d() local
[all …]
H A Df2s.cpp142 …BI inline uint32_t __mulPow5InvDivPow2(const uint32_t __m, const uint32_t __q, const int32_t __j) { in __mulPow5InvDivPow2() argument
143 return __mulShift(__m, __FLOAT_POW5_INV_SPLIT[__q], __j); in __mulPow5InvDivPow2()
146 …M_ABI inline uint32_t __mulPow5divPow2(const uint32_t __m, const uint32_t __i, const int32_t __j) { in __mulPow5divPow2() argument
147 return __mulShift(__m, __FLOAT_POW5_SPLIT[__i], __j); in __mulPow5divPow2()
215 int32_t __j = static_cast<int32_t>(__q) - __k; in __f2d() local
216 __vr = __mulPow5divPow2(__mv, static_cast<uint32_t>(__i), __j); in __f2d()
217 __vp = __mulPow5divPow2(__mp, static_cast<uint32_t>(__i), __j); in __f2d()
218 __vm = __mulPow5divPow2(__mm, static_cast<uint32_t>(__i), __j); in __f2d()
220 __j = static_cast<int32_t>(__q) - 1 - (__pow5bits(__i + 1) - __FLOAT_POW5_BITCOUNT); in __f2d()
221 …ovedDigit = static_cast<uint8_t>(__mulPow5divPow2(__mv, static_cast<uint32_t>(__i + 1), __j) % 10); in __f2d()
/llvm-project-15.0.7/libcxx/include/
H A D__debug101 const iterator* __j = static_cast<const iterator*>(__i);
103 return _Cp->__dereferenceable(__j);
111 const iterator* __j = static_cast<const iterator*>(__i);
113 return _Cp->__decrementable(__j);
121 const iterator* __j = static_cast<const iterator*>(__i);
123 return _Cp->__addable(__j, __n);
131 const iterator* __j = static_cast<const iterator*>(__i);
133 return _Cp->__subscriptable(__j, __n);
195 bool __less_than_comparable(const void* __i, const void* __j) const;
H A Dforward_list1094 for (; __j != __e && __f != __l; ++__i, (void) ++__j, ++__f)
1095 *__j = *__f;
1096 if (__j == __e)
1109 for (; __j != __e && __n > 0; --__n, ++__i, ++__j)
1110 *__j = __v;
1111 if (__j == __e)
1523 for (; __j != __e && *__j == __v; ++__j)
1528 __i = __j;
1551 for (; __j != __e && __pred(*__j); ++__j)
1575 for (; __j != __e && __binary_pred(*__i, *__j); ++__j)
[all …]
/llvm-project-15.0.7/libcxx/include/__ranges/
H A Diota_view.h76 requires(_Iter __i, const _Iter __j, const _IotaDiffT<_Iter> __n) { in requires() argument
79 _Iter(__j + __n); in requires()
80 _Iter(__n + __j); in requires()
81 _Iter(__j - __n); in requires()
82 { __j - __j } -> convertible_to<_IotaDiffT<_Iter>>; in requires()
/llvm-project-15.0.7/libcxx/include/__iterator/
H A Dconcepts.h157 requires(_Ip __i, const _Ip __j, const iter_difference_t<_Ip> __n) { in requires() argument
159 { __j + __n } -> same_as<_Ip>; in requires()
160 { __n + __j } -> same_as<_Ip>; in requires()
162 { __j - __n } -> same_as<_Ip>; in requires()
163 { __j[__n] } -> same_as<iter_reference_t<_Ip>>; in requires()

12