| /third_party/boost/boost/math/special_functions/detail/ |
| D | airy_ai_bi_zero.hpp | 59 T guess; in initial_guess() local
63 case 0: { guess = T(0); break; } in initial_guess()
64 case 1: { guess = T(-2.33810741045976703849); break; } in initial_guess()
65 case 2: { guess = T(-4.08794944413097061664); break; } in initial_guess()
66 case 3: { guess = T(-5.52055982809555105913); break; } in initial_guess()
67 case 4: { guess = T(-6.78670809007175899878); break; } in initial_guess()
68 case 5: { guess = T(-7.94413358712085312314); break; } in initial_guess()
69 case 6: { guess = T(-9.02265085334098038016); break; } in initial_guess()
70 case 7: { guess = T(-10.0401743415580859306); break; } in initial_guess()
71 case 8: { guess = T(-11.0085243037332628932); break; } in initial_guess()
[all …]
|
| D | igamma_inverse.hpp | 407 T guess = detail::find_inverse_gamma<T>(a, p, 1 - p, pol, &has_10_digits); in gamma_p_inv_imp() local
409 return guess; in gamma_p_inv_imp()
411 if(guess <= lower) in gamma_p_inv_imp()
412 guess = tools::min_value<T>(); in gamma_p_inv_imp()
413 BOOST_MATH_INSTRUMENT_VARIABLE(guess); in gamma_p_inv_imp()
431 if((a < 0.125) && (fabs(gamma_p_derivative(a, guess, pol)) > 1 / sqrt(tools::epsilon<T>()))) in gamma_p_inv_imp()
437 guess = tools::halley_iterate( in gamma_p_inv_imp()
439 guess, in gamma_p_inv_imp()
445 BOOST_MATH_INSTRUMENT_VARIABLE(guess); in gamma_p_inv_imp()
446 if(guess == lower) in gamma_p_inv_imp()
[all …]
|
| D | bessel_jy_zero.hpp | 252 T guess; in initial_guess() local
264 guess = ((((( - T(0.2321156900729) in initial_guess()
272 return guess; in initial_guess()
347 guess = ((((( - T(0.0008342379046010) in initial_guess()
358 … guess = boost::math::detail::bessel_zero::cyl_bessel_j_zero_detail::equation_nist_10_21_40_a(v); in initial_guess()
368 guess = boost::math::detail::bessel_zero::equation_nist_10_21_19(v, a); in initial_guess()
376 guess = boost::math::detail::bessel_zero::equation_as_9_5_26(v, airy_ai_root); in initial_guess()
380 return guess; in initial_guess()
471 T guess; in initial_guess() local
578 guess = ((((( - T(0.0025095909235652) in initial_guess()
[all …]
|
| D | gamma_inva.hpp | 100 T guess; in gamma_inva_imp() local
112 guess = 1 + inverse_poisson_cornish_fisher(z, q, p, pol); in gamma_inva_imp()
119 else if(guess > 10) in gamma_inva_imp()
123 if(guess < 1.1) in gamma_inva_imp()
129 guess = z * 1.2f; in gamma_inva_imp()
133 guess = -0.4f / log(z); in gamma_inva_imp()
145 std::pair<T, T> r = bracket_and_solve_root(f, guess, factor, false, tol, max_iter, pol); in gamma_inva_imp()
|
| /third_party/boost/boost/math/special_functions/ |
| D | cbrt.hpp | 85 T guess = frexp(z, &i_exp); in cbrt_imp() local
87 guess = tools::evaluate_polynomial(P, guess); in cbrt_imp()
97 guess *= shift_type(1u) << i_exp3; in cbrt_imp()
99 guess /= shift_type(1u) << -i_exp3; in cbrt_imp()
103 guess = ldexp(guess, i_exp3); in cbrt_imp()
106 guess *= correction[i_exp + 2]; in cbrt_imp()
132 T g3 = guess * guess * guess; in cbrt_imp()
134 guess *= diff; in cbrt_imp()
146 T g2 = guess * guess; in cbrt_imp()
147 diff = (g2 - z / guess) / (2 * guess + z / g2); in cbrt_imp()
[all …]
|
| /third_party/boost/boost/math/tools/ |
| D | roots.hpp | 95 T& guess, in handle_zero_derivative() argument
105 guess = max; in handle_zero_derivative()
109 guess = min; in handle_zero_derivative()
111 unpack_0(f(guess), last_f0); in handle_zero_derivative()
112 delta = guess - result; in handle_zero_derivative()
236 T newton_raphson_iterate(F f, T guess, T min, T max, int digits, boost::uintmax_t& max_iter) BOOST_… in newton_raphson_iterate() argument
247 T result = guess; in newton_raphson_iterate()
270 … std::cout << "Newton_raphson_iterate, guess = " << guess << ", min = " << min << ", max = " << max in newton_raphson_iterate()
288 detail::handle_zero_derivative(f, last_f0, f0, delta, result, guess, min, max); in newton_raphson_iterate()
312 guess = result; in newton_raphson_iterate()
[all …]
|
| /third_party/flutter/skia/third_party/externals/icu/source/i18n/ |
| D | double-conversion-strtod.cpp | 439 double* guess) { in ComputeGuess() argument
441 *guess = 0.0; in ComputeGuess()
445 *guess = Double::Infinity(); in ComputeGuess()
449 *guess = 0.0; in ComputeGuess()
453 if (DoubleStrtod(trimmed, exponent, guess) || in ComputeGuess()
454 DiyFpStrtod(trimmed, exponent, guess)) { in ComputeGuess()
457 if (*guess == Double::Infinity()) { in ComputeGuess()
471 double guess; in Strtod() local
472 bool is_correct = ComputeGuess(trimmed, exponent, &guess); in Strtod()
473 if (is_correct) return guess; in Strtod()
[all …]
|
| /third_party/boost/boost/math/distributions/detail/ |
| D | inv_discrete_quantile.hpp | 77 typename Dist::value_type guess, in do_inverse_discrete_quantile() argument
97 if(guess > max_bound) in do_inverse_discrete_quantile()
98 guess = max_bound; in do_inverse_discrete_quantile()
99 if(guess < min_bound) in do_inverse_discrete_quantile()
100 guess = min_bound; in do_inverse_discrete_quantile()
102 value_type fa = f(guess); in do_inverse_discrete_quantile()
104 …value_type fb(fa), a(guess), b =0; // Compiler warning C4701: potentially uninitialized local vari… in do_inverse_discrete_quantile()
107 return guess; in do_inverse_discrete_quantile()
112 if(guess < 10) in do_inverse_discrete_quantile()
369 const typename Dist::value_type& guess, in inverse_discrete_quantile() argument
[all …]
|
| D | generic_mode.hpp | 32 typename Dist::value_type generic_find_mode(const Dist& dist, typename Dist::value_type guess, cons… in generic_find_mode() argument
41 value_type upper_bound = guess; in generic_find_mode()
43 value_type v = pdf(dist, guess); in generic_find_mode()
52 …te a starting location for the search for the mode, original guess was %1%", guess, policy_type()); in generic_find_mode()
97 typename Dist::value_type generic_find_mode_01(const Dist& dist, typename Dist::value_type guess, c… in generic_find_mode_01() argument
106 value_type upper_bound = guess; in generic_find_mode_01()
108 value_type v = pdf(dist, guess); in generic_find_mode_01()
|
| /third_party/icu/icu4c/source/i18n/ |
| D | double-conversion-strtod.cpp | 434 double* guess) { in ComputeGuess() argument
436 *guess = 0.0; in ComputeGuess()
440 *guess = Double::Infinity(); in ComputeGuess()
444 *guess = 0.0; in ComputeGuess()
448 if (DoubleStrtod(trimmed, exponent, guess) || in ComputeGuess()
449 DiyFpStrtod(trimmed, exponent, guess)) { in ComputeGuess()
452 if (*guess == Double::Infinity()) { in ComputeGuess()
485 double guess; in StrtodTrimmed() local
486 const bool is_correct = ComputeGuess(trimmed, exponent, &guess); in StrtodTrimmed()
488 return guess; in StrtodTrimmed()
[all …]
|
| /third_party/skia/third_party/externals/icu/source/i18n/ |
| D | double-conversion-strtod.cpp | 434 double* guess) { in ComputeGuess() argument
436 *guess = 0.0; in ComputeGuess()
440 *guess = Double::Infinity(); in ComputeGuess()
444 *guess = 0.0; in ComputeGuess()
448 if (DoubleStrtod(trimmed, exponent, guess) || in ComputeGuess()
449 DiyFpStrtod(trimmed, exponent, guess)) { in ComputeGuess()
452 if (*guess == Double::Infinity()) { in ComputeGuess()
485 double guess; in StrtodTrimmed() local
486 const bool is_correct = ComputeGuess(trimmed, exponent, &guess); in StrtodTrimmed()
488 return guess; in StrtodTrimmed()
[all …]
|
| /third_party/node/deps/icu-small/source/i18n/ |
| D | double-conversion-strtod.cpp | 434 double* guess) { in ComputeGuess() argument
436 *guess = 0.0; in ComputeGuess()
440 *guess = Double::Infinity(); in ComputeGuess()
444 *guess = 0.0; in ComputeGuess()
448 if (DoubleStrtod(trimmed, exponent, guess) || in ComputeGuess()
449 DiyFpStrtod(trimmed, exponent, guess)) { in ComputeGuess()
452 if (*guess == Double::Infinity()) { in ComputeGuess()
485 double guess; in StrtodTrimmed() local
486 const bool is_correct = ComputeGuess(trimmed, exponent, &guess); in StrtodTrimmed()
488 return guess; in StrtodTrimmed()
[all …]
|
| /third_party/icu/vendor/double-conversion/upstream/double-conversion/ |
| D | strtod.cc | 420 double* guess) { in ComputeGuess() argument
422 *guess = 0.0; in ComputeGuess()
426 *guess = Double::Infinity(); in ComputeGuess()
430 *guess = 0.0; in ComputeGuess()
434 if (DoubleStrtod(trimmed, exponent, guess) || in ComputeGuess()
435 DiyFpStrtod(trimmed, exponent, guess)) { in ComputeGuess()
438 if (*guess == Double::Infinity()) { in ComputeGuess()
469 double guess; in StrtodTrimmed() local
470 const bool is_correct = ComputeGuess(trimmed, exponent, &guess); in StrtodTrimmed()
472 return guess; in StrtodTrimmed()
[all …]
|
| /third_party/boost/libs/math/test/ |
| D | test_root_iterations.cpp | 156 double guess; in BOOST_AUTO_TEST_CASE() local
165 guess = result / 5; in BOOST_AUTO_TEST_CASE()
168 …r = boost::math::tools::bracket_and_solve_root(cbrt_functor_noderiv(arg), guess, 2.0, true, boost:… in BOOST_AUTO_TEST_CASE()
173 …dr = boost::math::tools::newton_raphson_iterate(cbrt_functor_deriv(arg), guess, guess / 2, result … in BOOST_AUTO_TEST_CASE()
178 …dr = boost::math::tools::halley_iterate(cbrt_functor_2deriv(arg), guess, result / 10, result * 10,… in BOOST_AUTO_TEST_CASE()
183 …dr = boost::math::tools::schroder_iterate(cbrt_functor_2deriv(arg), guess, result / 10, result * 1… in BOOST_AUTO_TEST_CASE()
190 guess = result * 5; in BOOST_AUTO_TEST_CASE()
191 …r = boost::math::tools::bracket_and_solve_root(cbrt_functor_noderiv(arg), guess, 2.0, true, boost:… in BOOST_AUTO_TEST_CASE()
196 …dr = boost::math::tools::newton_raphson_iterate(cbrt_functor_deriv(arg), guess, result / 10, resul… in BOOST_AUTO_TEST_CASE()
201 …dr = boost::math::tools::halley_iterate(cbrt_functor_2deriv(arg), guess, result / 10, result * 10,… in BOOST_AUTO_TEST_CASE()
[all …]
|
| D | test_roots.cpp | 198 double guess = 0.5; in inverse_ibeta_newton() local
224 …ibeta_roots_2<double, boost::math::policies::policy<> >(a, b, z, invert), guess, min, max, precisi… in inverse_ibeta_newton()
229 double guess = 0.5; in inverse_ibeta_newton_neg() local
255 …oots_2<double, boost::math::policies::policy<> >(a, b, z, invert, true), -guess, min, max, precisi… in inverse_ibeta_newton_neg()
260 double guess = 0.5; in inverse_ibeta_halley() local
286 …ibeta_roots_3<double, boost::math::policies::policy<> >(a, b, z, invert), guess, min, max, precisi… in inverse_ibeta_halley()
291 double guess = -0.5; in inverse_ibeta_halley_neg() local
317 …roots_3<double, boost::math::policies::policy<> >(a, b, z, invert, true), guess, min, max, precisi… in inverse_ibeta_halley_neg()
322 double guess = 0.5; in inverse_ibeta_schroder() local
348 …ibeta_roots_3<double, boost::math::policies::policy<> >(a, b, z, invert), guess, min, max, precisi… in inverse_ibeta_schroder()
[all …]
|
| /third_party/boost/libs/multiprecision/example/ |
| D | mpfr_precision.cpp | 147 mpfr_float guess = ibeta_inv((double)a, (double)b, 0.5); in beta_distribution_median_method_2() local
152 …f = boost::math::detail::ibeta_imp(a, b, guess, boost::math::policies::policy<>(), false, true, &f… in beta_distribution_median_method_2()
153 guess -= f / f1; in beta_distribution_median_method_2()
156 return guess; in beta_distribution_median_method_2()
185 mpfr_float guess = ibeta_inv((double)a_, (double)b_, 0.5); in beta_distribution_median_method_3() local
193 guess.precision(mpfr_float::default_precision()); in beta_distribution_median_method_3()
194 …f = boost::math::detail::ibeta_imp(a, b, guess, boost::math::policies::policy<>(), false, true, &f… in beta_distribution_median_method_3()
195 guess -= f / f1; in beta_distribution_median_method_3()
197 return guess; in beta_distribution_median_method_3()
|
| /third_party/boost/libs/math/example/ |
| D | root_finding_start_locations.cpp | 37 boost::uintmax_t cbrt_noderiv(T x, T guess) in cbrt_noderiv() argument
55 bracket_and_solve_root(cbrt_functor_noderiv<T>(x), guess, factor, is_rising, tol, it); in cbrt_noderiv()
78 boost::uintmax_t cbrt_deriv(T x, T guess) in cbrt_deriv() argument
82 T min = guess / 100; // We don't really know what this should be! in cbrt_deriv()
83 T max = guess * 100; // We don't really know what this should be! in cbrt_deriv()
89 newton_raphson_iterate(cbrt_functor_deriv<T>(x), guess, min, max, get_digits, it); in cbrt_deriv()
114 boost::uintmax_t cbrt_2deriv(T x, T guess) in cbrt_2deriv() argument
119 T min = guess / 100; // We don't really know what this should be! in cbrt_2deriv()
120 T max = guess * 100; // We don't really know what this should be! in cbrt_2deriv()
126 halley_iterate(cbrt_functor_2deriv<T>(x), guess, min, max, get_digits, maxit); in cbrt_2deriv()
[all …]
|
| D | root_finding_algorithms.cpp | 205 T guess; in cbrt_noderiv() local
210 guess = ldexp((T)1., exponent / 3); // Rough guess is to divide the exponent by three. in cbrt_noderiv()
215 guess = boost::math::cbrt<T>(dx); // Get guess using double. in cbrt_noderiv()
228 bracket_and_solve_root(cbrt_functor_noderiv<T>(x), guess, factor, is_rising, tol, it); in cbrt_noderiv()
259 T guess; in cbrt_deriv() local
263 … guess = ldexp(static_cast<T>(1), exponent / 3); // Rough guess is to divide the exponent by three. in cbrt_deriv()
266 guess = boost::math::cbrt(static_cast<double>(x)); in cbrt_deriv()
267 T min = guess / 2; // Minimum possible value is half our guess. in cbrt_deriv()
268 T max = 2 * guess; // Maximum possible value is twice our guess. in cbrt_deriv()
272 T result = newton_raphson_iterate(cbrt_functor_deriv<T>(x), guess, min, max, get_digits, it); in cbrt_deriv()
[all …]
|
| D | root_finding_example.cpp | 126 T guess = ldexp(1., exponent/3); // Rough guess is to divide the exponent by three. in cbrt_noderiv() local
139 …std::pair<T, T> r = bracket_and_solve_root(cbrt_functor_noderiv<T>(x), guess, factor, is_rising, t… in cbrt_noderiv()
231 …T guess = ldexp(1., exponent/3); // Rough guess is to divide the exponent by th… in cbrt_deriv() local
239 T result = newton_raphson_iterate(cbrt_functor_deriv<T>(x), guess, min, max, get_digits, it); in cbrt_deriv()
290 …T guess = ldexp(1., exponent/3); // Rough guess is to divide the exponent by th… in cbrt_2deriv() local
298 T result = halley_iterate(cbrt_functor_2deriv<T>(x), guess, min, max, get_digits, maxit); in cbrt_2deriv()
314 …T guess = ldexp(1., exponent / 3); // Rough guess is to divide the exponent by … in cbrt_2deriv_lambda() local
325 guess, min, max, get_digits, maxit); in cbrt_2deriv_lambda()
418 T guess = ldexp(1., exponent / 5); // Rough guess is to divide the exponent by five. in fifth_2deriv() local
425 T result = halley_iterate(fifth_functor_2deriv<T>(x), guess, min, max, digits, it); in fifth_2deriv()
|
| /third_party/boost/boost/math/distributions/ |
| D | poisson.hpp | 414 RealType guess, factor = 8; in quantile() local
417 guess = z; in quantile()
419 guess = boost::math::detail::inverse_poisson_cornish_fisher(z, p, RealType(1-p), Policy()); in quantile()
426 else if(guess > 10) in quantile()
430 if(guess < 1.1) in quantile()
438 guess, in quantile()
484 RealType guess, factor = 8; in quantile() local
487 guess = z; in quantile()
489 guess = boost::math::detail::inverse_poisson_cornish_fisher(z, RealType(1-q), q, Policy()); in quantile()
496 else if(guess > 10) in quantile()
[all …]
|
| D | negative_binomial.hpp | 477 RealType guess = 0; in quantile() local
480 …guess = detail::inverse_negative_binomial_cornish_fisher(r, p, RealType(1-p), P, RealType(1-P), Po… in quantile()
482 if(guess < 10) in quantile()
487 guess = (std::min)(RealType(r * 2), RealType(10)); in quantile()
490 factor = (1-P < sqrt(tools::epsilon<RealType>())) ? 2 : (guess < 20 ? 1.2f : 1.1f); in quantile()
491 BOOST_MATH_INSTRUMENT_CODE("guess = " << guess); in quantile()
501 guess, in quantile()
564 RealType guess = 0; in quantile() local
567 …guess = detail::inverse_negative_binomial_cornish_fisher(r, p, RealType(1-p), RealType(1-Q), Q, Po… in quantile()
569 if(guess < 10) in quantile()
[all …]
|
| /third_party/node/lib/internal/modules/esm/ |
| D | resolve.js | 219 let guess;
222 if (fileExists(guess = new URL(`./${packageConfig.main}`,
224 return guess;
225 } else if (fileExists(guess = new URL(`./${packageConfig.main}.js`,
227 else if (fileExists(guess = new URL(`./${packageConfig.main}.json`,
229 else if (fileExists(guess = new URL(`./${packageConfig.main}.node`,
231 else if (fileExists(guess = new URL(`./${packageConfig.main}/index.js`,
233 else if (fileExists(guess = new URL(`./${packageConfig.main}/index.json`,
235 else if (fileExists(guess = new URL(`./${packageConfig.main}/index.node`,
237 else guess = undefined;
[all …]
|
| /third_party/icu/icu4c/source/test/perf/collationperf/ |
| D | collperf.cpp | 502 int guess = -1; in doBinarySearch() local
505 if (newGuess == guess) in doBinarySearch()
507 guess = newGuess; in doBinarySearch()
509 r = (*pf)((gSortedLines[line])->name, (gSortedLines[guess])->name); in doBinarySearch()
515 hi = guess; in doBinarySearch()
517 lo = guess; in doBinarySearch()
540 int guess = -1; in doBinarySearch() local
543 if (newGuess == guess) in doBinarySearch()
545 guess = newGuess; in doBinarySearch()
549 … ri = strcmp((gSortedLines[line])->icuSortKey, (gSortedLines[guess])->icuSortKey); in doBinarySearch()
[all …]
|
| /third_party/ffmpeg/libavutil/ |
| D | fixed_dsp.h | 178 int retval, bit_mask, guess, square, i; in fixed_sqrt() local
191 guess = retval + bit_mask; in fixed_sqrt()
192 accu = (int64_t)guess * guess; in fixed_sqrt()
|
| /third_party/icu/icu4j/perf-tests/src/com/ibm/icu/dev/test/perf/ |
| D | CollationPerformanceTest.java | 345 int guess = -1; in doBinarySearch() local
348 if(newGuess == guess){ in doBinarySearch()
351 guess = newGuess; in doBinarySearch()
352 r = tests[j].compareTo(tests[guess]); in doBinarySearch()
358 hi = guess; in doBinarySearch()
360 lo = guess; in doBinarySearch()
376 int guess = -1; in doBinarySearch() local
379 if(newGuess == guess){ in doBinarySearch()
382 guess = newGuess; in doBinarySearch()
383 …r = com.ibm.icu.text.Normalizer.compare(tests[j], tests[guess], Normalizer.COMPARE_CODE_POINT_ORDE… in doBinarySearch()
[all …]
|