| /third_party/boost/libs/math/example/ |
| D | bernoulli_example.cpp | 47 << boost::math::bernoulli_b2n<double>(2) << std::endl; in main()
58 << boost::math::bernoulli_b2n<boost::multiprecision::cpp_dec_float_50>(100) << std::endl; in main()
68 …boost::math::bernoulli_b2n<float>(0, 32, std::back_inserter(bn)); // Fill vector with even Bernoul… in main()
97 std::cout << boost::math::bernoulli_b2n<float>(33) << std::endl; in main()
114 …std::cout << "Maximum Bernoulli number using float is " << boost::math::bernoulli_b2n<float>( boos… in main()
116 …std::cout << "Maximum Bernoulli number using double is " << boost::math::bernoulli_b2n<double>( bo… in main()
|
| /third_party/boost/boost/math/special_functions/ |
| D | bernoulli.hpp | 60 inline T bernoulli_b2n(const int i, const Policy &pol) in bernoulli_b2n() function
72 inline T bernoulli_b2n(const int i) in bernoulli_b2n() function
74 return boost::math::bernoulli_b2n<T>(i, policies::policy<>()); in bernoulli_b2n()
78 inline OutputIterator bernoulli_b2n(const int start_index, in bernoulli_b2n() function
94 inline OutputIterator bernoulli_b2n(const int start_index, in bernoulli_b2n() function
98 …return boost::math::bernoulli_b2n<T, OutputIterator>(start_index, number_of_bernoullis_b2n, out_it… in bernoulli_b2n()
|
| D | math_fwd.hpp | 1062 T bernoulli_b2n(const int i, const Policy &pol);
1064 T bernoulli_b2n(const int i);
1066 OutputIterator bernoulli_b2n(const int start_index,
1071 OutputIterator bernoulli_b2n(const int start_index,
1676 T bernoulli_b2n(const int i)\
1677 { return boost::math::bernoulli_b2n<T>(i, Policy()); }\
1679 …OutputIterator bernoulli_b2n(int start_index, unsigned number_of_bernoullis_b2n, OutputIterator ou…
1680 …{ return boost::math::bernoulli_b2n<T>(start_index, number_of_bernoullis_b2n, out_it, Policy()); }\
|
| D | digamma.hpp | 172 T result = term * boost::math::bernoulli_b2n<T>(k) / (2 * k); in operator ()()
|
| D | gamma.hpp | 396 T sum = (boost::math::bernoulli_b2n<T>(1) / 2) * one_over_x_pow_two_n_minus_one; in scaled_tgamma_no_lanczos()
407 …const T term = (boost::math::bernoulli_b2n<T>(static_cast<int>(n)) * one_over_x_pow_two_n_minus_on… in scaled_tgamma_no_lanczos()
|
| D | zeta.hpp | 959 boost::math::bernoulli_b2n<T>(v / 2) / boost::math::factorial<T>(v); in zeta_imp()
|
| /third_party/boost/libs/math/test/ |
| D | test_bernoulli_constants.cpp | 138 T b2n = boost::math::bernoulli_b2n<T>(i); in test()
179 boost::math::bernoulli_b2n<T>(0, boost::math::max_bernoulli_b2n<T>::value + 20, bn); in test()
183 BOOST_CHECK_EQUAL(bn[i], boost::math::bernoulli_b2n<T>(i)); in test()
198 …BOOST_MATH_CHECK_THROW(boost::math::bernoulli_b2n<T>(overflow_index, boost::math::policies::make_p… in test()
208 …st::math::concepts::real_concept>(boost::math::bernoulli_b2n<long double>(i)), boost::math::bernou… in test_real_concept_extra()
212 …boost::math::concepts::real_concept r = boost::math::bernoulli_b2n<long double>(i + boost::math::m… in test_real_concept_extra()
|
| D | test_autodiff_4.cpp | 179 auto autodiff_v = boost::math::bernoulli_b2n<autodiff_fvar<T, m>>(i); in BOOST_AUTO_TEST_CASE_TEMPLATE()
180 auto anchor_v = boost::math::bernoulli_b2n<T>(i); in BOOST_AUTO_TEST_CASE_TEMPLATE()
|
| /third_party/boost/libs/math/test/compile_test/ |
| D | sf_bernoulli_incl_test.cpp | 19 check_result<float>(boost::math::bernoulli_b2n<float>(i)); in compile_and_link_test()
20 check_result<double>(boost::math::bernoulli_b2n<double>(i)); in compile_and_link_test()
22 check_result<long double>(boost::math::bernoulli_b2n<long double>(i)); in compile_and_link_test()
|
| D | instantiate.hpp | 374 boost::math::bernoulli_b2n<RealType>(i); in instantiate()
375 boost::math::bernoulli_b2n<RealType>(i, i, &v1); in instantiate()
776 boost::math::bernoulli_b2n<RealType>(i, pol); in instantiate()
777 boost::math::bernoulli_b2n<RealType>(i, i, &v1, pol); in instantiate()
|
| /third_party/boost/libs/math/doc/sf/ |
| D | bernoulli_numbers.qbk | 21 T bernoulli_b2n(const int n); // Single Bernoulli number (default policy).
24 T bernoulli_b2n(const int n, const Policy &pol); // User policy for errors etc.
79 larger indexes can be passed to `bernoulli_b2n<T>(n)`, but then you lose fast table lookup (i.e. va…
96 OutputIterator bernoulli_b2n(
103 OutputIterator bernoulli_b2n(
|
| D | number_series.qbk | 23 T bernoulli_b2n(const int n); // Single Bernoulli number (default policy).
26 T bernoulli_b2n(const int n, const Policy &pol); // User policy for errors etc.
79 larger indexes can be passed to `bernoulli_b2n<T>(n)`, but then you lose fast table lookup (i.e. va…
96 OutputIterator bernoulli_b2n(
103 OutputIterator bernoulli_b2n(
|
| /third_party/boost/boost/math/special_functions/detail/ |
| D | bernoulli_details.hpp | 157 boost::math::bernoulli_b2n<T>(2, Policy()); in init()
161 boost::math::bernoulli_b2n<T>(max_bernoulli_b2n<T>::value + 1, Policy()); in init()
|
| D | polygamma.hpp | 105 term = part_term * boost::math::bernoulli_b2n<T>(k, pol); in polygamma_atinfinityplus()
|