Searched refs:to_root (Results 1 – 4 of 4) sorted by relevance
| /third_party/boost/libs/math/example/ |
| D | root_finding_start_locations.cpp | 313 double to_root = 500; in main() local
320 << cbrt_noderiv(to_root, answer / 6) in main()
321 << "][" << cbrt_noderiv(to_root, answer / 2) in main()
322 << "][" << cbrt_noderiv(to_root, answer - answer * 0.5) in main()
323 << "][" << cbrt_noderiv(to_root, answer - answer * 0.2) in main()
324 << "][" << cbrt_noderiv(to_root, answer - answer * 0.1) in main()
325 << "][" << cbrt_noderiv(to_root, answer - answer * 0.05) in main()
326 << "][" << cbrt_noderiv(to_root, answer + answer * 0.05) in main()
327 << "][" << cbrt_noderiv(to_root, answer + answer * 0.1) in main()
328 << "][" << cbrt_noderiv(to_root, answer + answer * 0.2) in main()
[all …]
|
| D | root_finding_algorithms.cpp | 376 T to_root = static_cast<T>(big_value); in test_root() local
444 result = boost::math::cbrt(to_root); // in test_root()
467 result = cbrt_noderiv<T>(to_root); // in test_root()
490 result = cbrt_deriv(to_root); // in test_root()
514 result = cbrt_2deriv(to_root); // in test_root()
538 result = cbrt_2deriv_s(to_root); // in test_root()
|
| D | root_n_finding_algorithms.cpp | 457 T to_root = static_cast<T>(big_value); in test_root() local
479 result = nth_root_noderiv<N, T>(to_root); // in test_root()
501 result = nth_root_1deriv<N, T>(to_root); // in test_root()
524 result = nth_root_2deriv<N>(to_root); // in test_root()
546 result = nth_root_2deriv_s<N>(to_root); // in test_root()
|
| /third_party/python/Lib/ |
| D | pathlib.py | 807 to_drv, to_root, to_parts = self._parse_args(other)
808 if to_root:
809 to_abs_parts = [to_drv, to_root] + to_parts[1:]
815 formatted = self._format_parsed_parts(to_drv, to_root, to_parts)
|