| /dports/science/py-dlib/dlib-19.22/examples/ |
| H A D | bsp_ex.cpp | 56 void bsp_job_node_0 (bsp_context& bsp, double& min_value, double& optimal_x);
120 double min_value, optimal_x; in main() local
131 bsp_connect(hosts, bsp_job_node_0, dlib::ref(min_value), dlib::ref(optimal_x)); in main()
136 cout << "optimal_x: "<< optimal_x << endl; in main()
160 void bsp_job_node_0 (bsp_context& bsp, double& min_value, double& optimal_x) in bsp_job_node_0() argument
212 optimal_x = val.first; in bsp_job_node_0()
218 left = optimal_x - interval_width/2; in bsp_job_node_0()
219 right = optimal_x + interval_width/2; in bsp_job_node_0()
|
| /dports/science/dlib-cpp/dlib-19.22/examples/ |
| H A D | bsp_ex.cpp | 56 void bsp_job_node_0 (bsp_context& bsp, double& min_value, double& optimal_x);
120 double min_value, optimal_x; in main() local
131 bsp_connect(hosts, bsp_job_node_0, dlib::ref(min_value), dlib::ref(optimal_x)); in main()
136 cout << "optimal_x: "<< optimal_x << endl; in main()
160 void bsp_job_node_0 (bsp_context& bsp, double& min_value, double& optimal_x) in bsp_job_node_0() argument
212 optimal_x = val.first; in bsp_job_node_0()
218 left = optimal_x - interval_width/2; in bsp_job_node_0()
219 right = optimal_x + interval_width/2; in bsp_job_node_0()
|
| /dports/misc/openmvg/openMVG-2.0/src/third_party/ceres-solver/internal/ceres/ |
| H A D | polynomial_test.cc | 254 double optimal_x = 0.0; in TEST() local
258 MinimizePolynomial(polynomial, min_x, max_x, &optimal_x, &optimal_value); in TEST()
261 EXPECT_LE(optimal_x, max_x); in TEST()
262 EXPECT_GE(optimal_x, min_x); in TEST()
272 double optimal_x = 0.0; in TEST() local
276 MinimizePolynomial(polynomial, min_x, max_x, &optimal_x, &optimal_value); in TEST()
278 EXPECT_EQ(optimal_x, 0.0); in TEST()
292 double optimal_x = 0.0; in TEST() local
297 EXPECT_EQ(optimal_x, 3.0/2.0); in TEST()
303 EXPECT_EQ(optimal_x, 1.0); in TEST()
[all …]
|
| H A D | polynomial.cc | 278 double* optimal_x, in MinimizePolynomial() argument
285 *optimal_x = (x_min + x_max) / 2.0; in MinimizePolynomial()
286 *optimal_value = EvaluatePolynomial(polynomial, *optimal_x); in MinimizePolynomial()
291 *optimal_x = x_min; in MinimizePolynomial()
297 *optimal_x = x_max; in MinimizePolynomial()
324 *optimal_x = root; in MinimizePolynomial()
375 double* optimal_x, in MinimizeInterpolatingPolynomial() argument
378 MinimizePolynomial(polynomial, x_min, x_max, optimal_x, optimal_value); in MinimizeInterpolatingPolynomial()
387 *optimal_x = sample.x; in MinimizeInterpolatingPolynomial()
|
| H A D | polynomial.h | 85 double* optimal_x,
110 double* optimal_x,
|
| /dports/math/ceres-solver/ceres-solver-2.0.0/internal/ceres/ |
| H A D | polynomial_test.cc | 255 double optimal_x = 0.0; in TEST() local
259 MinimizePolynomial(polynomial, min_x, max_x, &optimal_x, &optimal_value); in TEST()
262 EXPECT_LE(optimal_x, max_x); in TEST()
263 EXPECT_GE(optimal_x, min_x); in TEST()
273 double optimal_x = 0.0; in TEST() local
277 MinimizePolynomial(polynomial, min_x, max_x, &optimal_x, &optimal_value); in TEST()
279 EXPECT_EQ(optimal_x, 0.0); in TEST()
292 double optimal_x = 0.0; in TEST() local
297 EXPECT_EQ(optimal_x, 3.0 / 2.0); in TEST()
303 EXPECT_EQ(optimal_x, 1.0); in TEST()
[all …]
|
| H A D | polynomial.cc | 278 double* optimal_x, in MinimizePolynomial() argument
285 *optimal_x = (x_min + x_max) / 2.0; in MinimizePolynomial()
286 *optimal_value = EvaluatePolynomial(polynomial, *optimal_x); in MinimizePolynomial()
291 *optimal_x = x_min; in MinimizePolynomial()
297 *optimal_x = x_max; in MinimizePolynomial()
324 *optimal_x = root; in MinimizePolynomial()
375 double* optimal_x, in MinimizeInterpolatingPolynomial() argument
378 MinimizePolynomial(polynomial, x_min, x_max, optimal_x, optimal_value); in MinimizeInterpolatingPolynomial()
387 *optimal_x = sample.x; in MinimizeInterpolatingPolynomial()
|
| H A D | polynomial.h | 86 double* optimal_x,
113 double* optimal_x,
|
| /dports/graphics/blender/blender-2.91.0/extern/ceres/internal/ceres/ |
| H A D | polynomial.cc | 278 double* optimal_x, in MinimizePolynomial() argument
285 *optimal_x = (x_min + x_max) / 2.0; in MinimizePolynomial()
286 *optimal_value = EvaluatePolynomial(polynomial, *optimal_x); in MinimizePolynomial()
291 *optimal_x = x_min; in MinimizePolynomial()
297 *optimal_x = x_max; in MinimizePolynomial()
324 *optimal_x = root; in MinimizePolynomial()
375 double* optimal_x, in MinimizeInterpolatingPolynomial() argument
378 MinimizePolynomial(polynomial, x_min, x_max, optimal_x, optimal_value); in MinimizeInterpolatingPolynomial()
387 *optimal_x = sample.x; in MinimizeInterpolatingPolynomial()
|
| H A D | polynomial.h | 85 double* optimal_x,
110 double* optimal_x,
|
| /dports/science/py-dlib/dlib-19.22/dlib/test/ |
| H A D | bsp.cpp | 435 double& optimal_x in bsp_job_node_0() argument
458 optimal_x = val.first; in bsp_job_node_0()
463 left = optimal_x - interval_width/2; in bsp_job_node_0()
464 right = optimal_x + interval_width/2; in bsp_job_node_0()
519 double min_value = 10, optimal_x = 0; in dotest6() local
520 bsp_connect(hosts, bsp_job_node_0, dlib::ref(min_value), dlib::ref(optimal_x)); in dotest6()
523 dlog << LINFO << "optimal_x: " << optimal_x; in dotest6()
525 DLIB_TEST(std::abs(optimal_x - 2) < 1e-14); in dotest6()
|
| /dports/science/dlib-cpp/dlib-19.22/dlib/test/ |
| H A D | bsp.cpp | 435 double& optimal_x in bsp_job_node_0() argument
458 optimal_x = val.first; in bsp_job_node_0()
463 left = optimal_x - interval_width/2; in bsp_job_node_0()
464 right = optimal_x + interval_width/2; in bsp_job_node_0()
519 double min_value = 10, optimal_x = 0; in dotest6() local
520 bsp_connect(hosts, bsp_job_node_0, dlib::ref(min_value), dlib::ref(optimal_x)); in dotest6()
523 dlog << LINFO << "optimal_x: " << optimal_x; in dotest6()
525 DLIB_TEST(std::abs(optimal_x - 2) < 1e-14); in dotest6()
|
| /dports/biology/py-macs2/MACS-2.2.7.1/MACS2/IO/ |
| H A D | CallPeakUnit.pyx | 267 float32_t optimal_x, optimal_y
|