Home
last modified time | relevance | path

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

12345

/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/tr1/
H A Dgamma.tcc116 for (unsigned int __k = 1; __k <= __n; ++__k) in __bernoulli_series() local
117 __fact *= __k / (_Tp(2) * __numeric_constants<_Tp>::__pi()); in __bernoulli_series()
203 for(unsigned int __k = 1; __k < 9; ++__k) in __log_gamma_lanczos() local
204 __sum += __lanczos_cheb_7[__k] / (__xm1 + __k); in __log_gamma_lanczos()
285 __log_bincoef(unsigned int __n, unsigned int __k) in __log_bincoef() argument
293 - _GLIBCXX_MATH_NS::lgamma(_Tp(1 + __k)) in __log_bincoef()
294 - _GLIBCXX_MATH_NS::lgamma(_Tp(1 + __n - __k)); in __log_bincoef()
297 - __log_gamma(_Tp(1 + __k)) in __log_bincoef()
298 - __log_gamma(_Tp(1 + __n - __k)); in __log_bincoef()
316 __bincoef(unsigned int __n, unsigned int __k) in __bincoef() argument
[all …]
H A Dell_integral.tcc157 __comp_ellint_1_series(_Tp __k) in __comp_ellint_1_series() argument
160 const _Tp __kk = __k * __k; in __comp_ellint_1_series()
195 __comp_ellint_1(_Tp __k) in __comp_ellint_1() argument
198 if (__isnan(__k)) in __comp_ellint_1()
200 else if (std::abs(__k) >= _Tp(1)) in __comp_ellint_1()
203 return __ellint_rf(_Tp(0), _Tp(1) - __k * __k, _Tp(1)); in __comp_ellint_1()
223 __ellint_1(_Tp __k, _Tp __phi) in __ellint_1() argument
226 if (__isnan(__k) || __isnan(__phi)) in __ellint_1()
228 else if (std::abs(__k) > _Tp(1)) in __ellint_1()
243 _Tp(1) - __k * __k * __s * __s, _Tp(1)); in __ellint_1()
[all …]
H A Dpoly_laguerre.tcc140 for (unsigned int __k = 1; __k <= __n; ++__k) in __poly_laguerre_hyperg() local
141 __tc *= (__ax / __k); in __poly_laguerre_hyperg()
145 for (int __k = int(__n) - 1; __k >= 0; --__k) in __poly_laguerre_hyperg() local
147 __term *= ((__b + _Tp(__k)) / _Tp(int(__n) - __k)) in __poly_laguerre_hyperg()
148 * _Tp(__k + 1) / __mx; in __poly_laguerre_hyperg()
261 for (unsigned int __k = 2; __k <= __n; ++__k) in __poly_laguerre() local
262 __prod *= (_Tp(__alpha1) + _Tp(__k)) / _Tp(__k); in __poly_laguerre()
H A Dhashtable.h290 bucket(const key_type& __k) const in _GLIBCXX_VISIBILITY()
292 return this->_M_bucket_index(__k, this->_M_hash_code(__k), in _GLIBCXX_VISIBILITY()
331 find(const key_type& __k); in _GLIBCXX_VISIBILITY()
334 find(const key_type& __k) const; in _GLIBCXX_VISIBILITY()
337 count(const key_type& __k) const; in _GLIBCXX_VISIBILITY()
340 equal_range(const key_type& __k); in _GLIBCXX_VISIBILITY()
343 equal_range(const key_type& __k) const; in _GLIBCXX_VISIBILITY()
704 find(const key_type& __k) in _GLIBCXX_VISIBILITY()
706 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k); in _GLIBCXX_VISIBILITY()
707 std::size_t __n = this->_M_bucket_index(__k, __code, _M_bucket_count); in _GLIBCXX_VISIBILITY()
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/tr1/
H A Dgamma.tcc116 for (unsigned int __k = 1; __k <= __n; ++__k) in __bernoulli_series() local
117 __fact *= __k / (_Tp(2) * __numeric_constants<_Tp>::__pi()); in __bernoulli_series()
203 for(unsigned int __k = 1; __k < 9; ++__k) in __log_gamma_lanczos() local
204 __sum += __lanczos_cheb_7[__k] / (__xm1 + __k); in __log_gamma_lanczos()
285 __log_bincoef(unsigned int __n, unsigned int __k) in __log_bincoef() argument
293 - _GLIBCXX_MATH_NS::lgamma(_Tp(1 + __k)) in __log_bincoef()
294 - _GLIBCXX_MATH_NS::lgamma(_Tp(1 + __n - __k)); in __log_bincoef()
297 - __log_gamma(_Tp(1 + __k)) in __log_bincoef()
298 - __log_gamma(_Tp(1 + __n - __k)); in __log_bincoef()
316 __bincoef(unsigned int __n, unsigned int __k) in __bincoef() argument
[all …]
H A Dell_integral.tcc157 __comp_ellint_1_series(_Tp __k) in __comp_ellint_1_series() argument
160 const _Tp __kk = __k * __k; in __comp_ellint_1_series()
195 __comp_ellint_1(_Tp __k) in __comp_ellint_1() argument
198 if (__isnan(__k)) in __comp_ellint_1()
200 else if (std::abs(__k) >= _Tp(1)) in __comp_ellint_1()
203 return __ellint_rf(_Tp(0), _Tp(1) - __k * __k, _Tp(1)); in __comp_ellint_1()
223 __ellint_1(_Tp __k, _Tp __phi) in __ellint_1() argument
226 if (__isnan(__k) || __isnan(__phi)) in __ellint_1()
228 else if (std::abs(__k) > _Tp(1)) in __ellint_1()
243 _Tp(1) - __k * __k * __s * __s, _Tp(1)); in __ellint_1()
[all …]
H A Dpoly_laguerre.tcc140 for (unsigned int __k = 1; __k <= __n; ++__k) in __poly_laguerre_hyperg() local
141 __tc *= (__ax / __k); in __poly_laguerre_hyperg()
145 for (int __k = int(__n) - 1; __k >= 0; --__k) in __poly_laguerre_hyperg() local
147 __term *= ((__b + _Tp(__k)) / _Tp(int(__n) - __k)) in __poly_laguerre_hyperg()
148 * _Tp(__k + 1) / __mx; in __poly_laguerre_hyperg()
261 for (unsigned int __k = 2; __k <= __n; ++__k) in __poly_laguerre() local
262 __prod *= (_Tp(__alpha1) + _Tp(__k)) / _Tp(__k); in __poly_laguerre()
H A Dhashtable.h290 bucket(const key_type& __k) const in _GLIBCXX_VISIBILITY()
292 return this->_M_bucket_index(__k, this->_M_hash_code(__k), in _GLIBCXX_VISIBILITY()
331 find(const key_type& __k); in _GLIBCXX_VISIBILITY()
334 find(const key_type& __k) const; in _GLIBCXX_VISIBILITY()
337 count(const key_type& __k) const; in _GLIBCXX_VISIBILITY()
340 equal_range(const key_type& __k); in _GLIBCXX_VISIBILITY()
343 equal_range(const key_type& __k) const; in _GLIBCXX_VISIBILITY()
704 find(const key_type& __k) in _GLIBCXX_VISIBILITY()
706 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k); in _GLIBCXX_VISIBILITY()
707 std::size_t __n = this->_M_bucket_index(__k, __code, _M_bucket_count); in _GLIBCXX_VISIBILITY()
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/bits/
H A Dspecfun.h358 comp_ellint_1f(float __k) in _GLIBCXX_VISIBILITY()
359 { return __detail::__comp_ellint_1<float>(__k); } in _GLIBCXX_VISIBILITY()
368 comp_ellint_1l(long double __k) in _GLIBCXX_VISIBILITY()
369 { return __detail::__comp_ellint_1<long double>(__k); } in _GLIBCXX_VISIBILITY()
391 comp_ellint_1(_Tp __k) in _GLIBCXX_VISIBILITY()
394 return __detail::__comp_ellint_1<__type>(__k); in _GLIBCXX_VISIBILITY()
406 comp_ellint_2f(float __k) in _GLIBCXX_VISIBILITY()
407 { return __detail::__comp_ellint_2<float>(__k); } in _GLIBCXX_VISIBILITY()
416 comp_ellint_2l(long double __k) in _GLIBCXX_VISIBILITY()
417 { return __detail::__comp_ellint_2<long double>(__k); } in _GLIBCXX_VISIBILITY()
[all …]
H A Dstl_map.h492 operator[](const key_type& __k) in _GLIBCXX_VISIBILITY()
497 iterator __i = lower_bound(__k); in _GLIBCXX_VISIBILITY()
499 if (__i == end() || key_comp()(__k, (*__i).first)) in _GLIBCXX_VISIBILITY()
502 std::tuple<const key_type&>(__k), in _GLIBCXX_VISIBILITY()
505 __i = insert(__i, value_type(__k, mapped_type())); in _GLIBCXX_VISIBILITY()
512 operator[](key_type&& __k) in _GLIBCXX_VISIBILITY()
517 iterator __i = lower_bound(__k); in _GLIBCXX_VISIBILITY()
519 if (__i == end() || key_comp()(__k, (*__i).first)) in _GLIBCXX_VISIBILITY()
521 std::forward_as_tuple(std::move(__k)), in _GLIBCXX_VISIBILITY()
537 at(const key_type& __k) in _GLIBCXX_VISIBILITY()
[all …]
H A Dhashtable.h634 bucket(const key_type& __k) const in _GLIBCXX_VISIBILITY()
635 { return _M_bucket_index(__k, this->_M_hash_code(__k)); } in _GLIBCXX_VISIBILITY()
692 find(const key_type& __k); in _GLIBCXX_VISIBILITY()
695 find(const key_type& __k) const; in _GLIBCXX_VISIBILITY()
698 count(const key_type& __k) const; in _GLIBCXX_VISIBILITY()
701 equal_range(const key_type& __k); in _GLIBCXX_VISIBILITY()
704 equal_range(const key_type& __k) const; in _GLIBCXX_VISIBILITY()
713 _M_bucket_index(const key_type& __k, __hash_code __c) const in _GLIBCXX_VISIBILITY()
714 { return __hash_code_base::_M_bucket_index(__k, __c, _M_bucket_count); } in _GLIBCXX_VISIBILITY()
748 _M_insert_unique_node(const key_type& __k, size_type __bkt, in _GLIBCXX_VISIBILITY()
[all …]
H A Dstl_tree.h841 _M_get_insert_unique_pos(const key_type& __k); in _GLIBCXX_VISIBILITY()
844 _M_get_insert_equal_pos(const key_type& __k); in _GLIBCXX_VISIBILITY()
848 const key_type& __k); in _GLIBCXX_VISIBILITY()
852 const key_type& __k); in _GLIBCXX_VISIBILITY()
918 const _Key& __k); in _GLIBCXX_VISIBILITY()
922 const _Key& __k) const; in _GLIBCXX_VISIBILITY()
926 const _Key& __k); in _GLIBCXX_VISIBILITY()
930 const _Key& __k) const; in _GLIBCXX_VISIBILITY()
1269 find(const key_type& __k); in _GLIBCXX_VISIBILITY()
1272 find(const key_type& __k) const; in _GLIBCXX_VISIBILITY()
[all …]
H A Drandom.tcc138 const _UIntType __k = (__k0 + 31) / 32; in seed() local
139 uint_least32_t __arr[__k + 3]; in seed()
140 __q.generate(__arr + 0, __arr + __k + 3); in seed()
143 for (size_t __j = 0; __j < __k; ++__j) in seed()
355 const size_t __k = (__w + 31) / 32; in seed() local
356 uint_least32_t __arr[__n * __k]; in seed()
357 __q.generate(__arr + 0, __arr + __n * __k); in seed()
364 for (size_t __j = 0; __j < __k; ++__j) in seed()
366 __sum += __arr[__k * __i + __j] * __factor; in seed()
401 for (size_t __k = 0; __k < (__n - __m); ++__k) in _M_gen_rand() local
[all …]
H A Dvalarray_array.tcc115 _Array<_Tp> __b, _Array<bool> __k) in __valarray_copy() argument
120 bool* __dstok (__k._M_data); in __valarray_copy()
169 for (size_t __k = 0; __k < __n; ++__k, ++__j) in __valarray_copy() local
170 __a._M_data[*__j] = __e[__k]; in __valarray_copy()
183 for (size_t __k = 0; __k < __n; ++__k, ++__j, ++__g) in __valarray_copy() local
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/bits/
H A Dspecfun.h358 comp_ellint_1f(float __k) in _GLIBCXX_VISIBILITY()
359 { return __detail::__comp_ellint_1<float>(__k); } in _GLIBCXX_VISIBILITY()
368 comp_ellint_1l(long double __k) in _GLIBCXX_VISIBILITY()
369 { return __detail::__comp_ellint_1<long double>(__k); } in _GLIBCXX_VISIBILITY()
391 comp_ellint_1(_Tp __k) in _GLIBCXX_VISIBILITY()
394 return __detail::__comp_ellint_1<__type>(__k); in _GLIBCXX_VISIBILITY()
406 comp_ellint_2f(float __k) in _GLIBCXX_VISIBILITY()
407 { return __detail::__comp_ellint_2<float>(__k); } in _GLIBCXX_VISIBILITY()
416 comp_ellint_2l(long double __k) in _GLIBCXX_VISIBILITY()
417 { return __detail::__comp_ellint_2<long double>(__k); } in _GLIBCXX_VISIBILITY()
[all …]
H A Dstl_map.h492 operator[](const key_type& __k) in _GLIBCXX_VISIBILITY()
497 iterator __i = lower_bound(__k); in _GLIBCXX_VISIBILITY()
499 if (__i == end() || key_comp()(__k, (*__i).first)) in _GLIBCXX_VISIBILITY()
502 std::tuple<const key_type&>(__k), in _GLIBCXX_VISIBILITY()
505 __i = insert(__i, value_type(__k, mapped_type())); in _GLIBCXX_VISIBILITY()
512 operator[](key_type&& __k) in _GLIBCXX_VISIBILITY()
517 iterator __i = lower_bound(__k); in _GLIBCXX_VISIBILITY()
519 if (__i == end() || key_comp()(__k, (*__i).first)) in _GLIBCXX_VISIBILITY()
521 std::forward_as_tuple(std::move(__k)), in _GLIBCXX_VISIBILITY()
537 at(const key_type& __k) in _GLIBCXX_VISIBILITY()
[all …]
H A Dhashtable.h634 bucket(const key_type& __k) const in _GLIBCXX_VISIBILITY()
635 { return _M_bucket_index(__k, this->_M_hash_code(__k)); } in _GLIBCXX_VISIBILITY()
692 find(const key_type& __k); in _GLIBCXX_VISIBILITY()
695 find(const key_type& __k) const; in _GLIBCXX_VISIBILITY()
698 count(const key_type& __k) const; in _GLIBCXX_VISIBILITY()
701 equal_range(const key_type& __k); in _GLIBCXX_VISIBILITY()
704 equal_range(const key_type& __k) const; in _GLIBCXX_VISIBILITY()
713 _M_bucket_index(const key_type& __k, __hash_code __c) const in _GLIBCXX_VISIBILITY()
714 { return __hash_code_base::_M_bucket_index(__k, __c, _M_bucket_count); } in _GLIBCXX_VISIBILITY()
748 _M_insert_unique_node(const key_type& __k, size_type __bkt, in _GLIBCXX_VISIBILITY()
[all …]
H A Dstl_tree.h841 _M_get_insert_unique_pos(const key_type& __k); in _GLIBCXX_VISIBILITY()
844 _M_get_insert_equal_pos(const key_type& __k); in _GLIBCXX_VISIBILITY()
848 const key_type& __k); in _GLIBCXX_VISIBILITY()
852 const key_type& __k); in _GLIBCXX_VISIBILITY()
918 const _Key& __k); in _GLIBCXX_VISIBILITY()
922 const _Key& __k) const; in _GLIBCXX_VISIBILITY()
926 const _Key& __k); in _GLIBCXX_VISIBILITY()
930 const _Key& __k) const; in _GLIBCXX_VISIBILITY()
1269 find(const key_type& __k); in _GLIBCXX_VISIBILITY()
1272 find(const key_type& __k) const; in _GLIBCXX_VISIBILITY()
[all …]
H A Drandom.tcc138 const _UIntType __k = (__k0 + 31) / 32; in seed() local
139 uint_least32_t __arr[__k + 3]; in seed()
140 __q.generate(__arr + 0, __arr + __k + 3); in seed()
143 for (size_t __j = 0; __j < __k; ++__j) in seed()
355 const size_t __k = (__w + 31) / 32; in seed() local
356 uint_least32_t __arr[__n * __k]; in seed()
357 __q.generate(__arr + 0, __arr + __n * __k); in seed()
364 for (size_t __j = 0; __j < __k; ++__j) in seed()
366 __sum += __arr[__k * __i + __j] * __factor; in seed()
401 for (size_t __k = 0; __k < (__n - __m); ++__k) in _M_gen_rand() local
[all …]
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm32/include/libcxx/include/
H A Dmap1126 mapped_type& operator[](const key_type& __k);
1128 mapped_type& operator[](key_type&& __k);
1131 mapped_type& at(const key_type& __k);
1132 const mapped_type& at(const key_type& __k) const;
1203 pair<iterator, bool> try_emplace(const key_type& __k, _Args&&... __args)
1205 return __tree_.__emplace_unique_key_args(__k,
1207 _VSTD::forward_as_tuple(__k),
1213 pair<iterator, bool> try_emplace(key_type&& __k, _Args&&... __args)
1215 return __tree_.__emplace_unique_key_args(__k,
1217 _VSTD::forward_as_tuple(_VSTD::move(__k)),
[all …]
H A Dset682 size_type erase(const key_type& __k)
683 {return __tree_.__erase_unique(__k);}
764 iterator find(const key_type& __k) {return __tree_.find(__k);}
766 const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
771 find(const _K2& __k) {return __tree_.find(__k);}
775 find(const _K2& __k) const {return __tree_.find(__k);}
779 size_type count(const key_type& __k) const
780 {return __tree_.__count_unique(__k);}
785 count(const _K2& __k) const {return __tree_.__count_multi(__k);}
788 iterator lower_bound(const key_type& __k)
[all …]
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm64/include/libcxx/include/
H A Dmap1126 mapped_type& operator[](const key_type& __k);
1128 mapped_type& operator[](key_type&& __k);
1131 mapped_type& at(const key_type& __k);
1132 const mapped_type& at(const key_type& __k) const;
1203 pair<iterator, bool> try_emplace(const key_type& __k, _Args&&... __args)
1205 return __tree_.__emplace_unique_key_args(__k,
1207 _VSTD::forward_as_tuple(__k),
1213 pair<iterator, bool> try_emplace(key_type&& __k, _Args&&... __args)
1215 return __tree_.__emplace_unique_key_args(__k,
1217 _VSTD::forward_as_tuple(_VSTD::move(__k)),
[all …]
H A Dset682 size_type erase(const key_type& __k)
683 {return __tree_.__erase_unique(__k);}
764 iterator find(const key_type& __k) {return __tree_.find(__k);}
766 const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
771 find(const _K2& __k) {return __tree_.find(__k);}
775 find(const _K2& __k) const {return __tree_.find(__k);}
779 size_type count(const key_type& __k) const
780 {return __tree_.__count_unique(__k);}
785 count(const _K2& __k) const {return __tree_.__count_multi(__k);}
788 iterator lower_bound(const key_type& __k)
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/parallel/
H A Dlosertree.h94 _LoserTreeBase(unsigned int __k, _Compare __comp) in _LoserTreeBase() argument
97 _M_ik = __k; in _LoserTreeBase()
179 _LoserTree(unsigned int __k, _Compare __comp) in _LoserTree() argument
180 : _Base::_LoserTreeBase(__k, __comp) in _LoserTree()
272 _LoserTree(unsigned int __k, _Compare __comp) in _LoserTree() argument
273 : _Base::_LoserTreeBase(__k, __comp) in _LoserTree()
373 _LoserTreePointerBase(unsigned int __k,
377 _M_ik = __k; in _M_comp()
418 _LoserTreePointer(unsigned int __k, _Compare __comp = std::less<_Tp>())
419 : _Base::_LoserTreePointerBase(__k, __comp) in _LoserTreePointerBase() argument
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/parallel/
H A Dlosertree.h94 _LoserTreeBase(unsigned int __k, _Compare __comp) in _LoserTreeBase() argument
97 _M_ik = __k; in _LoserTreeBase()
179 _LoserTree(unsigned int __k, _Compare __comp) in _LoserTree() argument
180 : _Base::_LoserTreeBase(__k, __comp) in _LoserTree()
272 _LoserTree(unsigned int __k, _Compare __comp) in _LoserTree() argument
273 : _Base::_LoserTreeBase(__k, __comp) in _LoserTree()
373 _LoserTreePointerBase(unsigned int __k,
377 _M_ik = __k; in _M_comp()
418 _LoserTreePointer(unsigned int __k, _Compare __comp = std::less<_Tp>())
419 : _Base::_LoserTreePointerBase(__k, __comp) in _LoserTreePointerBase() argument
[all …]

12345