Home
last modified time | relevance | path

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

123

/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.h113 for (size_t __k = 1; __k <= __s; ++__k) { in generate() local
125 __r += __kmodn + __v_[__k - 1]; in generate()
129 for (size_t __k = __s + 1; __k < __m; ++__k) { in generate() local
145 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 inline _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>(); }
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
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/__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
61 …_LIBCPP_HIDE_FROM_ABI explicit negative_binomial_distribution(result_type __k = 1, double __p = 0.…
62 : __p_(__k, __p) {} in __p_() argument
98 result_type __k = __pr.k(); in operator() local
102 if (__k <= 21 * __p && sizeof(_IntType) > 1) { in operator()
106 while (__s < __k) { in operator()
117 …return poisson_distribution<result_type>(gamma_distribution<double>(__k, (1 - __p) / __p)(__urng))… in operator()
140 result_type __k; variable
142 __is >> __k >> __p;
144 __x.param(param_type(__k, __p));
H A Dseed_seq.h104 for (size_t __k = 1; __k <= __s; ++__k) { in generate() local
116 __r += __kmodn + __v_[__k - 1]; in generate()
120 for (size_t __k = __s + 1; __k < __m; ++__k) { in generate() local
136 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 const size_t table_size = __k;
130 for (size_t __i = 0; __i < __k; ++__i)
135 …_LIBCPP_HIDE_FROM_ABI result_type __eval(false_type) { return __eval2(integral_constant<bool, __k …
136 _LIBCPP_HIDE_FROM_ABI result_type __eval(true_type) { return __eval(__uratio<__k, _Rp>()); }
138 …_LIBCPP_HIDE_FROM_ABI result_type __eval2(false_type) { return __eval(__uratio<__k / 2, 0x80000000…
139 _LIBCPP_HIDE_FROM_ABI result_type __eval2(true_type) { return __evalf<__k, 0>(); }
168 template <class _Engine, size_t __k>
[all …]
H A Dindependent_bits_engine.h148 for (size_t __k = 0; __k < __n0; ++__k) { in __eval() local
155 for (size_t __k = __n0; __k < __n; ++__k) { in __eval() local
H A Duniform_int_distribution.h107 for (size_t __k = 0; __k < __n0_; ++__k) { in __eval() local
118 for (size_t __k = __n0_; __k < __n_; ++__k) { in __eval() 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
/freebsd/contrib/llvm-project/libcxx/include/
H A Dmap1035 _LIBCPP_HIDE_FROM_ABI mapped_type& operator[](const key_type& __k);
1037 _LIBCPP_HIDE_FROM_ABI mapped_type& operator[](key_type&& __k);
1040 _LIBCPP_HIDE_FROM_ABI mapped_type& at(const key_type& __k);
1041 _LIBCPP_HIDE_FROM_ABI const mapped_type& at(const key_type& __k) const;
1107 _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> try_emplace(const key_type& __k, _Args&&... __args) {
1109 __k,
1111 std::forward_as_tuple(__k),
1116 _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> try_emplace(key_type&& __k, _Args&&... __args) {
1118 __k,
1120 std::forward_as_tuple(std::move(__k)),
[all …]
H A Dset773 _LIBCPP_HIDE_FROM_ABI size_type erase(const key_type& __k) { return __tree_.__erase_unique(__k); }
827 _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __tree_.find(__k); }
828 _LIBCPP_HIDE_FROM_ABI const_iterator find(const key_type& __k) const { return __tree_.find(__k); }
831 _LIBCPP_HIDE_FROM_ABI iterator find(const _K2& __k) {
832 return __tree_.find(__k);
835 _LIBCPP_HIDE_FROM_ABI const_iterator find(const _K2& __k) const {
836 return __tree_.find(__k);
840 …LIBCPP_HIDE_FROM_ABI size_type count(const key_type& __k) const { return __tree_.__count_unique(__…
843 _LIBCPP_HIDE_FROM_ABI size_type count(const _K2& __k) const {
844 return __tree_.__count_multi(__k);
[all …]
H A Dunordered_map1189 _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> try_emplace(const key_type& __k, _Args&&... __args) {
1191 …__k, piecewise_construct, std::forward_as_tuple(__k), std::forward_as_tuple(std::forward<_Args>(__…
1195 _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> try_emplace(key_type&& __k, _Args&&... __args) {
1197 __k,
1199 std::forward_as_tuple(std::move(__k)),
1204 …_LIBCPP_HIDE_FROM_ABI iterator try_emplace(const_iterator, const key_type& __k, _Args&&... __args)…
1205 return try_emplace(__k, std::forward<_Args>(__args)...).first;
1209 _LIBCPP_HIDE_FROM_ABI iterator try_emplace(const_iterator, key_type&& __k, _Args&&... __args) {
1210 return try_emplace(std::move(__k), std::forward<_Args>(__args)...).first;
1214 _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> insert_or_assign(const key_type& __k, _Vp&& __v) {
[all …]
H A Dunordered_set794 …_LIBCPP_HIDE_FROM_ABI size_type erase(const key_type& __k) { return __table_.__erase_unique(__k); }
851 _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __table_.find(__k); }
852 …_LIBCPP_HIDE_FROM_ABI const_iterator find(const key_type& __k) const { return __table_.find(__k); }
855 _LIBCPP_HIDE_FROM_ABI iterator find(const _K2& __k) {
856 return __table_.find(__k);
859 _LIBCPP_HIDE_FROM_ABI const_iterator find(const _K2& __k) const {
860 return __table_.find(__k);
864 …LIBCPP_HIDE_FROM_ABI size_type count(const key_type& __k) const { return __table_.__count_unique(_…
867 _LIBCPP_HIDE_FROM_ABI size_type count(const _K2& __k) const {
868 return __table_.__count_unique(__k);
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__functional/
H A Dboyer_moore_searcher.h162 difference_type __k = __skip_table[__current[__j - 1]]; in __search() local
163 difference_type __m = __j - __k - 1; in __search()
164 if (__k < __j && __m > __suffix_[__j]) in __search()
178 size_t __k = 0; in __compute_bm_prefix() local
181 while (__k > 0 && !__pred(__first[__k], __first[__i])) in __compute_bm_prefix()
182 __k = __prefix[__k - 1]; in __compute_bm_prefix()
184 if (__pred(__first[__k], __first[__i])) in __compute_bm_prefix()
185 ++__k; in __compute_bm_prefix()
186 __prefix[__i] = __k; in __compute_bm_prefix()
208 const difference_type __k = __i - __scratch[__i] + 1; in __build_suffix_table() local
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/
H A Dset649 _LIBCPP_HIDE_FROM_ABI size_type erase(const key_type& __k) { return __tree_.__erase_unique(__k); }
660 _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __tree_.find(__k); }
661 _LIBCPP_HIDE_FROM_ABI const_iterator find(const key_type& __k) const { return __tree_.find(__k); }
663 …LIBCPP_HIDE_FROM_ABI size_type count(const key_type& __k) const { return __tree_.__count_unique(__…
665 …_LIBCPP_HIDE_FROM_ABI iterator lower_bound(const key_type& __k) { return __tree_.lower_bound(__k);…
666 …DE_FROM_ABI const_iterator lower_bound(const key_type& __k) const { return __tree_.lower_bound(__k…
668 …_LIBCPP_HIDE_FROM_ABI iterator upper_bound(const key_type& __k) { return __tree_.upper_bound(__k);…
669 …DE_FROM_ABI const_iterator upper_bound(const key_type& __k) const { return __tree_.upper_bound(__k…
671 _LIBCPP_HIDE_FROM_ABI pair<iterator, iterator> equal_range(const key_type& __k) {
672 return __tree_.__equal_range_unique(__k);
[all …]
H A Dmap958 _LIBCPP_HIDE_FROM_ABI mapped_type& operator[](const key_type& __k);
960 _LIBCPP_HIDE_FROM_ABI mapped_type& at(const key_type& __k);
961 _LIBCPP_HIDE_FROM_ABI const mapped_type& at(const key_type& __k) const;
981 _LIBCPP_HIDE_FROM_ABI size_type erase(const key_type& __k) { return __tree_.__erase_unique(__k); }
989 _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __tree_.find(__k); }
990 _LIBCPP_HIDE_FROM_ABI const_iterator find(const key_type& __k) const { return __tree_.find(__k); }
992 …LIBCPP_HIDE_FROM_ABI size_type count(const key_type& __k) const { return __tree_.__count_unique(__…
994 …_LIBCPP_HIDE_FROM_ABI iterator lower_bound(const key_type& __k) { return __tree_.lower_bound(__k);…
995 …DE_FROM_ABI const_iterator lower_bound(const key_type& __k) const { return __tree_.lower_bound(__k…
997 …_LIBCPP_HIDE_FROM_ABI iterator upper_bound(const key_type& __k) { return __tree_.upper_bound(__k);…
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/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_map520 …_LIBCPP_HIDE_FROM_ABI size_type erase(const key_type& __k) { return __table_.__erase_unique(__k); }
531 _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __table_.find(__k); }
532 …_LIBCPP_HIDE_FROM_ABI const_iterator find(const key_type& __k) const { return __table_.find(__k); }
533 …LIBCPP_HIDE_FROM_ABI size_type count(const key_type& __k) const { return __table_.__count_unique(_…
534 _LIBCPP_HIDE_FROM_ABI std::pair<iterator, iterator> equal_range(const key_type& __k) {
535 return __table_.__equal_range_unique(__k);
537 …_LIBCPP_HIDE_FROM_ABI std::pair<const_iterator, const_iterator> equal_range(const key_type& __k) c…
538 return __table_.__equal_range_unique(__k);
541 _LIBCPP_HIDE_FROM_ABI mapped_type& operator[](const key_type& __k);
551 _LIBCPP_HIDE_FROM_ABI __node_holder __construct_node(const key_type& __k);
[all …]
/freebsd/contrib/llvm-project/libcxx/include/ext/
H A Dhash_set289 …_LIBCPP_HIDE_FROM_ABI size_type erase(const key_type& __k) { return __table_.__erase_unique(__k); }
298 _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __table_.find(__k); }
299 …_LIBCPP_HIDE_FROM_ABI const_iterator find(const key_type& __k) const { return __table_.find(__k); }
300 …LIBCPP_HIDE_FROM_ABI size_type count(const key_type& __k) const { return __table_.__count_unique(_…
301 _LIBCPP_HIDE_FROM_ABI std::pair<iterator, iterator> equal_range(const key_type& __k) {
302 return __table_.__equal_range_unique(__k);
304 …_LIBCPP_HIDE_FROM_ABI std::pair<const_iterator, const_iterator> equal_range(const key_type& __k) c…
305 return __table_.__equal_range_unique(__k);
467 _LIBCPP_HIDE_FROM_ABI size_type erase(const key_type& __k) { return __table_.__erase_multi(__k); }
476 _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __table_.find(__k); }
[all …]
H A Dhash_map530 …_LIBCPP_HIDE_FROM_ABI size_type erase(const key_type& __k) { return __table_.__erase_unique(__k); }
541 _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __table_.find(__k); }
542 …_LIBCPP_HIDE_FROM_ABI const_iterator find(const key_type& __k) const { return __table_.find(__k); }
543 …LIBCPP_HIDE_FROM_ABI size_type count(const key_type& __k) const { return __table_.__count_unique(_…
544 _LIBCPP_HIDE_FROM_ABI std::pair<iterator, iterator> equal_range(const key_type& __k) {
545 return __table_.__equal_range_unique(__k);
547 …_LIBCPP_HIDE_FROM_ABI std::pair<const_iterator, const_iterator> equal_range(const key_type& __k) c…
548 return __table_.__equal_range_unique(__k);
551 _LIBCPP_HIDE_FROM_ABI mapped_type& operator[](const key_type& __k);
561 _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

123