/freebsd/contrib/llvm-project/libcxx/include/__random/ |
H A D | piecewise_linear_distribution.h | 161 for (size_t __i = 0; __i < __areas_.size(); ++__i) { in __init() local 165 for (size_t __i = __areas_.size(); __i > 1;) { in __init() local 170 for (size_t __i = 1; __i < __areas_.size(); ++__i) in __init() local 215 for (size_t __i = 0; __i < __b_.size(); ++__i) in param_type() local 231 for (size_t __i = 0; __i < __n; ++__i) { in param_type() local 269 for (size_t __i = 0; __i < __n; ++__i) variable 273 for (size_t __i = 0; __i < __n; ++__i) variable 277 for (size_t __i = 0; __i < __n; ++__i) variable 293 for (size_t __i = 0; __i < __n; ++__i) variable 297 for (size_t __i = 0; __i < __n; ++__i) variable [all …]
|
H A D | piecewise_constant_distribution.h | 161 for (size_t __i = 0; __i < __densities_.size(); ++__i) in __init() local 168 for (size_t __i = 0; __i < __densities_.size(); ++__i) in __init() local 191 for (size_t __i = 0; __i < __b_.size() - 1; ++__i, ++__f_w) in param_type() local 212 for (size_t __i = 0; __i < __b_.size() - 1; ++__i) in param_type() local 228 for (size_t __i = 0; __i < __n; ++__i) { in param_type() local 256 for (size_t __i = 0; __i < __n; ++__i) variable 260 for (size_t __i = 0; __i < __n; ++__i) variable 264 for (size_t __i = 0; __i < __n; ++__i) variable 280 for (size_t __i = 0; __i < __n; ++__i) variable 284 for (size_t __i = 0; __i < __n; ++__i) variable [all …]
|
H A D | mersenne_twister_engine.h | 652 for (size_t __i = 1; __i < __n; ++__i) in seed() local 677 for (size_t __i = 0; __i < __n; ++__i) in __seed() local 682 for (size_t __i = 1; __i < __n; ++__i) in __seed() local 709 for (size_t __i = 0; __i < __n; ++__i) in __seed() local 714 for (size_t __i = 1; __i < __n; ++__i) in __seed() local 867 for (size_t __i = 0; __i < _Np; ++__i) variable 870 for (size_t __i = 0; __i < _Np; ++__i) variable
|
H A D | subtract_with_carry_engine.h | 148 for (size_t __i = 0; __i < __r; ++__i) in seed() local 157 for (size_t __i = 0; __i < __r; ++__i) { in seed() local 171 for (size_t __i = 0; __i < __r; ++__i) in __seed() local 183 for (size_t __i = 0; __i < __r; ++__i) in __seed() local 261 for (size_t __i = 0; __i < _Rp + 1; ++__i) variable 264 for (size_t __i = 0; __i < _Rp; ++__i) variable
|
H A D | discrete_distribution.h | 145 for (vector<double>::iterator __i = __p_.begin(), __e = __p_.end(); __i < __e; ++__i) in __init() local 187 for (size_t __i = 0; __i < __n; ++__i) variable 201 for (size_t __i = 0; __i < __n; ++__i) variable
|
/freebsd/contrib/llvm-project/libcxx/include/__iterator/ |
H A D | concepts.h | 54 requires(const _In __i) { in requires() 100 concept incrementable = regular<_Ip> && weakly_incrementable<_Ip> && requires(_Ip __i) { in requires() 106 concept input_or_output_iterator = requires(_Ip __i) { in requires() 147 …terator<_Ip> && derived_from<_ITER_CONCEPT<_Ip>, bidirectional_iterator_tag> && requires(_Ip __i) { in requires() 156 requires(_Ip __i, const _Ip __j, const iter_difference_t<_Ip> __n) { in requires() 169 requires(const _Ip& __i) { in requires()
|
H A D | advance.h | 39 __advance(_InputIter& __i, typename iterator_traits<_InputIter>::difference_type __n, input_iterato… in __advance() 46 __advance(_BiDirIter& __i, typename iterator_traits<_BiDirIter>::difference_type __n, bidirectional… in __advance() 57 __advance(_RandIter& __i, typename iterator_traits<_RandIter>::difference_type __n, random_access_i… in __advance() 65 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 void advance(_InputIter& __i, _Distance __orig_… in advance()
|
H A D | iterator_traits.h | 158 concept __cpp17_iterator = requires(_Ip __i) { in requires() 165 …t __cpp17_input_iterator = __cpp17_iterator<_Ip> && equality_comparable<_Ip> && requires(_Ip __i) { in requires() 177 requires(_Ip __i) { in requires() 183 concept __cpp17_bidirectional_iterator = __cpp17_forward_iterator<_Ip> && requires(_Ip __i) { in requires() 192 requires(_Ip __i, typename incrementable_traits<_Ip>::difference_type __n) { in requires()
|
H A D | insert_iterator.h | 64 insert_iterator(_Container& __x, __insert_iterator_iter_t<_Container> __i) in insert_iterator() 87 inserter(_Container& __x, __insert_iterator_iter_t<_Container> __i) { in inserter()
|
H A D | common_iterator.h | 73 …_LIBCPP_HIDE_FROM_ABI constexpr common_iterator(_Iter __i) : __hold_(in_place_type<_Iter>, std::mo… in common_iterator() 239 …iter_move(const common_iterator& __i) noexcept(noexcept(ranges::iter_move(std::declval<const _Iter… in iter_move()
|
H A D | reverse_iterator.h | 186 …_ABI friend constexpr iter_rvalue_reference_t<_Iter> iter_move(const reverse_iterator& __i) noexce… in iter_move() 314 …E_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 reverse_iterator<_Iter> make_reverse_iterator(_Iter __i) { in make_reverse_iterator() 382 iter_move(const __unconstrained_reverse_iterator& __i) noexcept( in iter_move()
|
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/pstl_backends/cpu_backends/ |
H A D | transform_reduce.h | 46 for (_DifferenceType __i = 0; __i < __n; ++__i) in __simd_transform_reduce() local 68 for (_Size __i = 0; __i < __block_size; ++__i) { in __simd_transform_reduce() local 72 _Size __i = 2 * __block_size; in __simd_transform_reduce() local 95 for (_Size __i = 0; __i < __n; ++__i) { in __simd_transform_reduce() local
|
H A D | find_if.h | 72 …_PSTL_PRAGMA_SIMD_REDUCTION(| : __found) for (_DifferenceType __i = __begin; __i < __begin + __blo… in __simd_first() local 78 _DifferenceType __i; in __simd_first() local
|
H A D | transform.h | 37 for (_DifferenceType __i = 0; __i < __n; ++__i) in __simd_walk() local 79 for (_DifferenceType __i = 0; __i < __n; ++__i) in __simd_walk() local
|
/freebsd/contrib/llvm-project/libcxx/src/ |
H A D | valarray.cpp | 24 for (size_t __i = 0; __i < __size_.size(); ++__i) in __init() local 31 size_t __i = __indices.size() - 1; in __init() local
|
/freebsd/contrib/llvm-project/libcxx/include/__ranges/ |
H A D | iota_view.h | 78 concept __decrementable = incrementable<_Iter> && requires(_Iter __i) { in requires() 86 requires(_Iter __i, const _Iter __j, const _IotaDiffT<_Iter> __n) { in requires()
|
/freebsd/contrib/llvm-project/libcxx/include/__functional/ |
H A D | boyer_moore_searcher.h | 115 difference_type __i = 0; in __first_() local 181 for (size_t __i = 1; __i != __count; ++__i) { in __compute_bm_prefix() local 201 for (size_t __i = 0; __i <= __count; ++__i) in __build_suffix_table() local 207 for (size_t __i = 0; __i != __count; ++__i) { in __build_suffix_table() local 247 difference_type __i = 0; in __first_() local
|
/freebsd/contrib/llvm-project/libcxx/src/ryu/ |
H A D | d2fixed.cpp | 127 uint32_t __i = 0; in __append_n_digits() local 156 uint32_t __i = 0; in __append_d_digits() local 188 uint32_t __i = 0; in __append_c_digits() local 206 for (uint32_t __i = 0; __i < 5; __i += 4) { in __append_nine_digits() local 278 for (int32_t __i = __len - 1; __i >= 0; --__i) { in __d2fixed_buffered_n() local 318 uint32_t __i = 0; in __d2fixed_buffered_n() local 474 for (int32_t __i = __len - 1; __i >= 0; --__i) { in __d2exp_buffered_n() local 517 for (int32_t __i = __MIN_BLOCK_2[__idx]; __i < 200; ++__i) { in __d2exp_buffered_n() local
|
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/ |
H A D | shuffle.h | 105 difference_type __i = __uid(__g, _Pp(0, __d)); in random_shuffle() local 126 difference_type __i = __rand(__d); in random_shuffle() local 147 difference_type __i = __uid(__g, _Pp(0, __d)); in __shuffle() local
|
H A D | nth_element.h | 33 …_RandomAccessIterator& __i, _RandomAccessIterator& __j, _RandomAccessIterator __m, _Compare __comp… in __nth_element_find_guard() 84 _RandomAccessIterator __i = __first; in __nth_element() local
|
H A D | remove.h | 31 _ForwardIterator __i = __first; in remove() local
|
H A D | remove_if.h | 30 _ForwardIterator __i = __first; in remove_if() local
|
/freebsd/contrib/llvm-project/libcxx/include/__string/ |
H A D | constexpr_c_functions.h | 43 size_t __i = 0; in __constexpr_strlen() local 208 for (size_t __i = 0; __i != __count; ++__i) in __constexpr_memmove() local
|
/freebsd/contrib/llvm-project/libcxx/include/__format/ |
H A D | formatter_output.h | 177 for (size_t __i = 0; __i < __n; ++__i) in requires() local 190 for (size_t __i = 0; __i < __n; ++__i) in __fill() local
|
H A D | width_estimation_table.h | 256 ptrdiff_t __i = std::ranges::upper_bound(__entries, (__code_point << 14) | 0x3fffu) - __entries; in __estimated_width() local
|