Home
last modified time | relevance | path

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

12

/freebsd/contrib/llvm-project/libcxx/src/
H A Dvalarray.cpp23 size_t __k = __size_.size() != 0; in __init() local
25 __k *= __size_[__i]; in __init()
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.h44 …_LIBCPP_HIDE_FROM_ABI explicit param_type(result_type __k = 1, double __p = 0.5) : __k_(__k), __p_… in __k_() argument
62 …ROM_ABI explicit negative_binomial_distribution(result_type __k, double __p = 0.5) : __p_(__k, __p… in __p_() argument
64 …_LIBCPP_HIDE_FROM_ABI explicit negative_binomial_distribution(result_type __k = 1, double __p = 0.…
65 : __p_(__k, __p) {}
102 result_type __k = __pr.k(); in operator() local
106 if (__k <= 21 * __p && sizeof(_IntType) > 1) { in operator()
110 while (__s < __k) { in operator()
121 …return poisson_distribution<result_type>(gamma_distribution<double>(__k, (1 - __p) / __p)(__urng))… in operator()
144 result_type __k; variable
146 __is >> __k >> __p;
[all …]
H A Dseed_seq.h105 for (size_t __k = 1; __k <= __s; ++__k) { in generate() local
117 __r += __kmodn + __v_[__k - 1]; in generate()
121 for (size_t __k = __s + 1; __k < __m; ++__k) { in generate() local
137 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 …
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, 0x80000000…
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) { in __eval() local
163 for (size_t __k = __n0; __k < __n; ++__k) { in __eval() local
H A Duniform_int_distribution.h111 for (size_t __k = 0; __k < __n0_; ++__k) { in __eval() local
122 for (size_t __k = __n0_; __k < __n_; ++__k) { in __eval() local
H A Dgenerate_canonical.h38 const size_t __k = __b / __log_r + (__b % __log_r != 0) + (__b == 0); in generate_canonical() local
42 for (size_t __i = 1; __i < __k; ++__i, __base *= __rp) in generate_canonical()
H A Dpiecewise_linear_distribution.h246 …ptrdiff_t __k = std::upper_bound(__p.__areas_.begin(), __p.__areas_.end(), __u) - __p.__areas_.b… in operator() local
247 __u -= __p.__areas_[__k]; in operator()
248 const result_type __dk = __p.__densities_[__k]; in operator()
249 const result_type __dk1 = __p.__densities_[__k + 1]; in operator()
251 const result_type __bk = __p.__b_[__k]; in operator()
254 const result_type __bk1 = __p.__b_[__k + 1]; in operator()
H A Ddiscrete_distribution.h134 for (size_t __k = 0; __k < __nw; ++__k) in param_type() local
135 __p_.push_back(__fw(__xmin + __k * __d + __d2)); in param_type()
H A Dlinear_congruential_engine.h279 const unsigned __k = 1;
280 uint32_t __ar[__k + 3];
281 __q.generate(__ar, __ar + __k + 3);
289 const unsigned __k = 2;
290 uint32_t __ar[__k + 3];
291 __q.generate(__ar, __ar + __k + 3);
H A Dsubtract_with_carry_engine.h168 const unsigned __k = 1; in __seed() local
169 uint32_t __ar[__r * __k]; in __seed()
170 __q.generate(__ar, __ar + __r * __k); in __seed()
180 const unsigned __k = 2; in __seed() local
181 uint32_t __ar[__r * __k]; in __seed()
182 __q.generate(__ar, __ar + __r * __k); in __seed()
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dsample.h44 _Distance __k = 0; in __sample() local
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); in __sample()
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,
379 _RandomAccessIterator __k = __j;
382 *__j = _Ops::__iter_move(__k);
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__functional/
H A Dboyer_moore_searcher.h164 difference_type __m = __j - __k - 1; in __search()
165 if (__k < __j && __m > __suffix_[__j]) in __search()
179 size_t __k = 0; in __compute_bm_prefix() local
182 while (__k > 0 && !__pred(__first[__k], __first[__i])) in __compute_bm_prefix()
183 __k = __prefix[__k - 1]; in __compute_bm_prefix()
185 if (__pred(__first[__k], __first[__i])) in __compute_bm_prefix()
186 ++__k; in __compute_bm_prefix()
187 __prefix[__i] = __k; in __compute_bm_prefix()
209 const difference_type __k = __i - __scratch[__i] + 1; in __build_suffix_table() local
211 if (__suffix_[__j] > __k) in __build_suffix_table()
[all …]
H A Dhash.h60 _Size __k = std::__loadword<_Size>(__data);
61 __k *= __m;
62 __k ^= __k >> __r;
63 __k *= __m;
65 __h ^= __k;
/freebsd/contrib/llvm-project/libcxx/include/
H A Dmap1230 __k,
1239 __k,
1250 __k,
1262 __k,
1367 _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __tree_.find(__k); }
1372 return __tree_.find(__k);
1376 return __tree_.find(__k);
1392 return find(__k) != end();
1959 _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __tree_.find(__k); }
1964 return __tree_.find(__k);
[all …]
H A Dset769 _LIBCPP_HIDE_FROM_ABI size_type erase(const key_type& __k) { return __tree_.__erase_unique(__k); }
825 _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __tree_.find(__k); }
830 return __tree_.find(__k);
834 return __tree_.find(__k);
847 _LIBCPP_HIDE_FROM_ABI bool contains(const key_type& __k) const { return find(__k) != end(); }
850 return find(__k) != end();
1283 _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __tree_.find(__k); }
1288 return __tree_.find(__k);
1292 return __tree_.find(__k);
1305 _LIBCPP_HIDE_FROM_ABI bool contains(const key_type& __k) const { return find(__k) != end(); }
[all …]
H A Dunordered_map1280 __k,
1384 _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __table_.find(__k); }
1390 return __table_.find(__k);
1395 return __table_.find(__k);
1414 return find(__k) != end();
1769 iterator __i = find(__k);
1782 iterator __i = find(__k);
2135 _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __table_.find(__k); }
2141 return __table_.find(__k);
2146 return __table_.find(__k);
[all …]
H A Dunordered_set839 _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __table_.find(__k); }
845 return __table_.find(__k);
850 return __table_.find(__k);
864 _LIBCPP_HIDE_FROM_ABI bool contains(const key_type& __k) const { return find(__k) != end(); }
869 return find(__k) != end();
896 _LIBCPP_HIDE_FROM_ABI size_type bucket(const key_type& __k) const { return __table_.bucket(__k); }
1442 _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __table_.find(__k); }
1448 return __table_.find(__k);
1453 return __table_.find(__k);
1467 _LIBCPP_HIDE_FROM_ABI bool contains(const key_type& __k) const { return find(__k) != end(); }
[all …]
H A D__hash_table1477 size_t __hash = hash_function()(__k);
1720 size_t __hash = hash_function()(__k);
1741 size_t __hash = hash_function()(__k);
1823 iterator __i = find(__k);
1835 iterator __i = find(__k);
1841 } while (__i != __e && key_eq()(*__i, __k));
1889 const_iterator __i = find(__k);
1905 iterator __i = find(__k);
1917 const_iterator __i = find(__k);
1929 iterator __i = find(__k);
[all …]
H A D__tree2067 iterator __i = find(__k);
2110 if (value_comp()(__k, __rt->__value_)) {
2112 } else if (value_comp()(__rt->__value_, __k))
2127 if (value_comp()(__k, __rt->__value_)) {
2130 } else if (value_comp()(__rt->__value_, __k))
2204 if (value_comp()(__k, __rt->__value_)) {
2207 } else if (value_comp()(__rt->__value_, __k))
2226 if (value_comp()(__k, __rt->__value_)) {
2229 } else if (value_comp()(__rt->__value_, __k))
2248 if (value_comp()(__k, __rt->__value_)) {
[all …]
/freebsd/contrib/llvm-project/libcxx/include/ext/
H A Dhash_set287 …_LIBCPP_HIDE_FROM_ABI size_type erase(const key_type& __k) { return __table_.__erase_unique(__k); }
296 _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __table_.find(__k); }
297 …_LIBCPP_HIDE_FROM_ABI const_iterator find(const key_type& __k) const { return __table_.find(__k); }
298 …LIBCPP_HIDE_FROM_ABI size_type count(const key_type& __k) const { return __table_.__count_unique(_…
300 return __table_.__equal_range_unique(__k);
465 _LIBCPP_HIDE_FROM_ABI size_type erase(const key_type& __k) { return __table_.__erase_multi(__k); }
474 _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __table_.find(__k); }
475 …_LIBCPP_HIDE_FROM_ABI const_iterator find(const key_type& __k) const { return __table_.find(__k); }
476 …LIBCPP_HIDE_FROM_ABI size_type count(const key_type& __k) const { return __table_.__count_multi(__…
478 return __table_.__equal_range_multi(__k);
[all …]
H A Dhash_map528 …_LIBCPP_HIDE_FROM_ABI size_type erase(const key_type& __k) { return __table_.__erase_unique(__k); }
539 _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __table_.find(__k); }
540 …_LIBCPP_HIDE_FROM_ABI const_iterator find(const key_type& __k) const { return __table_.find(__k); }
541 …LIBCPP_HIDE_FROM_ABI size_type count(const key_type& __k) const { return __table_.__count_unique(_…
631 iterator __i = find(__k);
751 _LIBCPP_HIDE_FROM_ABI size_type erase(const key_type& __k) { return __table_.__erase_multi(__k); }
762 _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __table_.find(__k); }
763 …_LIBCPP_HIDE_FROM_ABI const_iterator find(const key_type& __k) const { return __table_.find(__k); }
764 …LIBCPP_HIDE_FROM_ABI size_type count(const key_type& __k) const { return __table_.__count_multi(__…
766 return __table_.__equal_range_multi(__k);
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/pstl_backends/cpu_backends/
H A Dfind_if.h52 const _DifferenceType __k = __result - __first; in __parallel_find()
53 for (_DifferenceType __old = __extremum; __comp(__k, __old); __old = __extremum) { in __parallel_find()
54 __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