Home
last modified time | relevance | path

Searched refs:__k (Results 1 – 25 of 32) sorted by relevance

12

/freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/omp/
H A Dparallel_scan.h
/freebsd/contrib/llvm-project/libcxx/src/
H A Dvalarray.cpp23 size_t __k = __size_.size() != 0; in __init()
25 __k *= __size_[__i]; in __init() local
26 __1d_.resize(__k); in __init()
28 __k = 0; in __init()
29 __1d_[__k] = __start; in __init()
34 ++__k; in __init()
35 __1d_[__k] = __1d_[__k - 1] + __stride_[__i]; in __init()
37 __1d_[__k] -= __stride_[__j] * (__size_[__j] - 1); in __init()
/freebsd/contrib/llvm-project/libcxx/include/__random/
H A Dnegative_binomial_distribution.h45 …_LIBCPP_HIDE_FROM_ABI explicit param_type(result_type __k = 1, double __p = 0.5) : __k_(__k), __p_… in __k_() argument
63 …ROM_ABI explicit negative_binomial_distribution(result_type __k, double __p = 0.5) : __p_(__k, __p… in __p_() argument
65 …_LIBCPP_HIDE_FROM_ABI explicit negative_binomial_distribution(result_type __k = 1, double __p = 0.…
66 : __p_(__k, __p) {}
103 result_type __k = __pr.k(); in operator() local
107 if (__k <= 21 * __p && sizeof(_IntType) > 1) { in operator()
111 while (__s < __k) { in operator()
122 …return poisson_distribution<result_type>(gamma_distribution<double>(__k, (1 - __p) / __p)(__urng))… in operator()
145 result_type __k; variable
147 __is >> __k >> __p;
[all …]
H A Dseed_seq.h111 for (size_t __k = 1; __k <= __s; ++__k) { in generate() local
123 __r += __kmodn + __v_[__k - 1]; in generate()
127 for (size_t __k = __s + 1; __k < __m; ++__k) { in generate() local
143 for (size_t __k = __m; __k < __m + __n; ++__k) { in generate() local
H A Dshuffle_order_engine.h54 template <class _Engine, size_t __k>
56 static_assert(0 < __k, "shuffle_order_engine invalid parameters");
64 result_type __v_[__k];
69 static _LIBCPP_CONSTEXPR const size_t table_size = __k;
138 for (size_t __i = 0; __i < __k; ++__i)
143 _LIBCPP_HIDE_FROM_ABI result_type __eval(false_type) { return __eval2(integral_constant<bool, __k & 1>()); }
144 _LIBCPP_HIDE_FROM_ABI result_type __eval(true_type) { return __eval(__uratio<__k, _Rp>()); }
146 _LIBCPP_HIDE_FROM_ABI result_type __eval2(false_type) { return __eval(__uratio<__k / 2, 0x8000000000000000ull>()); }
147 _LIBCPP_HIDE_FROM_ABI result_type __eval2(true_type) { return __evalf<__k, 0>(); }
176 template <class _Engine, size_t __k>
[all...]
H A Dindependent_bits_engine.h156 for (size_t __k = 0; __k < __n0; ++__k) {
163 for (size_t __k = __n0; __k < __n; ++__k) {
203 for (size_t __k = 0; __k < __n0; ++__k) __eval() local
212 for (size_t __k = __n0; __k < __n; ++__k) __eval() local
H A Duniform_int_distribution.h111 for (size_t __k = 0; __k < __n0_; ++__k) {
122 for (size_t __k = __n0_; __k < __n_; ++__k) { in __eval()
126 for (size_t __k = 0; __k < __n0_; ++__k) __eval() local
139 for (size_t __k = __n0_; __k < __n_; ++__k) __eval() local
H A Dgenerate_canonical.h38 const size_t __k = __b / __log_r + (__b % __log_r != 0) + (__b == 0); in generate_canonical()
42 for (size_t __i = 1; __i < __k; ++__i, __base *= __rp) in generate_canonical()
40 const size_t __k = __b / __log_r + (__b % __log_r != 0) + (__b == 0); generate_canonical() local
H A Dpiecewise_linear_distribution.h246 ptrdiff_t __k = std::upper_bound(__p.__areas_.begin(), __p.__areas_.end(), __u) - __p.__areas_.begin() - 1;
247 __u -= __p.__areas_[__k]; in param_type()
248 const result_type __dk = __p.__densities_[__k]; in param_type()
249 const result_type __dk1 = __p.__densities_[__k + 1]; in param_type()
251 const result_type __bk = __p.__b_[__k]; in param_type()
254 const result_type __bk1 = __p.__b_[__k + 1]; in param_type()
297 ptrdiff_t __k = _VSTD::upper_bound(__p.__areas_.begin(), __p.__areas_.end(), operator() local
H A Ddiscrete_distribution.h134 for (size_t __k = 0; __k < __nw; ++__k)
135 __p_.push_back(__fw(__xmin + __k * __d + __d2));
169 for (size_t __k = 0; __k < __nw; ++__k) param_type() local
H A Dsubtract_with_carry_engine.h168 const unsigned __k = 1;
169 uint32_t __ar[__r * __k];
170 __q.generate(__ar, __ar + __r * __k);
180 const unsigned __k = 2; in seed()
181 uint32_t __ar[__r * __k]; in seed()
182 __q.generate(__ar, __ar + __r * __k); in seed()
214 const unsigned __k = 1; __seed() local
229 const unsigned __k = 2; __seed() local
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dsample.h44 _Distance __k = 0; in __sample()
45 for (; __first != __last && __k < __n; ++__first, (void)++__k) in __sample()
46 __output_iter[__k] = *__first; in __sample()
47 _Distance __sz = __k; in __sample()
48 for (; __first != __last; ++__first, (void)++__k) { in __sample()
49 _Distance __r = uniform_int_distribution<_Distance>(0, __k)(__g); in __sample()
53 return __output_iter + std::min(__n, __k);
41 _Distance __k = 0; __sample() local
H A Dsort.h296 _BidirectionalIterator __k = __j;
299 *__j = _Ops::__iter_move(__k);
300 __j = __k;
301 } while (__j != __first && __comp(__t, *--__k));
326 _RandomAccessIterator __k = __j;
329 *__j = _Ops::__iter_move(__k);
330 __j = __k;
332 __k != __leftmost,
334 } while (__comp(__t, *--__k)); // No need for bounds check due to the assumption stated above.
379 _RandomAccessIterator __k = __j;
[all …]
/freebsd/contrib/llvm-project/libcxx/include/
H A Dmap1151 _LIBCPP_HIDE_FROM_ABI mapped_type& operator[](const key_type& __k);
1153 _LIBCPP_HIDE_FROM_ABI mapped_type& operator[](key_type&& __k);
1156 _LIBCPP_HIDE_FROM_ABI mapped_type& at(const key_type& __k);
1157 _LIBCPP_HIDE_FROM_ABI const mapped_type& at(const key_type& __k) const;
1223 _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> try_emplace(const key_type& __k, _Args&&... __args) {
1225 __k,
1227 std::forward_as_tuple(__k),
1232 _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> try_emplace(key_type&& __k, _Args&&... __args) {
1234 __k,
1236 std::forward_as_tuple(std::move(__k)),
[all …]
H A Dset766 _LIBCPP_HIDE_FROM_ABI size_type erase(const key_type& __k) { return __tree_.__erase_unique(__k); }
820 _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __tree_.find(__k); }
821 _LIBCPP_HIDE_FROM_ABI const_iterator find(const key_type& __k) const { return __tree_.find(__k); }
824 _LIBCPP_HIDE_FROM_ABI iterator find(const _K2& __k) {
825 return __tree_.find(__k);
828 _LIBCPP_HIDE_FROM_ABI const_iterator find(const _K2& __k) const {
829 return __tree_.find(__k);
833 …LIBCPP_HIDE_FROM_ABI size_type count(const key_type& __k) const { return __tree_.__count_unique(__…
836 _LIBCPP_HIDE_FROM_ABI size_type count(const _K2& __k) const {
837 return __tree_.__count_multi(__k);
[all …]
H A Dunordered_map1267 _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> try_emplace(const key_type& __k, _Args&&... __args) {
1269 …__k, piecewise_construct, std::forward_as_tuple(__k), std::forward_as_tuple(std::forward<_Args>(__…
1273 _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> try_emplace(key_type&& __k, _Args&&... __args) {
1275 __k,
1277 std::forward_as_tuple(std::move(__k)),
1282 …_LIBCPP_HIDE_FROM_ABI iterator try_emplace(const_iterator, const key_type& __k, _Args&&... __args)…
1283 return try_emplace(__k, std::forward<_Args>(__args)...).first;
1287 _LIBCPP_HIDE_FROM_ABI iterator try_emplace(const_iterator, key_type&& __k, _Args&&... __args) {
1288 return try_emplace(std::move(__k), std::forward<_Args>(__args)...).first;
1292 _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> insert_or_assign(const key_type& __k, _Vp&& __v) {
[all …]
H A Dunordered_set778 …_LIBCPP_HIDE_FROM_ABI size_type erase(const key_type& __k) { return __table_.__erase_unique(__k); }
835 _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __table_.find(__k); }
836 …_LIBCPP_HIDE_FROM_ABI const_iterator find(const key_type& __k) const { return __table_.find(__k); }
839 _LIBCPP_HIDE_FROM_ABI iterator find(const _K2& __k) {
840 return __table_.find(__k);
843 _LIBCPP_HIDE_FROM_ABI const_iterator find(const _K2& __k) const {
844 return __table_.find(__k);
848 …LIBCPP_HIDE_FROM_ABI size_type count(const key_type& __k) const { return __table_.__count_unique(_…
851 _LIBCPP_HIDE_FROM_ABI size_type count(const _K2& __k) const {
852 return __table_.__count_unique(__k);
[all …]
H A D__hash_table790 …_LIBCPP_HIDE_FROM_ABI pair<iterator, bool> __emplace_unique_key_args(_Key const& __k, _Args&&... _…
892 _LIBCPP_HIDE_FROM_ABI size_type bucket(const _Key& __k) const {
895 return std::__constrain_hash(hash_function()(__k), bucket_count());
909 _LIBCPP_HIDE_FROM_ABI size_type __erase_unique(const _Key& __k);
911 _LIBCPP_HIDE_FROM_ABI size_type __erase_multi(const _Key& __k);
915 _LIBCPP_HIDE_FROM_ABI size_type __count_unique(const _Key& __k) const;
917 _LIBCPP_HIDE_FROM_ABI size_type __count_multi(const _Key& __k) const;
920 _LIBCPP_HIDE_FROM_ABI pair<iterator, iterator> __equal_range_unique(const _Key& __k);
922 …_LIBCPP_HIDE_FROM_ABI pair<const_iterator, const_iterator> __equal_range_unique(const _Key& __k) c…
925 _LIBCPP_HIDE_FROM_ABI pair<iterator, iterator> __equal_range_multi(const _Key& __k);
[all …]
H A D__tree1173 _LIBCPP_HIDE_FROM_ABI size_type __erase_unique(const _Key& __k);
1175 _LIBCPP_HIDE_FROM_ABI size_type __erase_multi(const _Key& __k);
1186 _LIBCPP_HIDE_FROM_ABI size_type __count_unique(const _Key& __k) const;
1188 _LIBCPP_HIDE_FROM_ABI size_type __count_multi(const _Key& __k) const;
1217 _LIBCPP_HIDE_FROM_ABI pair<iterator, iterator> __equal_range_unique(const _Key& __k);
1219 …_LIBCPP_HIDE_FROM_ABI pair<const_iterator, const_iterator> __equal_range_unique(const _Key& __k) c…
1222 _LIBCPP_HIDE_FROM_ABI pair<iterator, iterator> __equal_range_multi(const _Key& __k);
1224 …_LIBCPP_HIDE_FROM_ABI pair<const_iterator, const_iterator> __equal_range_multi(const _Key& __k) co…
1773 __tree<_Tp, _Compare, _Allocator>::__emplace_unique_key_args(_Key const& __k, _Args&&... __args) {
1775 __node_base_pointer& __child = __find_equal(__parent, __k);
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__functional/
H A Dboyer_moore_searcher.h163 difference_type __k = __skip_table[__current[__j - 1]];
164 difference_type __m = __j - __k - 1; in __search()
165 if (__k < __j && __m > __suffix_[__j]) in __search()
179 size_t __k = 0; in __search()
182 while (__k > 0 && !__pred(__first[__k], __first[__i])) in __search()
183 __k = __prefix[__k - 1]; in __search()
185 if (__pred(__first[__k], __first[__i])) in __search()
186 ++__k;
177 difference_type __k = __skip_table[__current[__j - 1]]; __search() local
193 size_t __k = 0; __compute_bm_prefix() local
223 const difference_type __k = __i - __scratch[__i] + 1; __build_suffix_table() local
[all...]
/freebsd/contrib/llvm-project/libcxx/include/ext/
H A Dhash_set286 …_LIBCPP_HIDE_FROM_ABI size_type erase(const key_type& __k) { return __table_.__erase_unique(__k); }
295 _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __table_.find(__k); }
296 …_LIBCPP_HIDE_FROM_ABI const_iterator find(const key_type& __k) const { return __table_.find(__k); }
297 …LIBCPP_HIDE_FROM_ABI size_type count(const key_type& __k) const { return __table_.__count_unique(_…
298 _LIBCPP_HIDE_FROM_ABI std::pair<iterator, iterator> equal_range(const key_type& __k) {
299 return __table_.__equal_range_unique(__k);
301 …_LIBCPP_HIDE_FROM_ABI std::pair<const_iterator, const_iterator> equal_range(const key_type& __k) c…
302 return __table_.__equal_range_unique(__k);
464 _LIBCPP_HIDE_FROM_ABI size_type erase(const key_type& __k) { return __table_.__erase_multi(__k); }
473 _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __table_.find(__k); }
[all …]
H A Dhash_map527 …_LIBCPP_HIDE_FROM_ABI size_type erase(const key_type& __k) { return __table_.__erase_unique(__k); }
538 _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __table_.find(__k); }
539 …_LIBCPP_HIDE_FROM_ABI const_iterator find(const key_type& __k) const { return __table_.find(__k); }
540 …LIBCPP_HIDE_FROM_ABI size_type count(const key_type& __k) const { return __table_.__count_unique(_…
541 _LIBCPP_HIDE_FROM_ABI std::pair<iterator, iterator> equal_range(const key_type& __k) {
542 return __table_.__equal_range_unique(__k);
544 …_LIBCPP_HIDE_FROM_ABI std::pair<const_iterator, const_iterator> equal_range(const key_type& __k) c…
545 return __table_.__equal_range_unique(__k);
548 _LIBCPP_HIDE_FROM_ABI mapped_type& operator[](const key_type& __k);
558 _LIBCPP_HIDE_FROM_ABI __node_holder __construct_node(const key_type& __k);
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/
H A Dparallel_backend_tbb.h
/freebsd/contrib/llvm-project/libcxx/include/__pstl/cpu_algos/
H A Dfind_if.h53 const _DifferenceType __k = __result - __first; in __parallel_find()
54 for (_DifferenceType __old = __extremum; __comp(__k, __old); __old = __extremum) { in __parallel_find()
55 __extremum.compare_exchange_weak(__old, __k); in __parallel_find()
/freebsd/contrib/llvm-project/libcxx/src/ryu/
H A Dd2fixed.cpp360 for (uint32_t __k = 0; __k < 9 - __maximum; ++__k) { in __d2fixed_buffered_n() local
564 for (uint32_t __k = 0; __k < __availableDigits - __maximum; ++__k) { in __d2exp_buffered_n() local

12