Home
last modified time | relevance | path

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

12

/llvm-project-15.0.7/pstl/include/pstl/internal/omp/
H A Dparallel_scan.h25 _Index __k = 1; in __split() local
26 while (2 * __k < __m) in __split()
27 __k *= 2; in __split()
28 return __k; in __split()
39 _Index __k = __split(__m); in __upsweep() local
43 …__omp_backend::__upsweep(__i + __k, __m - __k, __tilesize, __r + __k, __lastsize, __reduce, __comb… in __upsweep()
45 if (__m == 2 * __k) in __upsweep()
66 __omp_backend::__downsweep(__i + __k, __m - __k, __tilesize, __r + __k, __lastsize, in __downsweep()
86 std::size_t __k = __m + 1; in __parallel_strict_scan_body() local
87 _Tp __t = __r[__k - 1]; in __parallel_strict_scan_body()
[all …]
/llvm-project-15.0.7/libcxx/src/
H A Dvalarray.cpp25 size_t __k = __size_.size() != 0; in __init() local
27 __k *= __size_[__i]; in __init()
28 __1d_.resize(__k); in __init()
31 __k = 0; in __init()
32 __1d_[__k] = __start; in __init()
40 ++__k; in __init()
41 __1d_[__k] = __1d_[__k-1] + __stride_[__i]; in __init()
43 __1d_[__k] -= __stride_[__j] * (__size_[__j] - 1); in __init()
/llvm-project-15.0.7/libcxx/include/__random/
H A Dnegative_binomial_distribution.h45 explicit param_type(result_type __k = 1, double __p = 0.5)
46 : __k_(__k), __p_(__p) {} in __k_() argument
71 : __p_(__k, __p) {} in __p_() argument
74 explicit negative_binomial_distribution(result_type __k = 1,
76 : __p_(__k, __p) {}
122 result_type __k = __pr.k(); in operator() local
126 if (__k <= 21 * __p && sizeof(_IntType) > 1) in operator()
131 while (__s < __k) in operator()
171 result_type __k; variable
173 __is >> __k >> __p;
[all …]
H A Dseed_seq.h119 for (size_t __k = 1; __k <= __s; ++__k) in generate() local
132 __r += __kmodn + __v_[__k - 1]; in generate()
136 for (size_t __k = __s + 1; __k < __m; ++__k) in generate() local
153 for (size_t __k = __m; __k < __m + __n; ++__k) in generate() local
H A Dshuffle_order_engine.h53 template<class _Engine, size_t __k>
56 static_assert(0 < __k, "shuffle_order_engine invalid parameters");
63 result_type _V_[__k];
68 static _LIBCPP_CONSTEXPR const size_t table_size = __k;
159 for (size_t __i = 0; __i < __k; ++__i)
165 result_type __eval(false_type) {return __eval2(integral_constant<bool, __k & 1>());}
167 result_type __eval(true_type) {return __eval(__uratio<__k, _Rp>());}
170 result_type __eval2(false_type) {return __eval(__uratio<__k/2, 0x8000000000000000ull>());}
172 result_type __eval2(true_type) {return __evalf<__k, 0>();}
214 template<class _Engine, size_t __k>
[all …]
H A Duniform_int_distribution.h130 for (size_t __k = 0; __k < __n0_; ++__k) in __eval() local
143 for (size_t __k = __n0_; __k < __n_; ++__k) in __eval() local
H A Dindependent_bits_engine.h204 for (size_t __k = 0; __k < __n0; ++__k) in __eval() local
213 for (size_t __k = __n0; __k < __n; ++__k) in __eval() local
H A Dgenerate_canonical.h40 const size_t __k = __b / __logR + (__b % __logR != 0) + (__b == 0); in generate_canonical() local
44 for (size_t __i = 1; __i < __k; ++__i, __base *= _Rp) in generate_canonical()
H A Dpiecewise_linear_distribution.h296 ptrdiff_t __k = _VSTD::upper_bound(__p.__areas_.begin(), __p.__areas_.end(), in operator() local
298 __u -= __p.__areas_[__k]; in operator()
299 const result_type __dk = __p.__densities_[__k]; in operator()
300 const result_type __dk1 = __p.__densities_[__k+1]; in operator()
302 const result_type __bk = __p.__b_[__k]; in operator()
305 const result_type __bk1 = __p.__b_[__k+1]; in operator()
H A Ddiscrete_distribution.h168 for (size_t __k = 0; __k < __nw; ++__k) in param_type() local
169 __p_.push_back(__fw(__xmin + __k * __d + __d2)); in param_type()
H A Dlinear_congruential_engine.h338 const unsigned __k = 1;
339 uint32_t __ar[__k+3];
340 __q.generate(__ar, __ar + __k + 3);
351 const unsigned __k = 2;
352 uint32_t __ar[__k+3];
353 __q.generate(__ar, __ar + __k + 3);
/llvm-project-15.0.7/libcxx/include/__algorithm/
H A Dsample.h41 _Distance __k = 0; in __sample() local
42 for (; __first != __last && __k < __n; ++__first, (void) ++__k) in __sample()
43 __output_iter[__k] = *__first; in __sample()
44 _Distance __sz = __k; in __sample()
45 for (; __first != __last; ++__first, (void) ++__k) { in __sample()
46 _Distance __r = uniform_int_distribution<_Distance>(0, __k)(__g); in __sample()
50 return __output_iter + _VSTD::min(__n, __k); in __sample()
H A Dsort.h304 for (_BidirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j)
305 *__j = _Ops::__iter_move(__k);
322 _RandomAccessIterator __k = __j;
325 *__j = _Ops::__iter_move(__k);
326 __j = __k;
327 } while (__j != __first && __comp(__t, *--__k));
374 _RandomAccessIterator __k = __j;
377 *__j = _Ops::__iter_move(__k);
378 __j = __k;
379 } while (__j != __first && __comp(__t, *--__k));
/llvm-project-15.0.7/libcxx/include/
H A Dmap1348 __h.__i_, __k, __k, _VSTD::forward<_Vp>(__v));
1361 __h.__i_, __k, _VSTD::move(__k), _VSTD::forward<_Vp>(__v));
1472 count(const _K2& __k) const {return __tree_.__count_multi(__k);}
1481 contains(const _K2& __k) const { return find(__k) != end(); }
1494 lower_bound(const _K2& __k) {return __tree_.lower_bound(__k);}
1499 lower_bound(const _K2& __k) const {return __tree_.lower_bound(__k);}
1512 upper_bound(const _K2& __k) {return __tree_.upper_bound(__k);}
1516 upper_bound(const _K2& __k) const {return __tree_.upper_bound(__k);}
2144 count(const _K2& __k) const {return __tree_.__count_multi(__k);}
2153 contains(const _K2& __k) const { return find(__k) != end(); }
[all …]
H A Dset868 bool contains(const key_type& __k) const {return find(__k) != end();}
872 contains(const _K2& __k) const { return find(__k) != end(); }
885 lower_bound(const _K2& __k) {return __tree_.lower_bound(__k);}
890 lower_bound(const _K2& __k) const {return __tree_.lower_bound(__k);}
903 upper_bound(const _K2& __k) {return __tree_.upper_bound(__k);}
907 upper_bound(const _K2& __k) const {return __tree_.upper_bound(__k);}
1404 contains(const _K2& __k) const { return find(__k) != end(); }
1417 lower_bound(const _K2& __k) {return __tree_.lower_bound(__k);}
1422 lower_bound(const _K2& __k) const {return __tree_.lower_bound(__k);}
1435 upper_bound(const _K2& __k) {return __tree_.upper_bound(__k);}
[all …]
H A Dunordered_map1360 size_type erase(const key_type& __k) {return __table_.__erase_unique(__k);}
1443 iterator find(const key_type& __k) {return __table_.find(__k);}
1445 const_iterator find(const key_type& __k) const {return __table_.find(__k);}
1449 iterator find(const _K2& __k) {return __table_.find(__k);}
1452 const_iterator find(const _K2& __k) const {return __table_.find(__k);}
1465 bool contains(const key_type& __k) const {return find(__k) != end();}
1469 bool contains(const _K2& __k) const {return find(__k) != end();}
1506 size_type bucket(const key_type& __k) const {return __table_.bucket(__k);}
2143 size_type erase(const key_type& __k) {return __table_.__erase_multi(__k);}
2248 bool contains(const key_type& __k) const {return find(__k) != end();}
[all …]
H A Dunordered_set705 size_type erase(const key_type& __k) {return __table_.__erase_unique(__k);}
785 iterator find(const key_type& __k) {return __table_.find(__k);}
787 const_iterator find(const key_type& __k) const {return __table_.find(__k);}
791 iterator find(const _K2& __k) {return __table_.find(__k);}
794 const_iterator find(const _K2& __k) const {return __table_.find(__k);}
807 bool contains(const key_type& __k) const {return find(__k) != end();}
811 bool contains(const _K2& __k) const {return find(__k) != end();}
839 size_type bucket(const key_type& __k) const {return __table_.bucket(__k);}
1405 size_type erase(const key_type& __k) {return __table_.__erase_multi(__k);}
1445 bool contains(const key_type& __k) const {return find(__k) != end();}
[all …]
H A D__hash_table2432 iterator __i = find(__k);
2445 iterator __i = find(__k);
2524 const_iterator __i = find(__k);
2542 const _Key& __k)
2544 iterator __i = find(__k);
2556 const _Key& __k) const
2558 const_iterator __i = find(__k);
2570 const _Key& __k)
2572 iterator __i = find(__k);
2590 const _Key& __k) const
[all …]
/llvm-project-15.0.7/libcxx/include/__functional/
H A Dboyer_moore_searcher.h176 difference_type __m = __j - __k - 1; in __search()
177 if (__k < __j && __m > __suffix_[__j]) in __search()
190 size_t __k = 0; in __compute_bm_prefix() local
193 while (__k > 0 && !__pred(__first[__k], __first[__i])) in __compute_bm_prefix()
194 __k = __prefix[__k - 1]; in __compute_bm_prefix()
196 if (__pred(__first[__k], __first[__i])) in __compute_bm_prefix()
197 ++__k; in __compute_bm_prefix()
198 __prefix[__i] = __k; in __compute_bm_prefix()
219 const difference_type __k = __i - __scratch[__i] + 1; in __build_suffix_table() local
221 if (__suffix_[__j] > __k) in __build_suffix_table()
[all …]
/llvm-project-15.0.7/libcxx/include/ext/
H A Dhash_set299 size_type erase(const key_type& __k) {return __table_.__erase_unique(__k);}
315 iterator find(const key_type& __k) {return __table_.find(__k);}
317 const_iterator find(const key_type& __k) const {return __table_.find(__k);}
319 size_type count(const key_type& __k) const {return __table_.__count_unique(__k);}
322 {return __table_.__equal_range_unique(__k);}
519 size_type erase(const key_type& __k) {return __table_.__erase_multi(__k);}
535 iterator find(const key_type& __k) {return __table_.find(__k);}
537 const_iterator find(const key_type& __k) const {return __table_.find(__k);}
539 size_type count(const key_type& __k) const {return __table_.__count_multi(__k);}
542 {return __table_.__equal_range_multi(__k);}
[all …]
H A Dhash_map566 size_type erase(const key_type& __k) {return __table_.__erase_unique(__k);}
584 iterator find(const key_type& __k) {return __table_.find(__k);}
586 const_iterator find(const key_type& __k) const {return __table_.find(__k);}
588 size_type count(const key_type& __k) const {return __table_.__count_unique(__k);}
596 mapped_type& operator[](const key_type& __k);
698 iterator __i = find(__k);
701 __node_holder __h = __construct_node(__k);
837 size_type erase(const key_type& __k) {return __table_.__erase_multi(__k);}
855 iterator find(const key_type& __k) {return __table_.find(__k);}
857 const_iterator find(const key_type& __k) const {return __table_.find(__k);}
[all …]
/llvm-project-15.0.7/libcxx/include/experimental/
H A Dfunctional267 difference_type __k = __skip[__cur [ __j - 1 ]];
268 difference_type __m = __j - __k - 1;
269 if (__k < __j && __m > __suffix[ __j ])
285 size_t __k = 0;
288 while ( __k > 0 && !__pred ( __f[__k], __f[__i] ))
289 __k = __prefix [ __k - 1 ];
291 if ( __pred ( __f[__k], __f[__i] ))
292 __k++;
293 __prefix [ __i ] = __k;
318 if (__suffix[__j] > __k)
[all …]
/llvm-project-15.0.7/pstl/include/pstl/internal/
H A Dparallel_backend_tbb.h294 _Index __k = 1; in __split() local
295 while (2 * __k < __m) in __split()
296 __k *= 2; in __split()
297 return __k; in __split()
312 _Index __k = __split(__m); in __upsweep() local
316 …__tbb_backend::__upsweep(__i + __k, __m - __k, __tilesize, __r + __k, __lastsize, __reduce, __comb… in __upsweep()
318 if (__m == 2 * __k) in __upsweep()
338 __tbb_backend::__downsweep(__i + __k, __m - __k, __tilesize, __r + __k, __lastsize, in __downsweep()
379 size_t __k = __m + 1; in __parallel_strict_scan()
380 _Tp __t = __r[__k - 1]; in __parallel_strict_scan()
[all …]
H A Dparallel_impl.h52 const _DifferenceType __k = __res - __first; in __parallel_find()
53 … for (_DifferenceType __old = __extremum; __comp(__k, __old); in __parallel_find()
56 __extremum.compare_exchange_weak(__old, __k); in __parallel_find()
/llvm-project-15.0.7/libcxx/benchmarks/
H A Dunordered_set_operations.bench.cpp86 uint32_t __k = data; in operator ()() local
87 __k *= __m; in operator ()()
88 __k ^= __k >> __r; in operator ()()
89 __k *= __m; in operator ()()
91 __h ^= __k; in operator ()()

12