/third_party/libwebsockets/minimal-examples/secure-streams/minimal-secure-streams-policy2c/ |
D | minimal-secure-streams.c | 73 const lws_ss_policy_t *pol, *lastpol = NULL; in main() local 151 pol = lws_ss_policy_get(context); in main() 153 while (pol) { in main() 160 md = pol->metadata; in main() 168 md = pol->metadata; in main() 174 purify_csymbol(pol->streamtype, buf, in main() 211 if (pol->retry_bo) { in main() 214 if (a->orig == (const char *)pol->retry_bo) in main() 229 a->orig = (const char *)pol->retry_bo; in main() 234 for (n = 0; n < pol->retry_bo->retry_ms_table_count; n++) in main() [all …]
|
/third_party/boost/boost/math/special_functions/detail/ |
D | polygamma.hpp | 39 …T polygamma_atinfinityplus(const int n, const T& x, const Policy& pol, const char* function) // fo… in polygamma_atinfinityplus() argument 56 return ((n & 1) ? 1 : -1) * exp(boost::math::lgamma(T(n), pol) - n * log(x)); in polygamma_atinfinityplus() 81 ? T(0) : static_cast<T>(boost::math::factorial<T>(n - 1, pol) * pow(x, -n - 1)); in polygamma_atinfinityplus() 86 part_term = static_cast<T>(boost::math::lgamma(n, pol) - (n + 1) * log(x)); in polygamma_atinfinityplus() 105 term = part_term * boost::math::bernoulli_b2n<T>(k, pol); in polygamma_atinfinityplus() 124 …cies::raise_evaluation_error(function, "Series did not converge, closest value was %1%", sum, pol); in polygamma_atinfinityplus() 135 T polygamma_attransitionplus(const int n, const T& x, const Policy& pol, const char* function) in polygamma_attransitionplus() argument 147 …tions evaluating at n = " + boost::lexical_cast<std::string>(n) + " and x = %1%").c_str(), x, pol); in polygamma_attransitionplus() 170 T log_term = log(z) * minus_m_minus_one + boost::math::lgamma(T(n + 1), pol); in polygamma_attransitionplus() 178 return sum0 + polygamma_atinfinityplus(n, z, pol, function); in polygamma_attransitionplus() [all …]
|
D | bessel_derivatives_linear.hpp | 20 inline T bessel_j_derivative_linear(T v, T x, Tag tag, Policy pol) in bessel_j_derivative_linear() argument 22 …h::detail::cyl_bessel_j_imp<T>(v-1, x, tag, pol) - boost::math::detail::cyl_bessel_j_imp<T>(v+1, x… in bessel_j_derivative_linear() 26 inline T bessel_j_derivative_linear(T v, T x, const bessel_int_tag& tag, Policy pol) in bessel_j_derivative_linear() argument 28 …yl_bessel_j_imp<T>(itrunc(v-1), x, tag, pol) - boost::math::detail::cyl_bessel_j_imp<T>(itrunc(v+1… in bessel_j_derivative_linear() 32 inline T sph_bessel_j_derivative_linear(unsigned v, T x, Policy pol) in sph_bessel_j_derivative_linear() argument 34 …boost::math::detail::sph_bessel_j_imp<T>(v, x, pol) - boost::math::detail::sph_bessel_j_imp<T>(v+1… in sph_bessel_j_derivative_linear() 38 inline T bessel_i_derivative_linear(T v, T x, Policy pol) in bessel_i_derivative_linear() argument 40 T result = boost::math::detail::cyl_bessel_i_imp<T>(v - 1, x, pol); in bessel_i_derivative_linear() 43 T result2 = boost::math::detail::cyl_bessel_i_imp<T>(v + 1, x, pol); in bessel_i_derivative_linear() 50 inline T bessel_k_derivative_linear(T v, T x, Tag tag, Policy pol) in bessel_k_derivative_linear() argument [all …]
|
D | hypergeometric_1F1_addition_theorems_on_z.hpp | 40 …f1_recurrence_on_z_minus_zero_series(const T& a, const T& b, const T& z, int k_, const Policy& pol) in hypergeometric_1f1_recurrence_on_z_minus_zero_series() 45 M = boost::math::detail::hypergeometric_1F1_imp(a, b, z, pol, scale1); in hypergeometric_1f1_recurrence_on_z_minus_zero_series() 46 M_next = boost::math::detail::hypergeometric_1F1_imp(T(a - 1), b, z, pol, scale2); in hypergeometric_1f1_recurrence_on_z_minus_zero_series() 77 …nce_on_z_minus_zero(const T& a, const T& b, const T& z, int k, const Policy& pol, int& log_scaling) in hypergeometric_1f1_recurrence_on_z_minus_zero() argument 81 hypergeometric_1f1_recurrence_on_z_minus_zero_series<T, Policy> s(a, b, z, k, pol); in hypergeometric_1f1_recurrence_on_z_minus_zero() 85 …s<T>("boost::math::hypergeometric_1f1_recurrence_on_z_plus_plus<%1%>(%1%,%1%,%1%)", max_iter, pol); in hypergeometric_1f1_recurrence_on_z_minus_zero() 100 …1f1_recurrence_on_z_plus_plus_series(const T& a, const T& b, const T& z, int k_, const Policy& pol) 103 M = boost::math::detail::hypergeometric_1F1_imp(a, b, z, pol); 104 M_next = boost::math::detail::hypergeometric_1F1_imp(a + 1, b + 1, z, pol); 124 …ometric_1f1_recurrence_on_z_plus_plus(const T& a, const T& b, const T& z, int k, const Policy& pol) [all …]
|
D | hypergeometric_1F1_large_abz.hpp | 32 … hypergeometric_1F1_igamma_series(const T& alpha, const T& delta, const T& x, const Policy& pol) in hypergeometric_1F1_igamma_series() 33 : delta_poch(-delta), alpha_poch(alpha), x(x), k(0), cache_offset(0), pol(pol) in hypergeometric_1F1_igamma_series() 58 … gamma_cache[cache_size - 1] = boost::math::gamma_p(alpha_poch + ((int)cache_size - 1), x, pol); in refill_cache() 61 … : T(gamma_cache[i] + regularised_gamma_prefix(T(alpha_poch + (i - 1)), x, pol, lanczos_type()) / … in refill_cache() 69 Policy pol; member 73 …igamma(const T& a, const T& b, const T& x, const T& b_minus_a, const Policy& pol, int& log_scaling) in hypergeometric_1F1_igamma() argument 79 int scale = itrunc(x, pol); in hypergeometric_1F1_igamma() 83 hypergeometric_1F1_igamma_series<T, Policy> s(b_minus_a, a - 1, x, pol); in hypergeometric_1F1_igamma() 87 …st::math::policies::check_series_iterations<T>("boost::math::tgamma<%1%>(%1%,%1%)", max_iter, pol); in hypergeometric_1F1_igamma() 88 T log_prefix = x + boost::math::lgamma(b, pol) - boost::math::lgamma(a, pol); in hypergeometric_1F1_igamma() [all …]
|
/third_party/boost/libs/math/test/compile_test/ |
D | instantiate.hpp | 576 test_policy pol; in instantiate() local 577 boost::math::tgamma(v1, pol); in instantiate() 578 boost::math::tgamma1pm1(v1, pol); in instantiate() 579 boost::math::lgamma(v1, pol); in instantiate() 580 boost::math::lgamma(v1, &i, pol); in instantiate() 581 boost::math::digamma(v1, pol); in instantiate() 582 boost::math::trigamma(v1, pol); in instantiate() 583 boost::math::polygamma(i, v1, pol); in instantiate() 584 boost::math::tgamma_ratio(v1, v2, pol); in instantiate() 585 boost::math::tgamma_delta_ratio(v1, v2, pol); in instantiate() [all …]
|
/third_party/toybox/toys/other/ |
D | chrt.c | 58 int pol, pri; in chrt_main() local 62 for (pol = 0; pol<ARRAY_LEN(polnames); pol++) if (polnames[pol]) in chrt_main() 63 printf("%s min/max priority\t: %d/%d\n", polnames[pol], in chrt_main() 64 sched_get_priority_min(pol), sched_get_priority_max(pol)); in chrt_main() 73 if (-1==(pol = sched_getscheduler(TT.p))) perror_exit("pid %ld", TT.p); in chrt_main() 74 if (pol & SCHED_RESET_ON_FORK) R = "|SCHED_RESET_ON_FORK"; in chrt_main() 75 if ((pol &= ~SCHED_RESET_ON_FORK)<ARRAY_LEN(polnames)) s = polnames[pol]; in chrt_main() 89 if (-1==(pol = highest_bit(toys.optflags&0x2f))) pol = SCHED_RR; in chrt_main() 90 pri = atolx_range(*toys.optargs, sched_get_priority_min(pol), in chrt_main() 91 sched_get_priority_max(pol)); in chrt_main() [all …]
|
/third_party/boost/boost/math/distributions/detail/ |
D | common_error_handling.hpp | 26 … check_probability(const char* function, RealType const& prob, RealType* result, const Policy& pol) in check_probability() argument 32 "Probability argument is %1%, but must be >= 0 and <= 1 !", prob, pol); in check_probability() 39 inline bool check_df(const char* function, RealType const& df, RealType* result, const Policy& pol) in check_df() argument 45 "Degrees of freedom argument is %1%, but must be > 0 !", df, pol); in check_df() 52 … check_df_gt0_to_inf(const char* function, RealType const& df, RealType* result, const Policy& pol) in check_df_gt0_to_inf() argument 58 "Degrees of freedom argument is %1%, but must be > 0 !", df, pol); in check_df_gt0_to_inf() 70 const Policy& pol) in check_scale() argument 76 "Scale parameter is %1%, but must be > 0 !", scale, pol); in check_scale() 87 const Policy& pol) in check_location() argument 93 "Location parameter is %1%, but must be finite!", location, pol); in check_location() [all …]
|
D | hypergeometric_quantile.hpp | 105 …signed hypergeometric_quantile_imp(T p, T q, unsigned r, unsigned n, unsigned N, const Policy& pol) in hypergeometric_quantile_imp() argument 131 result = hypergeometric_pdf<T>(x, r, n, N, pol); in hypergeometric_quantile_imp() 138 T log_pdf = boost::math::lgamma(static_cast<T>(n + 1), pol) in hypergeometric_quantile_imp() 139 + boost::math::lgamma(static_cast<T>(r + 1), pol) in hypergeometric_quantile_imp() 140 + boost::math::lgamma(static_cast<T>(N - n + 1), pol) in hypergeometric_quantile_imp() 141 + boost::math::lgamma(static_cast<T>(N - r + 1), pol) in hypergeometric_quantile_imp() 142 - boost::math::lgamma(static_cast<T>(N + 1), pol) in hypergeometric_quantile_imp() 143 - boost::math::lgamma(static_cast<T>(x + 1), pol) in hypergeometric_quantile_imp() 144 - boost::math::lgamma(static_cast<T>(n - x + 1), pol) in hypergeometric_quantile_imp() 145 - boost::math::lgamma(static_cast<T>(r - x + 1), pol) in hypergeometric_quantile_imp() [all …]
|
/third_party/boost/boost/math/special_functions/ |
D | log1p.hpp | 86 T log1p_imp(T const & x, const Policy& pol, const boost::integral_constant<int, 0>&) in log1p_imp() argument 95 function, "log1p(x) requires x > -1, but got x = %1%.", x, pol); in log1p_imp() 98 function, 0, pol); in log1p_imp() 115 policies::check_series_iterations<T>(function, max_iter, pol); in log1p_imp() 120 T log1p_imp(T const& x, const Policy& pol, const boost::integral_constant<int, 53>&) in log1p_imp() argument 128 function, "log1p(x) requires x > -1, but got x = %1%.", x, pol); in log1p_imp() 131 function, 0, pol); in log1p_imp() 173 T log1p_imp(T const& x, const Policy& pol, const boost::integral_constant<int, 64>&) in log1p_imp() argument 181 function, "log1p(x) requires x > -1, but got x = %1%.", x, pol); in log1p_imp() 184 function, 0, pol); in log1p_imp() [all …]
|
D | bessel.hpp | 77 inline T sph_bessel_j_small_z_series(unsigned v, T x, const Policy& pol) in sph_bessel_j_small_z_series() argument 88 …heck_series_iterations<T>("boost::math::sph_bessel_j_small_z_series<%1%>(%1%,%1%)", max_iter, pol); in sph_bessel_j_small_z_series() 93 T cyl_bessel_j_imp(T v, T x, const bessel_no_int_tag& t, const Policy& pol) in cyl_bessel_j_imp() argument 102 T r = cyl_bessel_j_imp(v, T(-x), t, pol); in cyl_bessel_j_imp() 103 if(iround(v, pol) & 1) in cyl_bessel_j_imp() 110 "Got x = %1%, but we need x >= 0", x, pol); in cyl_bessel_j_imp() 114 bessel_jy(v, x, &j, &y, need_j, pol); in cyl_bessel_j_imp() 119 inline T cyl_bessel_j_imp(T v, T x, const bessel_maybe_int_tag&, const Policy& pol) in cyl_bessel_j_imp() argument 122 int ival = detail::iconv(v, pol); in cyl_bessel_j_imp() 127 return bessel_jn(ival, x, pol); in cyl_bessel_j_imp() [all …]
|
D | ellint_3.hpp | 41 T ellint_pi_imp(T v, T k, T vc, const Policy& pol); 45 T ellint_pi_imp(T v, T phi, T k, T vc, const Policy& pol) in ellint_pi_imp() argument 59 "Got k = %1%, function requires |k| <= 1", k, pol); in ellint_pi_imp() 65 return (k == 0) ? phi : ellint_f_imp(phi, k, pol); in ellint_pi_imp() 71 "Got v = %1%, but result is complex for v > 1 / sin^2(phi)", v, pol); in ellint_pi_imp() 81 result = sqrt(1 - m * sphi * sphi) * tan(phi) - ellint_e_imp(phi, k, pol); in ellint_pi_imp() 83 result += ellint_f_imp(phi, k, pol); in ellint_pi_imp() 95 return ellint_pi_imp(v, k, vc, pol); in ellint_pi_imp() 113 "Got v = %1%, but this is only supported for 0 <= phi <= pi/2", v, pol); in ellint_pi_imp() 118 result = 2 * fabs(phi) * ellint_pi_imp(v, k, vc, pol) / constants::pi<T>(); in ellint_pi_imp() [all …]
|
D | beta.hpp | 34 T beta_imp(T a, T b, const Lanczos&, const Policy& pol) in beta_imp() argument 39 …%>(%1%,%1%)", "The arguments to the beta function must be greater than zero (got a=%1%).", a, pol); in beta_imp() 41 …%>(%1%,%1%)", "The arguments to the beta function must be greater than zero (got b=%1%).", b, pol); in beta_imp() 100 result *= exp(ambh * boost::math::log1p(-b / cgh, pol)); in beta_imp() 124 T beta_imp(T a, T b, const lanczos::undefined_lanczos& l, const Policy& pol) in beta_imp() argument 129 …%>(%1%,%1%)", "The arguments to the beta function must be greater than zero (got a=%1%).", a, pol); in beta_imp() 131 …%>(%1%,%1%)", "The arguments to the beta function must be greater than zero (got b=%1%).", b, pol); in beta_imp() 165 …b / c, b) * scaled_tgamma_no_lanczos(a, pol) * scaled_tgamma_no_lanczos(b, pol) / scaled_tgamma_no… in beta_imp() 169 return boost::math::tgamma(a, pol) * (boost::math::tgamma(b, pol) / boost::math::tgamma(c)); in beta_imp() 172 return boost::math::tgamma(a, pol) * boost::math::tgamma_delta_ratio(b, a, pol); in beta_imp() [all …]
|
D | gamma.hpp | 114 T gamma_imp(T z, const Policy& pol, const Lanczos& l) in gamma_imp() argument 133 …policies::raise_pole_error<T>(function, "Evaluation of tgamma at a negative integer %1%.", z, pol); in gamma_imp() 136 result = gamma_imp(T(-z), pol, l) * sinpx(z); in gamma_imp() 139 … * policies::raise_overflow_error<T>(function, "Result of tgamma is too large to represent.", pol); in gamma_imp() 142 …n policies::raise_underflow_error<T>(function, "Result of tgamma is too small to represent.", pol); in gamma_imp() 144 …return policies::raise_denorm_error<T>(function, "Result of tgamma is denormalized.", result, pol); in gamma_imp() 159 result *= unchecked_factorial<T>(itrunc(z, pol) - 1); in gamma_imp() 165 result = policies::raise_overflow_error<T>(function, 0, pol); in gamma_imp() 180 … * policies::raise_overflow_error<T>(function, "Result of tgamma is too large to represent.", pol); in gamma_imp() 186 … * policies::raise_overflow_error<T>(function, "Result of tgamma is too large to represent.", pol); in gamma_imp() [all …]
|
D | trunc.hpp | 23 inline typename tools::promote_args<T>::type trunc(const T& v, const Policy& pol, const boost::fals… in trunc() argument 28 …("boost::math::trunc<%1%>(%1%)", 0, static_cast<result_type>(v), static_cast<result_type>(v), pol); in trunc() 41 inline typename tools::promote_args<T>::type trunc(const T& v, const Policy& pol) in trunc() argument 43 …return detail::trunc(v, pol, boost::integral_constant<bool, detail::is_integer_for_rounding<T>::va… in trunc() 60 inline int itrunc(const T& v, const Policy& pol) in itrunc() argument 64 result_type r = boost::math::trunc(v, pol); in itrunc() 66 …es::raise_rounding_error("boost::math::itrunc<%1%>(%1%)", 0, static_cast<result_type>(v), 0, pol)); in itrunc() 76 inline long ltrunc(const T& v, const Policy& pol) in ltrunc() argument 80 result_type r = boost::math::trunc(v, pol); in ltrunc() 82 …s::raise_rounding_error("boost::math::ltrunc<%1%>(%1%)", 0, static_cast<result_type>(v), 0L, pol)); in ltrunc() [all …]
|
D | factorials.hpp | 30 inline T factorial(unsigned i, const Policy& pol) in factorial() argument 44 T result = boost::math::tgamma(static_cast<T>(i+1), pol); in factorial() 74 T double_factorial(unsigned i, const Policy& pol) in double_factorial() argument 90 T result = boost::math::tgamma(static_cast<T>(i) / 2 + 1, pol) / sqrt(constants::pi<T>()); in double_factorial() 98 T result = factorial<T>(n, pol); in double_factorial() 105 return policies::raise_overflow_error<T>("boost::math::double_factorial<%1%>(unsigned)", 0, pol); in double_factorial() 117 T rising_factorial_imp(T x, int n, const Policy& pol) in rising_factorial_imp() argument 137 T result = ((n&1) ? -1 : 1) * falling_factorial(-x, n, pol); in rising_factorial_imp() 147 return -boost::math::tgamma_delta_ratio(x + 1, static_cast<T>(-n), pol); in rising_factorial_imp() 153 T val = boost::math::tgamma_delta_ratio(1 - x, static_cast<T>(-n), pol); in rising_factorial_imp() [all …]
|
D | next.hpp | 172 T float_next_imp(const T& val, const boost::true_type&, const Policy& pol) in float_next_imp() argument 186 "Argument must be finite, but got %1%", val, pol); in float_next_imp() 190 return policies::raise_overflow_error<T>(function, 0, pol); in float_next_imp() 202 return ldexp(float_next(T(ldexp(val, 2 * tools::digits<T>())), pol), -2 * tools::digits<T>()); in float_next_imp() 216 T float_next_imp(const T& val, const boost::false_type&, const Policy& pol) in float_next_imp() argument 233 "Argument must be finite, but got %1%", val, pol); in float_next_imp() 237 return policies::raise_overflow_error<T>(function, 0, pol); in float_next_imp() 249 …return scalbn(float_next(T(scalbn(val, 2 * std::numeric_limits<T>::digits)), pol), -2 * std::numer… in float_next_imp() 264 inline typename tools::promote_args<T>::type float_next(const T& val, const Policy& pol) in float_next() argument 267 …ric_limits<result_type>::is_specialized || (std::numeric_limits<result_type>::radix == 2)>(), pol); in float_next() [all …]
|
D | legendre.hpp | 38 T legendre_imp(unsigned l, T x, const Policy& pol, bool second = false) in legendre_imp() argument 46 " -1 <= x <= 1, but got x = %1%.", x, pol); in legendre_imp() 52 p0 = (boost::math::log1p(x, pol) - boost::math::log1p(-x, pol)) / 2; in legendre_imp() 76 T legendre_p_prime_imp(unsigned l, T x, const Policy& pol, T* Pn in legendre_p_prime_imp() argument 90 " -1 <= x <= 1, but got x = %1%.", x, pol); in legendre_p_prime_imp() 143 const Policy& pol; member 145 legendre_p_zero_func(int n_, const Policy& p) : n(n_), pol(p) {} in legendre_p_zero_func() 150 T Pn_prime = detail::legendre_p_prime_imp(n, x, pol, &Pn); in operator ()() 156 std::vector<T> legendre_p_zeros_imp(int n, const Policy& pol) in legendre_p_zeros_imp() argument 203 legendre_p_zero_func<T, Policy> f(n, pol); in legendre_p_zeros_imp() [all …]
|
D | hypergeometric_1F1.hpp | 53 …T hypergeometric_1F1_divergent_fallback(const T& a, const T& b, const T& z, const Policy& pol, int… in hypergeometric_1F1_divergent_fallback() argument 68 … return hypergeometric_1F1_backward_recurrence_for_negative_a(a, b, z, pol, function, log_scaling); in hypergeometric_1F1_divergent_fallback() 75 …::math::detail::hypergeometric_1f1_recurrence_on_z_minus_zero(a, b, T(z - k), k, pol, log_scaling); in hypergeometric_1F1_divergent_fallback() 79 … return hypergeometric_1F1_backward_recurrence_for_negative_a(a, b, z, pol, function, log_scaling); in hypergeometric_1F1_divergent_fallback() 81 …return hypergeometric_1F1_backwards_recursion_on_b_for_negative_a(a, b, z, pol, function, log_scal… in hypergeometric_1F1_divergent_fallback() 88 return hypergeometric_1F1_from_function_ratio_negative_ab(a, b, z, pol, log_scaling); in hypergeometric_1F1_divergent_fallback() 101 …return hypergeometric_1F1_backwards_recursion_on_b_for_negative_a(a, b, z, pol, function, log_scal… in hypergeometric_1F1_divergent_fallback() 108 …return hypergeometric_1F1_backwards_recursion_on_b_for_negative_a(a, b, z, pol, function, log_scal… in hypergeometric_1F1_divergent_fallback() 126 return hypergeometric_1F1_from_function_ratio_negative_b(a, b, z, pol, log_scaling); in hypergeometric_1F1_divergent_fallback() 130 … return hypergeometric_1F1_from_function_ratio_negative_b_forwards(a, b, z, pol, log_scaling); in hypergeometric_1F1_divergent_fallback() [all …]
|
D | bernoulli.hpp | 23 …er_imp(OutputIterator out, std::size_t start, std::size_t n, const Policy& pol, const boost::integ… in bernoulli_number_imp() argument 34 … ? 1 : -1) * policies::raise_overflow_error<T>("boost::math::bernoulli_b2n<%1%>(n)", 0, T(i), pol); in bernoulli_number_imp() 41 …er_imp(OutputIterator out, std::size_t start, std::size_t n, const Policy& pol, const boost::integ… in bernoulli_number_imp() argument 54 return get_bernoulli_numbers_cache<T, Policy>().copy_bernoulli_numbers(out, start, n, pol); in bernoulli_number_imp() 60 inline T bernoulli_b2n(const int i, const Policy &pol) in bernoulli_b2n() argument 64 …_domain_error<T>("boost::math::bernoulli_b2n<%1%>", "Index should be >= 0 but got %1%", T(i), pol); in bernoulli_b2n() 67 …boost::math::detail::bernoulli_number_imp<T>(&result, static_cast<std::size_t>(i), 1u, pol, tag_ty… in bernoulli_b2n() 81 const Policy& pol) in bernoulli_b2n() argument 86 …ror<T>("boost::math::bernoulli_b2n<%1%>", "Index should be >= 0 but got %1%", T(start_index), pol); in bernoulli_b2n() 90 …h::detail::bernoulli_number_imp<T>(out_it, start_index, number_of_bernoullis_b2n, pol, tag_type()); in bernoulli_b2n() [all …]
|
D | bessel_prime.hpp | 24 inline T cyl_bessel_j_prime_imp(T v, T x, const Policy& pol) in cyl_bessel_j_prime_imp() argument 34 "Got x = %1%, but function requires x >= 0", x, pol); in cyl_bessel_j_prime_imp() 48 "Got x = %1%, but function is indeterminate for this order", x, pol); in cyl_bessel_j_prime_imp() 64 if (itrunc(v, pol) & 1) in cyl_bessel_j_prime_imp() 67 T r = boost::math::detail::bessel_j_derivative_small_z_series(v, x, pol); in cyl_bessel_j_prime_imp() 74 return -boost::math::detail::cyl_bessel_j_imp<T>(1, x, Tag(), pol); in cyl_bessel_j_prime_imp() 78 return boost::math::detail::bessel_j_derivative_linear(v, x, Tag(), pol); in cyl_bessel_j_prime_imp() 82 inline T sph_bessel_j_prime_imp(unsigned v, T x, const Policy& pol) in sph_bessel_j_prime_imp() argument 91 "Got x = %1%, but function requires x >= 0.", x, pol); in sph_bessel_j_prime_imp() 96 return (x == 0) ? boost::math::policies::raise_overflow_error<T>(function, 0, pol) in sph_bessel_j_prime_imp() [all …]
|
D | ellint_rj.hpp | 35 T ellint_rc1p_imp(T y, const Policy& pol) in ellint_rc1p_imp() argument 46 "Argument y must not be zero but got %1%", y, pol); in ellint_rc1p_imp() 53 result = sqrt(1 / -y) * detail::ellint_rc_imp(T(-y), T(-1 - y), pol); in ellint_rc1p_imp() 79 T ellint_rj_imp(T x, T y, T z, T p, const Policy& pol) in ellint_rj_imp() argument 88 "Argument x must be non-negative, but got x = %1%", x, pol); in ellint_rj_imp() 93 "Argument y must be non-negative, but got y = %1%", y, pol); in ellint_rj_imp() 98 "Argument z must be non-negative, but got z = %1%", z, pol); in ellint_rj_imp() 103 "Argument p must not be zero, but got p = %1%", p, pol); in ellint_rj_imp() 109 "only possible result is %1%.", std::numeric_limits<T>::quiet_NaN(), pol); in ellint_rj_imp() 135 T value = (p - z) * ellint_rj_imp(x, y, z, p, pol); in ellint_rj_imp() [all …]
|
D | round.hpp | 23 inline typename tools::promote_args<T>::type round(const T& v, const Policy& pol, const boost::fals… in round() argument 28 …("boost::math::round<%1%>(%1%)", 0, static_cast<result_type>(v), static_cast<result_type>(v), pol); in round() 63 inline typename tools::promote_args<T>::type round(const T& v, const Policy& pol) in round() argument 65 …return detail::round(v, pol, boost::integral_constant<bool, detail::is_integer_for_rounding<T>::va… in round() 82 inline int iround(const T& v, const Policy& pol) in iround() argument 85 T r = boost::math::round(v, pol); in iround() 87 …rn static_cast<int>(policies::raise_rounding_error("boost::math::iround<%1%>(%1%)", 0, v, 0, pol)); in iround() 97 inline long lround(const T& v, const Policy& pol) in lround() argument 100 T r = boost::math::round(v, pol); in lround() 102 …tic_cast<long int>(policies::raise_rounding_error("boost::math::lround<%1%>(%1%)", 0, v, 0L, pol)); in lround() [all …]
|
D | airy.hpp | 22 T airy_ai_imp(T x, const Policy& pol) in airy_ai_imp() argument 30 T j1 = boost::math::cyl_bessel_j(v, p, pol); in airy_ai_imp() 31 T j2 = boost::math::cyl_bessel_j(-v, p, pol); in airy_ai_imp() 38 T tg = boost::math::tgamma(constants::twothirds<T>(), pol); in airy_ai_imp() 53 …T ai = cyl_bessel_k(v, p, pol) * sqrt(x / 3) / boost::math::constants::pi<T>(); //sqrt(x) * (j1 -… in airy_ai_imp() 60 T airy_bi_imp(T x, const Policy& pol) in airy_bi_imp() argument 68 T j1 = boost::math::cyl_bessel_j(v, p, pol); in airy_bi_imp() 69 T j2 = boost::math::cyl_bessel_j(-v, p, pol); in airy_bi_imp() 76 T tg = boost::math::tgamma(constants::twothirds<T>(), pol); in airy_bi_imp() 85 T j1 = boost::math::cyl_bessel_i(-v, p, pol); in airy_bi_imp() [all …]
|
/third_party/libwebsockets/lib/secure-streams/cpp/ |
D | lss.cxx | 58 memset(&pol, 0, sizeof(pol)); in lss() 78 ssi.policy = &pol; /* we will provide our own policy */ in lss() 94 pol.protocol = n >> 1; in lss() 96 pol.flags |= LWSSSPOLF_TLS; in lss() 100 if (lws_parse_uri(uri, &p, &pol.endpoint, &n, &urlpath)) in lss() 103 pol.port = (uint16_t)n; in lss() 105 if (pol.protocol <= LWSSSP_WS) { in lss() 106 pol.u.http.url = urlpath; in lss() 112 pol.flags |= LWSSSPOLF_QUIRK_NGHTTP2_END_STREAM | in lss() 116 if (pol.protocol < LWSSSP_WS) in lss() [all …]
|