Home
last modified time | relevance | path

Searched refs:__i (Results 1 – 25 of 123) sorted by relevance

12345

/llvm-project-15.0.7/pstl/include/pstl/internal/
H A Dunseq_backend_simd.h36 for (_DifferenceType __i = 0; __i < __n; ++__i) in __simd_walk_1() local
47 for (_DifferenceType __i = 0; __i < __n; ++__i) in __simd_walk_2() local
58 for (_DifferenceType __i = 0; __i < __n; ++__i) in __simd_walk_3() local
72 for (__i = 0; __i < __n; ++__i) in __simd_or()
506 for (_Size __i = 0; __i < __n; ++__i) in __simd_transform_reduce() local
522 for (_Size __i = 0; __i < __n; ++__i) in __simd_scan() local
562 for (_Size __i = 0; __i < __n; ++__i) in __simd_scan() local
580 for (_Size __i = 0; __i < __n; ++__i) in __simd_scan() local
602 for (_Size __i = 0; __i < __n; ++__i) in __simd_scan() local
658 for (_Size __i = 1; __i < __n; ++__i) in __simd_min_element() local
[all …]
H A Dnumeric_impl.h54 … [=, &__binary_op2](_DifferenceType __i) { return __binary_op2(__first1[__i], __first2[__i]); }); in __brick_transform_reduce()
82 [__first1, __first2, __binary_op2](_RandomAccessIterator1 __i) mutable in __pattern_transform_reduce()
83 { return __binary_op2(*__i, *(__first2 + (__i - __first1))); }, in __pattern_transform_reduce()
89 … return __internal::__brick_transform_reduce(__i, __j, __first2 + (__i - __first1), __init, in __pattern_transform_reduce()
116 [=, &__unary_op](_DifferenceType __i) { return __unary_op(__first[__i]); }); in __brick_transform_reduce()
143 … [__unary_op](_RandomAccessIterator __i) mutable { return __unary_op(*__i); }, __init, __binary_op, in __pattern_transform_reduce()
251 … [__first, __unary_op](_DifferenceType __i) mutable { return __unary_op(__first[__i]); }, __init, in __pattern_transform_scan()
262 …return __internal::__brick_transform_scan(__first + __i, __first + __j, __result + __i, __unary_op, in __pattern_transform_scan()
293 … return __internal::__brick_transform_scan(__first + __i, __first + (__i + __len), __result + __i, in __pattern_transform_scan()
298 [__result, &__binary_op](_DifferenceType __i, _DifferenceType __len, _Tp __initial) in __pattern_transform_scan()
[all …]
/llvm-project-15.0.7/libcxx/include/__algorithm/
H A Dnth_element.h35 if (__i == --__j) { in __nth_element_find_guard()
128 ++__i; in __nth_element()
141 ++__i; in __nth_element()
144 if (__i < __j) in __nth_element()
151 ++__i; in __nth_element()
163 ++__i; in __nth_element()
167 if (__i != __m && __comp(*__m, *__i)) in __nth_element()
173 if (__nth == __i) in __nth_element()
178 if (__nth < __i) in __nth_element()
212 if (__nth < __i) in __nth_element()
[all …]
H A Dsort.h301 for (++__i; __i != __last; ++__i) {
319 for (_RandomAccessIterator __i = __j + difference_type(1); __i != __last; ++__i) {
323 __j = __i;
330 __j = __i;
371 for (_RandomAccessIterator __i = __j + difference_type(1); __i != __last; ++__i) {
375 __j = __i;
384 __j = __i;
541 ++__i;
562 ++__i;
566 if (__i != __m && __comp(*__m, *__i)) {
[all …]
H A Dminmax_element.h56 _Iter __i = __first; in __minmax_element_impl() local
58 if (__less(__i, __result.first)) in __minmax_element_impl()
59 __result.first = __i; in __minmax_element_impl()
60 else if (!__less(__i, __result.second)) in __minmax_element_impl()
61 __result.second = __i; in __minmax_element_impl()
65 if (__less(__first, __i)) { in __minmax_element_impl()
68 if (!__less(__i, __result.second)) in __minmax_element_impl()
69 __result.second = __i; in __minmax_element_impl()
71 if (__less(__i, __result.first)) in __minmax_element_impl()
72 __result.first = __i; in __minmax_element_impl()
H A Dstable_partition.h59 _ForwardIterator __i = __first; in __stable_partition_impl() local
60 while (++__i != __last) in __stable_partition_impl()
62 if (__pred(*__i)) in __stable_partition_impl()
76 __i = __first; in __stable_partition_impl()
78 *__i = _Ops::__iter_move(__t2); in __stable_partition_impl()
189 _BidirectionalIterator __i = __first; in __stable_partition_impl() local
190 while (++__i != __last) in __stable_partition_impl()
192 if (__pred(*__i)) in __stable_partition_impl()
205 *__first = _Ops::__iter_move(__i); in __stable_partition_impl()
206 __i = ++__first; in __stable_partition_impl()
[all …]
H A Dranges_minmax.h95 _ValueT __i = *__first; local
97 if (__less(__i, __result.min))
98 __result.min = __i;
99 else if (!__less(__i, __result.max))
100 __result.max = __i;
104 if (__less(*__first, __i)) {
107 if (!__less(__i, __result.max))
108 __result.max = std::move(__i);
110 if (__less(__i, __result.min))
111 __result.min = std::move(__i);
H A Dprev_permutation.h35 _BidirectionalIterator __i = __last_iter; in __prev_permutation() local
36 if (__first == __last || __first == --__i) in __prev_permutation()
41 _BidirectionalIterator __ip1 = __i; in __prev_permutation()
42 if (__comp(*__ip1, *--__i)) in __prev_permutation()
45 while (!__comp(*--__j, *__i)) in __prev_permutation()
47 _IterOps<_AlgPolicy>::iter_swap(__i, __j); in __prev_permutation()
51 if (__i == __first) in __prev_permutation()
H A Dnext_permutation.h35 _BidirectionalIterator __i = __last_iter; in __next_permutation() local
36 if (__first == __last || __first == --__i) in __next_permutation()
41 _BidirectionalIterator __ip1 = __i; in __next_permutation()
42 if (__comp(*--__i, *__ip1)) in __next_permutation()
45 while (!__comp(*__i, *--__j)) in __next_permutation()
47 _IterOps<_AlgPolicy>::iter_swap(__i, __j); in __next_permutation()
51 if (__i == __first) in __next_permutation()
/llvm-project-15.0.7/libcxx/include/__iterator/
H A Dadvance.h35 ++__i; in __advance()
43 ++__i; in __advance()
46 --__i; in __advance()
52 __i += __n; in __advance()
82 ++__i; in __advance_forward()
91 --__i; in __advance_backward()
105 __i += __n; in operator()
129 (*this)(__i, __bound_sentinel - __i); in operator()
134 ++__i; in operator()
170 ++__i; in operator()
[all …]
H A Diter_move.h64 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr decltype(auto) operator()(_Ip&& __i) const in decltype()
65 noexcept(noexcept(iter_move(std::forward<_Ip>(__i)))) in decltype()
67 return iter_move(std::forward<_Ip>(__i)); in decltype()
72 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Ip&& __i) const
73 noexcept(noexcept(std::move(*std::forward<_Ip>(__i))))
74 -> decltype( std::move(*std::forward<_Ip>(__i)))
75 { return std::move(*std::forward<_Ip>(__i)); }
79 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Ip&& __i) const
80 noexcept(noexcept(*std::forward<_Ip>(__i)))
81 -> decltype( *std::forward<_Ip>(__i))
[all …]
H A Dconcepts.h34 requires(const _In __i) { in requires() argument
73 requires(_Ip __i) {
85 requires(_Ip __i) { in requires() argument
86 { __i++ } -> same_as<_Ip>; in requires()
92 requires(_Ip __i) { in requires() argument
93 { *__i } -> __can_reference; in requires()
146 requires(_Ip __i) { in requires() argument
147 { --__i } -> same_as<_Ip&>; in requires()
148 { __i-- } -> same_as<_Ip>; in requires()
158 { __i += __n } -> same_as<_Ip&>; in requires()
[all …]
H A Diterator_traits.h148 requires(_Ip __i) { in requires() argument
149 { *__i } -> __can_reference; in requires()
150 { ++__i } -> same_as<_Ip&>; in requires()
151 { *__i++ } -> __can_reference; in requires()
159 requires(_Ip __i) { in requires() argument
176 requires(_Ip __i) { in requires() argument
184 requires(_Ip __i) { in requires() argument
185 { --__i } -> same_as<_Ip&>; in requires()
197 { __i + __n } -> same_as<_Ip>; in requires()
198 { __n + __i } -> same_as<_Ip>; in requires()
[all …]
/llvm-project-15.0.7/libcxx/include/__random/
H A Dpiecewise_linear_distribution.h192 for (size_t __i = 0; __i < __areas_.size(); ++__i) in __init() local
204 for (size_t __i = 1; __i < __areas_.size(); ++__i) in __init() local
206 for (size_t __i = 0; __i < __densities_.size(); ++__i) in __init() local
261 for (size_t __i = 0; __i < __b_.size(); ++__i) in param_type() local
278 for (size_t __i = 0; __i < __n; ++__i) in param_type() local
325 for (size_t __i = 0; __i < __n; ++__i) variable
329 for (size_t __i = 0; __i < __n; ++__i) variable
333 for (size_t __i = 0; __i < __n; ++__i) variable
351 for (size_t __i = 0; __i < __n; ++__i) variable
355 for (size_t __i = 0; __i < __n; ++__i) variable
[all …]
H A Dpiecewise_constant_distribution.h193 for (size_t __i = 0; __i < __densities_.size(); ++__i) in __init() local
201 for (size_t __i = 0; __i < __densities_.size(); ++__i) in __init() local
202 __densities_[__i] /= (__b_[__i+1] - __b_[__i]); in __init()
257 for (size_t __i = 0; __i < __b_.size() - 1; ++__i) in param_type() local
274 for (size_t __i = 0; __i < __n; ++__i) in param_type() local
309 for (size_t __i = 0; __i < __n; ++__i) variable
313 for (size_t __i = 0; __i < __n; ++__i) variable
317 for (size_t __i = 0; __i < __n; ++__i) variable
335 for (size_t __i = 0; __i < __n; ++__i) variable
339 for (size_t __i = 0; __i < __n; ++__i) variable
[all …]
H A Dsubtract_with_carry_engine.h186 for (size_t __i = 0; __i < __r; ++__i) in seed() local
199 for (size_t __i = 0; __i < __r; ++__i) in seed() local
202 __x_[__i] = static_cast<result_type>( in seed()
218 for (size_t __i = 0; __i < __r; ++__i) in __seed() local
219 __x_[__i] = static_cast<result_type>(__ar[__i] & _Max); in __seed()
233 for (size_t __i = 0; __i < __r; ++__i) in __seed() local
235 (__ar[2 * __i] + ((uint64_t)__ar[2 * __i + 1] << 32)) & _Max); in __seed()
336 for (size_t __i = 0; __i < _Rp+1; ++__i) variable
337 __is >> __t[__i];
340 for (size_t __i = 0; __i < _Rp; ++__i) variable
[all …]
H A Dshuffle_order_engine.h159 for (size_t __i = 0; __i < __k; ++__i)
160 _V_[__i] = __e_();
249 for (size_t __i = 1; __i < _Kp; ++__i)
250 __os << __sp << __x._V_[__i];
267 for (size_t __i = 0; __i < _Kp+1; ++__i)
268 __is >> _Vp[__i];
272 for (size_t __i = 0; __i < _Kp; ++__i)
273 __x._V_[__i] = _Vp[__i];
/llvm-project-15.0.7/libcxx/src/ryu/
H A Dd2fixed.cpp128 uint32_t __i = 0; in __append_n_digits() local
140 __i += 4; in __append_n_digits()
146 __i += 2; in __append_n_digits()
169 __i += 4; in __append_d_digits()
175 __i += 2; in __append_d_digits()
190 for (; __i < __count - 1; __i += 2) { in __append_c_digits()
207 for (uint32_t __i = 0; __i < 5; __i += 4) { in __append_nine_digits() local
279 for (int32_t __i = __len - 1; __i >= 0; --__i) { in __d2fixed_buffered_n() local
335 for (; __i < __blocks; ++__i) { in __d2fixed_buffered_n()
475 for (int32_t __i = __len - 1; __i >= 0; --__i) { in __d2exp_buffered_n() local
[all …]
/llvm-project-15.0.7/libcxx/src/
H A Dvalarray.cpp26 for (size_t __i = 0; __i < __size_.size(); ++__i) in __init() local
27 __k *= __size_[__i]; in __init()
35 size_t __i = __indices.size() - 1; in __init() local
38 if (++__indices[__i] < __size_[__i]) in __init()
41 __1d_[__k] = __1d_[__k-1] + __stride_[__i]; in __init()
42 for (size_t __j = __i + 1; __j != __indices.size(); ++__j) in __init()
48 if (__i == 0) in __init()
50 __indices[__i--] = 0; in __init()
H A Ddebug.cpp123 __i_node* i = __find_iterator(__i); in __find_c_from_i()
146 __i_node* i = __insert_iterator(__i); in __insert_ic()
191 __libcpp_db::__erase_i(void* __i) in __erase_i() argument
203 while (p->__i_ != __i) in __erase_i()
350 __i_node* i = __find_iterator(__i); in __iterator_copy()
354 i = __insert_iterator(__i); in __iterator_copy()
378 __i_node* i = __find_iterator(__i); in __dereferenceable()
388 __i_node* i = __find_iterator(__i); in __decrementable()
457 __libcpp_db::__insert_i(void* __i) in __insert_i() argument
462 __insert_iterator(__i); in __insert_i()
[all …]
/llvm-project-15.0.7/libcxx/include/
H A D__debug54 : __i_(__i), __next_(__next), __c_(__c) {}
79 void __add(__i_node* __i);
80 _LIBCPP_HIDDEN void __remove(__i_node* __i);
174 void __insert_i(void* __i);
178 void __insert_ic(void* __i, const void* __c);
180 void __erase_i(void* __i);
182 void* __find_c_from_i(void* __i) const;
192 bool __decrementable(const void* __i) const;
198 __i_node* __insert_iterator(void* __i);
228 __get_db()->__insert_i(__i);
[all …]
H A Dvalarray2072 for (size_t __i = 0; __i < __n; ++__i)
2087 for (size_t __i = 0; __i < __n; ++__i)
2102 for (size_t __i = 0; __i < __n; ++__i)
2117 for (size_t __i = 0; __i < __n; ++__i)
2132 for (size_t __i = 0; __i < __n; ++__i)
2147 for (size_t __i = 0; __i < __n; ++__i)
2162 for (size_t __i = 0; __i < __n; ++__i)
2177 for (size_t __i = 0; __i < __n; ++__i)
2192 for (size_t __i = 0; __i < __n; ++__i)
2207 for (size_t __i = 0; __i < __n; ++__i)
[all …]
/llvm-project-15.0.7/libcxx/include/__functional/
H A Dboyer_moore_searcher.h127 difference_type __i = 0; in __first_() local
129 __skip_table_->insert(*__first, __i); in __first_()
131 ++__i; in __first_()
192 for (size_t __i = 1; __i != __count; ++__i) { in __compute_bm_prefix() local
196 if (__pred(__first[__k], __first[__i])) in __compute_bm_prefix()
198 __prefix[__i] = __k; in __compute_bm_prefix()
211 for (size_t __i = 0; __i <= __count; ++__i) in __build_suffix_table() local
217 for (size_t __i = 0; __i != __count; ++__i) { in __build_suffix_table() local
219 const difference_type __k = __i - __scratch[__i] + 1; in __build_suffix_table()
255 difference_type __i = 0; in __first_() local
[all …]
/llvm-project-15.0.7/pstl/include/pstl/internal/omp/
H A Dparallel_transform_reduce.h54 for (std::size_t __i = 0; __i < __num_threads; ++__i) in __transform_reduce_body() local
56 __accums.emplace_back(__unary_op(__first + __i)); in __transform_reduce_body()
73 for (std::size_t __i = 0; __i < __num_threads; ++__i) in __transform_reduce_body() local
75 __init = __combiner(__init, __accums[__i]); in __transform_reduce_body()
/llvm-project-15.0.7/libcxx/include/__format/
H A Dextended_grapheme_cluster_table.h314 …ptrdiff_t __i = std::upper_bound(__entries, std::end(__entries), (__code_point << 11) | 0x7ffu) - … in __get_property() local
315 if (__i == 0) in __get_property()
318 --__i; in __get_property()
319 uint32_t __upper_bound = (__entries[__i] >> 11) + ((__entries[__i] >> 4) & 0x7f); in __get_property()
321 return static_cast<__property>(__entries[__i] & 0xf); in __get_property()

12345