Lines Matching refs:__k
1955 const unsigned __k = 1;
1956 uint32_t __ar[__k+3];
1957 __q.generate(__ar, __ar + __k + 3);
1968 const unsigned __k = 2;
1969 uint32_t __ar[__k+3];
1970 __q.generate(__ar, __ar + __k + 3);
2324 const unsigned __k = 1;
2325 uint32_t __ar[__n * __k];
2326 __q.generate(__ar, __ar + __n * __k);
2349 const unsigned __k = 2;
2350 uint32_t __ar[__n * __k];
2351 __q.generate(__ar, __ar + __n * __k);
2378 const size_t __k = (__i_ + __m) % __n;
2379 __x_[__i_] = __x_[__k] ^ __rshift<1>(_Yp) ^ (__a * (_Yp & 1));
2676 const unsigned __k = 1;
2677 uint32_t __ar[__r * __k];
2678 __q.generate(__ar, __ar + __r * __k);
2691 const unsigned __k = 2;
2692 uint32_t __ar[__r * __k];
2693 __q.generate(__ar, __ar + __r * __k);
3159 for (size_t __k = 0; __k < __n0; ++__k)
3168 for (size_t __k = __n0; __k < __n; ++__k)
3248 template<class _Engine, size_t __k>
3251 static_assert(0 < __k, "shuffle_order_engine invalid parameters");
3258 result_type _V_[__k];
3263 static _LIBCPP_CONSTEXPR const size_t table_size = __k;
3354 for (size_t __i = 0; __i < __k; ++__i)
3360 result_type __eval(false_type) {return __eval2(integral_constant<bool, __k & 1>());}
3362 result_type __eval(true_type) {return __eval(__uratio<__k, _Rp>());}
3365 result_type __eval2(false_type) {return __eval(__uratio<__k/2, 0x8000000000000000ull>());}
3367 result_type __eval2(true_type) {return __evalf<__k, 0>();}
3409 template<class _Engine, size_t __k>
3410 _LIBCPP_CONSTEXPR const size_t shuffle_order_engine<_Engine, __k>::table_size;
3584 // __k = 0;
3593 for (size_t __k = 1; __k <= __s; ++__k)
3595 const size_t __kmodn = __k % __n;
3596 const size_t __kpmodn = (__k + __p) % __n;
3598 ^ __first[(__k - 1) % __n]);
3600 __r += __kmodn + __v_[__k-1];
3601 __first[(__k + __q) % __n] += __r;
3604 for (size_t __k = __s + 1; __k < __m; ++__k)
3606 const size_t __kmodn = __k % __n;
3607 const size_t __kpmodn = (__k + __p) % __n;
3609 ^ __first[(__k - 1) % __n]);
3612 __first[(__k + __q) % __n] += __r;
3615 for (size_t __k = __m; __k < __m + __n; ++__k)
3617 const size_t __kmodn = __k % __n;
3618 const size_t __kpmodn = (__k + __p) % __n;
3621 __first[(__k - 1) % __n]);
3624 __first[(__k + __q) % __n] ^= __r;
3643 const size_t __k = __b / __logR + (__b % __logR != 0) + (__b == 0);
3647 for (size_t __i = 1; __i < __k; ++__i, __base *= _Rp)
5144 explicit param_type(result_type __k = 1, double __p = 0.5)
5145 : __k_(__k), __p_(__p) {}
5166 explicit negative_binomial_distribution(result_type __k = 1, double __p = 0.5)
5167 : __p_(__k, __p) {}
5211 result_type __k = __pr.k();
5213 if (__k <= 21 * __p)
5218 while (__s < __k)
5228 (__k, (1-__p)/__p)(__urng))(__urng);
5254 result_type __k;
5256 __is >> __k >> __p;
5258 __x.param(param_type(__k, __p));
5967 for (size_t __k = 0; __k < __nw; ++__k)
5968 __p_.push_back(__fw(__xmin + __k * __d + __d2));
6321 ptrdiff_t __k = _VSTD::upper_bound(__p.__areas_.begin(), __p.__areas_.end(),
6323 return (__u - __p.__areas_[__k]) / __p.__densities_[__k] + __p.__b_[__k];
6650 ptrdiff_t __k = _VSTD::upper_bound(__p.__areas_.begin(), __p.__areas_.end(),
6652 __u -= __p.__areas_[__k];
6653 const result_type __dk = __p.__densities_[__k];
6654 const result_type __dk1 = __p.__densities_[__k+1];
6656 const result_type __bk = __p.__b_[__k];
6659 const result_type __bk1 = __p.__b_[__k+1];