Home
last modified time | relevance | path

Searched refs:max_iter (Results 1 – 25 of 86) sorted by relevance

1234

/third_party/boost/libs/compute/test/
Dtest_extrema.cpp68 boost::compute::vector<int_>::iterator max_iter = in BOOST_AUTO_TEST_CASE() local
70 BOOST_CHECK(max_iter == vector.end() - 512); in BOOST_AUTO_TEST_CASE()
72 BOOST_CHECK_EQUAL(max_iter.read(queue), 513); in BOOST_AUTO_TEST_CASE()
112 max_iter = boost::compute::detail::find_extrema_on_cpu( in BOOST_AUTO_TEST_CASE()
115 BOOST_CHECK(max_iter == vector.end() - 512); in BOOST_AUTO_TEST_CASE()
117 BOOST_CHECK_EQUAL(max_iter.read(queue), 513); in BOOST_AUTO_TEST_CASE()
138 max_iter = boost::compute::detail::find_extrema_with_reduce( in BOOST_AUTO_TEST_CASE()
141 BOOST_CHECK(max_iter == vector.end() - 512); in BOOST_AUTO_TEST_CASE()
143 BOOST_CHECK_EQUAL(max_iter.read(queue), 513); in BOOST_AUTO_TEST_CASE()
153 max_iter = boost::compute::detail::find_extrema_with_atomics( in BOOST_AUTO_TEST_CASE()
[all …]
/third_party/boost/boost/math/tools/
Dtoms748_solve.hpp295 …ax, const T& bx, const T& fax, const T& fbx, Tol tol, boost::uintmax_t& max_iter, const Policy& po… in toms748_solve() argument
308 if (max_iter == 0) in toms748_solve()
311 boost::uintmax_t count = max_iter; in toms748_solve()
327 max_iter = 0; in toms748_solve()
464 max_iter -= count; in toms748_solve()
473 BOOST_MATH_LOG_COUNT(max_iter) in toms748_solve()
478 …lve(F f, const T& ax, const T& bx, const T& fax, const T& fbx, Tol tol, boost::uintmax_t& max_iter) in toms748_solve() argument
480 return toms748_solve(f, ax, bx, fax, fbx, tol, max_iter, policies::policy<>()); in toms748_solve()
484 …toms748_solve(F f, const T& ax, const T& bx, Tol tol, boost::uintmax_t& max_iter, const Policy& po… in toms748_solve() argument
486 if (max_iter <= 2) in toms748_solve()
[all …]
Droots.hpp143 std::pair<T, T> bisect(F f, T min, T max, Tol tol, boost::uintmax_t& max_iter, const Policy& pol) B… in bisect() argument
149 max_iter = 2; in bisect()
154 max_iter = 2; in bisect()
176 boost::uintmax_t count = max_iter; in bisect()
205 max_iter -= count; in bisect()
208 std::cout << "Bisection iteration, final count = " << max_iter << std::endl; in bisect()
211 if (max_iter > max_count) in bisect()
213 max_count = max_iter; in bisect()
214 std::cout << "Maximum iterations: " << max_iter << std::endl; in bisect()
222 inline std::pair<T, T> bisect(F f, T min, T max, Tol tol, boost::uintmax_t& max_iter) BOOST_NOEXCE… in bisect() argument
[all …]
Drecurrence.hpp102 …n_ratio_from_backwards_recurrence(const Recurrence& r, const T& factor, boost::uintmax_t& max_iter) in function_ratio_from_backwards_recurrence() argument
105 return boost::math::tools::continued_fraction_a(f, factor, max_iter); in function_ratio_from_backwards_recurrence()
123 …on_ratio_from_forwards_recurrence(const Recurrence& r, const T& factor, boost::uintmax_t& max_iter) in function_ratio_from_forwards_recurrence() argument
126 return boost::math::tools::continued_fraction_a(f, factor, max_iter); in function_ratio_from_forwards_recurrence()
250 …boost::uintmax_t max_iter = boost::math::policies::get_max_series_iterations<boost::math::policies… in forward_recurrence_iterator() local
251 …offsetter<Recurrence>(r, -1), value_type(boost::math::tools::epsilon<value_type>() * 2), max_iter); in forward_recurrence_iterator()
252 …lue_type>("forward_recurrence_iterator<>::forward_recurrence_iterator", max_iter, boost::math::pol… in forward_recurrence_iterator()
292 …boost::uintmax_t max_iter = boost::math::policies::get_max_series_iterations<boost::math::policies… in backward_recurrence_iterator() local
293 …_offsetter<Recurrence>(r, 1), value_type(boost::math::tools::epsilon<value_type>() * 2), max_iter); in backward_recurrence_iterator()
294 …e_type>("backward_recurrence_iterator<>::backward_recurrence_iterator", max_iter, boost::math::pol… in backward_recurrence_iterator()
/third_party/boost/boost/math/distributions/detail/
Dinv_discrete_quantile.hpp81 boost::uintmax_t& max_iter) in do_inverse_discrete_quantile() argument
103 boost::uintmax_t count = max_iter - 1; in do_inverse_discrete_quantile()
240 max_iter -= count; in do_inverse_discrete_quantile()
241 max_iter += 1; in do_inverse_discrete_quantile()
257 max_iter -= count; in do_inverse_discrete_quantile()
278 max_iter += count; in do_inverse_discrete_quantile()
279 BOOST_MATH_INSTRUMENT_CODE("max_iter = " << max_iter << " count = " << count); in do_inverse_discrete_quantile()
373 boost::uintmax_t& max_iter) in inverse_discrete_quantile() argument
391 max_iter); in inverse_discrete_quantile()
404 boost::uintmax_t& max_iter) in inverse_discrete_quantile() argument
[all …]
Dgeneric_mode.hpp75 boost::uintmax_t max_iter = policies::get_max_root_iterations<policy_type>(); in generic_find_mode() local
82 max_iter).first; in generic_find_mode()
83 if(max_iter >= policies::get_max_root_iterations<policy_type>()) in generic_find_mode()
128 boost::uintmax_t max_iter = policies::get_max_root_iterations<policy_type>(); in generic_find_mode_01() local
135 max_iter).first; in generic_find_mode_01()
136 if(max_iter >= policies::get_max_root_iterations<policy_type>()) in generic_find_mode_01()
/third_party/boost/boost/math/special_functions/detail/
Dhypergeometric_1F1_by_ratios.hpp110 boost::uintmax_t max_iter = boost::math::policies::get_max_series_iterations<Policy>(); in hypergeometric_1F1_from_function_ratio_negative_b() local
112 …o_from_backwards_recurrence(coef2, boost::math::policies::get_epsilon<T, Policy>(), max_iter) * M2; in hypergeometric_1F1_from_function_ratio_negative_b()
113 …h::hypergeometric_1F1_from_function_ratio_negative_b_positive_a<%1%>(%1%,%1%,%1%)", max_iter, pol); in hypergeometric_1F1_from_function_ratio_negative_b()
137 boost::uintmax_t max_iter = boost::math::policies::get_max_series_iterations<Policy>(); in hypergeometric_1F1_from_function_ratio_negative_b() local
139 …n_ratio_from_backwards_recurrence(coef, boost::math::policies::get_epsilon<T, Policy>(), max_iter); in hypergeometric_1F1_from_function_ratio_negative_b()
140 …h::hypergeometric_1F1_from_function_ratio_negative_b_positive_a<%1%>(%1%,%1%,%1%)", max_iter, pol); in hypergeometric_1F1_from_function_ratio_negative_b()
579 boost::uintmax_t max_iter = boost::math::policies::get_max_series_iterations<Policy>(); in hypergeometric_1F1_from_function_ratio_negative_b_forwards() local
581 …on_ratio_from_forwards_recurrence(coef, boost::math::policies::get_epsilon<T, Policy>(), max_iter); in hypergeometric_1F1_from_function_ratio_negative_b_forwards()
582 …h::hypergeometric_1F1_from_function_ratio_negative_b_positive_a<%1%>(%1%,%1%,%1%)", max_iter, pol); in hypergeometric_1F1_from_function_ratio_negative_b_forwards()
628 boost::uintmax_t max_iter = boost::math::policies::get_max_series_iterations<Policy>(); in hypergeometric_1F1_from_function_ratio_negative_ab() local
[all …]
Dhypergeometric_1F1_addition_theorems_on_z.hpp82 boost::uintmax_t max_iter = boost::math::policies::get_max_series_iterations<Policy>(); in hypergeometric_1f1_recurrence_on_z_minus_zero() local
83 …ult = boost::math::tools::sum_series(s, boost::math::policies::get_epsilon<T, Policy>(), max_iter); 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()
127 boost::uintmax_t max_iter = boost::math::policies::get_max_series_iterations<Policy>();
128 …ult = boost::math::tools::sum_series(s, boost::math::policies::get_epsilon<T, Policy>(), max_iter);
129 …s<T>("boost::math::hypergeometric_1f1_recurrence_on_z_plus_plus<%1%>(%1%,%1%,%1%)", max_iter, pol);
166 boost::uintmax_t max_iter = boost::math::policies::get_max_series_iterations<Policy>();
167 …ult = boost::math::tools::sum_series(s, boost::math::policies::get_epsilon<T, Policy>(), max_iter);
168 …s<T>("boost::math::hypergeometric_1f1_recurrence_on_z_plus_plus<%1%>(%1%,%1%,%1%)", max_iter, pol);
205 boost::uintmax_t max_iter = boost::math::policies::get_max_series_iterations<Policy>();
[all …]
Dbessel_jy_derivatives_series.hpp69 boost::uintmax_t max_iter = boost::math::policies::get_max_series_iterations<Policy>(); in bessel_j_derivative_small_z_series() local
72 …boost::math::tools::sum_series(s, boost::math::policies::get_epsilon<T, Policy>(), max_iter, zero); in bessel_j_derivative_small_z_series()
74 …ult = boost::math::tools::sum_series(s, boost::math::policies::get_epsilon<T, Policy>(), max_iter); in bessel_j_derivative_small_z_series()
76 …ries_iterations<T>("boost::math::bessel_j_derivative_small_z_series<%1%>(%1%,%1%)", max_iter, pol); in bessel_j_derivative_small_z_series()
183 boost::uintmax_t max_iter = boost::math::policies::get_max_series_iterations<Policy>(); in bessel_y_derivative_small_z_series() local
186 …boost::math::tools::sum_series(s, boost::math::policies::get_epsilon<T, Policy>(), max_iter, zero); in bessel_y_derivative_small_z_series()
188 …ult = boost::math::tools::sum_series(s, boost::math::policies::get_epsilon<T, Policy>(), max_iter); in bessel_y_derivative_small_z_series()
190 …ries_iterations<T>("boost::math::bessel_y_derivative_small_z_series<%1%>(%1%,%1%)", max_iter, pol); in bessel_y_derivative_small_z_series()
205 max_iter = boost::math::policies::get_max_series_iterations<Policy>(); in bessel_y_derivative_small_z_series()
207 …oost::math::tools::sum_series(s2, boost::math::policies::get_epsilon<T, Policy>(), max_iter, zero); in bessel_y_derivative_small_z_series()
[all …]
Dbessel_jy_series.hpp64 boost::uintmax_t max_iter = policies::get_max_series_iterations<Policy>(); in bessel_j_small_z_series() local
67 …boost::math::tools::sum_series(s, boost::math::policies::get_epsilon<T, Policy>(), max_iter, zero); in bessel_j_small_z_series()
69 …ult = boost::math::tools::sum_series(s, boost::math::policies::get_epsilon<T, Policy>(), max_iter); in bessel_j_small_z_series()
71 …s::check_series_iterations<T>("boost::math::bessel_j_small_z_series<%1%>(%1%,%1%)", max_iter, pol); in bessel_j_small_z_series()
180 boost::uintmax_t max_iter = policies::get_max_series_iterations<Policy>(); in bessel_y_small_z_series() local
184 …boost::math::tools::sum_series(s, boost::math::policies::get_epsilon<T, Policy>(), max_iter, zero); in bessel_y_small_z_series()
186 …ult = boost::math::tools::sum_series(s, boost::math::policies::get_epsilon<T, Policy>(), max_iter); in bessel_y_small_z_series()
188 …s::check_series_iterations<T>("boost::math::bessel_y_small_z_series<%1%>(%1%,%1%)", max_iter, pol); in bessel_y_small_z_series()
202 max_iter = policies::get_max_series_iterations<Policy>(); in bessel_y_small_z_series()
204 …oost::math::tools::sum_series(s2, boost::math::policies::get_epsilon<T, Policy>(), max_iter, zero); in bessel_y_small_z_series()
[all …]
Dhypergeometric_1F1_large_abz.hpp85 boost::uintmax_t max_iter = boost::math::policies::get_max_series_iterations<Policy>(); in hypergeometric_1F1_igamma() local
86 …ult = boost::math::tools::sum_series(s, boost::math::policies::get_epsilon<T, Policy>(), max_iter); 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()
127 … boost::uintmax_t max_iter = boost::math::policies::get_max_series_iterations<Policy>(); in hypergeometric_1F1_shift_on_a() local
128 …ratio_from_backwards_recurrence(b_coef, boost::math::policies::get_epsilon<T, Policy>(), max_iter); in hypergeometric_1F1_shift_on_a()
129 …series_iterations<T>("boost::math::hypergeometric_1F1_large_abz<%1%>(%1%,%1%,%1%)", max_iter, pol); in hypergeometric_1F1_shift_on_a()
172 … boost::uintmax_t max_iter = boost::math::policies::get_max_series_iterations<Policy>(); in hypergeometric_1F1_shift_on_a() local
173 …ratio_from_backwards_recurrence(b_coef, boost::math::policies::get_epsilon<T, Policy>(), max_iter); in hypergeometric_1F1_shift_on_a()
174 …series_iterations<T>("boost::math::hypergeometric_1F1_large_abz<%1%>(%1%,%1%,%1%)", max_iter, pol); in hypergeometric_1F1_shift_on_a()
200 boost::uintmax_t max_iter = boost::math::policies::get_max_series_iterations<Policy>(); in hypergeometric_1F1_shift_on_a() local
[all …]
Dhypergeometric_1F1_cf.hpp42 boost::uintmax_t max_iter = boost::math::policies::get_max_series_iterations<Policy>(); in hypergeometric_1F1_cf() local
43 …math::tools::continued_fraction_a(func, boost::math::policies::get_epsilon<T, Policy>(), max_iter); in hypergeometric_1F1_cf()
44 boost::math::policies::check_series_iterations<T>(function, max_iter, pol); in hypergeometric_1F1_cf()
Dhypergeometric_1F1_bessel.hpp360 boost::uintmax_t max_iter = boost::math::policies::get_max_series_iterations<Policy>(); in hypergeometric_1F1_AS_13_3_7_tricomi() local
373 …ls::checked_sum_series(s, boost::math::policies::get_epsilon<T, Policy>(), max_iter, result, norm); in hypergeometric_1F1_AS_13_3_7_tricomi()
375 …ost::math::tools::sum_series(s, boost::math::policies::get_epsilon<T, Policy>(), max_iter, result); in hypergeometric_1F1_AS_13_3_7_tricomi()
406 …series_iterations<T>("boost::math::hypergeometric_1F1_AS_13_3_7<%1%>(%1%,%1%,%1%)", max_iter, pol); in hypergeometric_1F1_AS_13_3_7_tricomi()
451 boost::uintmax_t max_iter = boost::math::policies::get_max_series_iterations<Policy>(); in cyl_bessel_i_large_x_scaled() local
452 …ult = boost::math::tools::sum_series(s, boost::math::policies::get_epsilon<T, Policy>(), max_iter); in cyl_bessel_i_large_x_scaled()
453 …cies::check_series_iterations<T>("boost::math::cyl_bessel_i_large_x<%1%>(%1%,%1%)", max_iter, pol); in cyl_bessel_i_large_x_scaled()
578 boost::uintmax_t max_iter = boost::math::policies::get_max_series_iterations<Policy>(); in hypergeometric_1F1_AS_13_3_6() local
579 …ult = boost::math::tools::sum_series(s, boost::math::policies::get_epsilon<T, Policy>(), max_iter); in hypergeometric_1F1_AS_13_3_6()
580 …series_iterations<T>("boost::math::hypergeometric_1F1_AS_13_3_6<%1%>(%1%,%1%,%1%)", max_iter, pol); in hypergeometric_1F1_AS_13_3_6()
[all …]
Dhypergeometric_1F1_small_a_negative_b_by_ratio.hpp50 boost::uintmax_t max_iter = boost::math::policies::get_max_series_iterations<Policy>(); in hypergeometric_1F1_small_a_negative_b_by_ratio() local
51 …ergeometric_1F1_recurrence_b_coefficients<T>(a, b, z), boost::math::tools::epsilon<T>(), max_iter); in hypergeometric_1F1_small_a_negative_b_by_ratio()
52 …T>("boost::math::hypergeometric_1F1_small_a_negative_b_by_ratio<%1%>(%1%,%1%,%1%)", max_iter, pol); in hypergeometric_1F1_small_a_negative_b_by_ratio()
/third_party/boost/libs/math/test/compile_test/
Dtools_roots_inc_test.cpp29 boost::uintmax_t max_iter = 0; in compile_and_link_test() local
34 …lt<std::pair<double, double> >(boost::math::tools::bisect<F, double, Tol>(f, d, d, tol, max_iter)); in compile_and_link_test()
36 …k_result<double>(boost::math::tools::newton_raphson_iterate<F2, double>(f2, d, d, d, i, max_iter)); in compile_and_link_test()
37 check_result<double>(boost::math::tools::halley_iterate<F3, double>(f3, d, d, d, i, max_iter)); in compile_and_link_test()
38 check_result<double>(boost::math::tools::schroder_iterate<F3, double>(f3, d, d, d, i, max_iter)); in compile_and_link_test()
/third_party/boost/libs/math/tools/
Dhypergeometric_1F1_map_neg_b_fwd_recurrence.cpp76 boost::uintmax_t max_iter = 1000; in main() local
77 …a_and_b_coefficients<test_type>(a, b, z), std::numeric_limits<test_type>::epsilon() * 2, max_iter); in main()
109 boost::uintmax_t max_iter = 1000; in main() local
110 …a_and_b_coefficients<test_type>(a, b, z), std::numeric_limits<test_type>::epsilon() * 2, max_iter); in main()
128 boost::uintmax_t max_iter = 1000; in main() local
129 …a_and_b_coefficients<test_type>(a, b, z), std::numeric_limits<test_type>::epsilon() * 2, max_iter); in main()
155 boost::uintmax_t max_iter = 1000; in main() local
157 …a_and_b_coefficients<test_type>(a, b, z), std::numeric_limits<test_type>::epsilon() * 2, max_iter); in main()
174 boost::uintmax_t max_iter = 1000; in main() local
175 …a_and_b_coefficients<test_type>(a, b, z), std::numeric_limits<test_type>::epsilon() * 2, max_iter); in main()
/third_party/boost/libs/math/doc/roots/
Droots_without_derivatives.qbk19 boost::uintmax_t& max_iter);
36 boost::uintmax_t& max_iter,
48 boost::uintmax_t& max_iter);
58 boost::uintmax_t& max_iter,
69 boost::uintmax_t& max_iter);
78 boost::uintmax_t& max_iter,
90 boost::uintmax_t& max_iter);
101 boost::uintmax_t& max_iter,
166 boost::uintmax_t& max_iter);
175 boost::uintmax_t& max_iter,
[all …]
/third_party/boost/boost/math/distributions/
Dnon_central_beta.hpp41 boost::uintmax_t max_iter = policies::get_max_series_iterations<Policy>(); in non_central_beta_p() local
104 if(static_cast<boost::uintmax_t>(count + i - k) > max_iter) in non_central_beta_p()
122 boost::uintmax_t max_iter = policies::get_max_series_iterations<Policy>(); in non_central_beta_q() local
185 if(static_cast<boost::uintmax_t>(i - k) > max_iter) in non_central_beta_q()
201 if(static_cast<boost::uintmax_t>(count + k - i) > max_iter) in non_central_beta_q()
292 …(F f, const T& guess, T factor, bool rising, Tol tol, boost::uintmax_t& max_iter, const Policy& po… in bracket_and_solve_root_01() argument
306 boost::uintmax_t count = max_iter - 1; in bracket_and_solve_root_01()
325 if((max_iter - count) % 20 == 0) in bracket_and_solve_root_01()
350 max_iter -= count; in bracket_and_solve_root_01()
351 max_iter += 1; in bracket_and_solve_root_01()
[all …]
Dnon_central_chi_squared.hpp65 boost::uintmax_t max_iter = policies::get_max_series_iterations<Policy>(); in non_central_chi_square_q() local
92 for(i = k; static_cast<boost::uintmax_t>(i-k) < max_iter; ++i) in non_central_chi_square_q()
103 if(static_cast<boost::uintmax_t>(i-k) >= max_iter) in non_central_chi_square_q()
160 boost::uintmax_t max_iter = policies::get_max_series_iterations<Policy>(); in non_central_chi_square_p_ding() local
165 for(i = 1; static_cast<boost::uintmax_t>(i) < max_iter; ++i) in non_central_chi_square_p_ding()
177 if(static_cast<boost::uintmax_t>(i) >= max_iter) in non_central_chi_square_p_ding()
205 boost::uintmax_t max_iter = policies::get_max_series_iterations<Policy>(); in non_central_chi_square_p() local
273 }while((fabs(errorf / sum) > errtol) && (static_cast<boost::uintmax_t>(i) < max_iter)); in non_central_chi_square_p()
276 if(static_cast<boost::uintmax_t>(i) >= max_iter) in non_central_chi_square_p()
291 boost::uintmax_t max_iter = policies::get_max_series_iterations<Policy>(); in non_central_chi_square_pdf() local
[all …]
/third_party/boost/libs/math/example/
Dseries.cpp50 boost::uintmax_t max_iter = 1000; in log1p() local
52 return boost::math::tools::sum_series(s, std::numeric_limits<T>::epsilon(), max_iter); in log1p()
92 boost::uintmax_t max_iter = 1000; in log1p() local
94 …rn boost::math::tools::sum_series(s, std::complex<T>(std::numeric_limits<T>::epsilon()), max_iter); in log1p()
/third_party/boost/boost/math/special_functions/
Dlog1p.hpp108 boost::uintmax_t max_iter = policies::get_max_series_iterations<Policy>(); in log1p_imp() local
110 … result_type result = tools::sum_series(s, policies::get_epsilon<result_type, Policy>(), max_iter); in log1p_imp()
113 …result_type result = tools::sum_series(s, policies::get_epsilon<result_type, Policy>(), max_iter, … in log1p_imp()
115 policies::check_series_iterations<T>(function, max_iter, pol); in log1p_imp()
484 boost::uintmax_t max_iter = policies::get_max_series_iterations<Policy>(); in log1pmx() local
487 T result = boost::math::tools::sum_series(s, policies::get_epsilon<T, Policy>(), max_iter, zero); in log1pmx()
489 T result = boost::math::tools::sum_series(s, policies::get_epsilon<T, Policy>(), max_iter); in log1pmx()
491 policies::check_series_iterations<T>(function, max_iter, pol); in log1pmx()
Dhypergeometric_0F1.hpp49 boost::uintmax_t max_iter = policies::get_max_series_iterations<Policy>(); in hypergeometric_0F1_cf_imp() local
50 T cf = tools::continued_fraction_b(evaluator, policies::get_epsilon<T, Policy>(), max_iter); in hypergeometric_0F1_cf_imp()
51 policies::check_series_iterations<T>(function, max_iter, pol); in hypergeometric_0F1_cf_imp()
/third_party/boost/libs/compute/perf/
Dperf_bolt_max_element.cpp45 bolt::cl::device_vector<int>::iterator max_iter = device_vec.begin(); in main() local
49 max_iter = bolt::cl::max_element(device_vec.begin(), device_vec.end()); in main()
53 int device_max = *max_iter; in main()
/third_party/boost/libs/math/test/
Dtest_root_finding_concepts.cpp137 …boost::uintmax_t max_iter = boost::math::policies::get_max_root_iterations<boost::math::policies::… in BOOST_AUTO_TEST_CASE() local
138 p = boost::math::tools::bracket_and_solve_root(f1, x, 2.0, true, t, max_iter); in BOOST_AUTO_TEST_CASE()
144 max_iter = boost::math::policies::get_max_root_iterations<boost::math::policies::policy<> >(); in BOOST_AUTO_TEST_CASE()
145 p = boost::math::tools::toms748_solve(f1, 0.0, x, t, max_iter); in BOOST_AUTO_TEST_CASE()
159 max_iter = boost::math::policies::get_max_root_iterations<boost::math::policies::policy<> >(); in BOOST_AUTO_TEST_CASE()
160 …::tools::bracket_and_solve_root([x](double z){ return z * z * z - x; }, x, 2.0, true, t, max_iter); in BOOST_AUTO_TEST_CASE()
166 max_iter = boost::math::policies::get_max_root_iterations<boost::math::policies::policy<> >(); in BOOST_AUTO_TEST_CASE()
167 …p = boost::math::tools::toms748_solve([x](double z){ return z * z * z - x; }, 0.0, x, t, max_iter); in BOOST_AUTO_TEST_CASE()
/third_party/node/test/parallel/
Dtest-tls-alert-handling.js30 const max_iter = 20; constant
61 if (iter < max_iter) {
66 }, max_iter));

1234