| /dports/misc/vxl/vxl-3.3.2/contrib/mul/mmn/ |
| H A D | mmn_make_tri_tree.cxx | 71 double min_d=9e9; in mmn_make_tri_tree() local
76 if (best_i>n || D(v0,i)<min_d) in mmn_make_tri_tree()
77 { best_i=i; min_d=D(v0,i); } in mmn_make_tri_tree()
84 double min_d = D(arc.v1,arc.v2); in mmn_make_tri_tree() local
88 if (D(i,j)<min_d) in mmn_make_tri_tree()
108 double min_d=9e9; in mmn_make_tri_tree() local
171 double min_d=9e9; in mmn_make_tri_tree() local
177 { best_i=i; min_d=D(v0,i); } in mmn_make_tri_tree()
184 double min_d = D(arc.v1,arc.v2); in mmn_make_tri_tree() local
188 if (D(i,j)<min_d) in mmn_make_tri_tree()
[all …]
|
| /dports/devel/ppl/ppl-1.2/tests/Partially_Reduced_Product/ |
| H A D | maxmin1.cc | 103 Coefficient min_d; in test04() local
111 && prp.minimize(le, min_n, min_d, min) in test04()
113 && prp.minimize(le, min_n, min_d, min, pnt_min); in test04()
144 Coefficient min_d; in test05() local
151 && prp.minimize(le, min_n, min_d, min) in test05()
153 && prp.minimize(le, min_n, min_d, min, pnt_min); in test05()
181 Coefficient min_d; in test06() local
188 && !prp.minimize(le, min_n, min_d, min) in test06()
215 Coefficient min_d; in test07() local
223 && prp.minimize(le, min_n, min_d, min) in test07()
[all …]
|
| H A D | bounds1.cc | 213 Coefficient min_d; in test10() local
221 && prp.minimize(le, min_n, min_d, min) in test10()
223 && prp.minimize(le, min_n, min_d, min, pnt_min); in test10()
261 Coefficient min_d; in test11() local
268 && prp.minimize(le, min_n, min_d, min) in test11()
270 && prp.minimize(le, min_n, min_d, min, pnt_min); in test11()
298 Coefficient min_d; in test12() local
305 && !prp.minimize(le, min_n, min_d, min) in test12()
344 Coefficient min_d; in test13() local
352 && prp.minimize(le, min_n, min_d, min) in test13()
[all …]
|
| /dports/misc/vxl/vxl-3.3.2/contrib/mul/mbl/ |
| H A D | mbl_read_double.cxx | 39 double min_d, double max_d) in RD_ReadDouble1() argument
45 if (min_d==0 && max_d==0) in RD_ReadDouble1()
48 std::cout<<q_str<<" ["<<min_d<<".."<<max_d<<"] ("<<default_d<<") :"; in RD_ReadDouble1()
66 double min_d, double max_d) in mbl_read_double() argument
70 double R = RD_ReadDouble1(q_str,default_d,min_d,max_d); in mbl_read_double()
71 if (R<min_d) in mbl_read_double()
72 std::cout<<R<<": must be at least "<<min_d<<"\n"; in mbl_read_double()
|
| H A D | mbl_clusters.hxx | 290 double& min_d) in clusters_within_d() argument
294 min_d = d+1; in clusters_within_d()
301 if (di<min_d) { nearest_c=i; min_d=di; } in clusters_within_d()
315 double& min_d) in clusters_within_d() argument
319 min_d = d+1; in clusters_within_d()
326 if (di<min_d) { nearest_c=i; min_d=di; } in clusters_within_d()
340 double& min_d) in clusters_within_max_r() argument
342 return clusters_within_d(t,max_r(),c_list,nearest_c,min_d); in clusters_within_max_r()
351 double& min_d) in clusters_within_max_r() argument
353 return clusters_within_d(t,max_r(),in_list,c_list,nearest_c,min_d); in clusters_within_max_r()
|
| /dports/devel/godot/godot-3.2.3-stable/thirdparty/opus/celt/tests/ |
| H A D | test_unit_mathops.c | 130 opus_int32 min_d,max_d,last,chk; in testbitexactcos() local
132 last=min_d=32767; in testbitexactcos()
140 if (d<min_d)min_d=d; in testbitexactcos()
143 if ((chk!=89408644)||(max_d!=5)||(min_d!=0)||(bitexact_cos(64)!=32767)|| in testbitexactcos()
154 opus_int32 min_d,max_d,last,chk; in testbitexactlog2tan() local
156 last=min_d=15059; in testbitexactlog2tan()
168 if (d<min_d)min_d=d; in testbitexactlog2tan()
171 if ((chk!=15821257)||(max_d!=61)||(min_d!=-2)||fail|| in testbitexactlog2tan()
|
| /dports/devel/godot-tools/godot-3.2.3-stable/thirdparty/opus/celt/tests/ |
| H A D | test_unit_mathops.c | 130 opus_int32 min_d,max_d,last,chk; in testbitexactcos() local
132 last=min_d=32767; in testbitexactcos()
140 if (d<min_d)min_d=d; in testbitexactcos()
143 if ((chk!=89408644)||(max_d!=5)||(min_d!=0)||(bitexact_cos(64)!=32767)|| in testbitexactcos()
154 opus_int32 min_d,max_d,last,chk; in testbitexactlog2tan() local
156 last=min_d=15059; in testbitexactlog2tan()
168 if (d<min_d)min_d=d; in testbitexactlog2tan()
171 if ((chk!=15821257)||(max_d!=61)||(min_d!=-2)||fail|| in testbitexactlog2tan()
|
| /dports/audio/jamulus/jamulus-r3_8_1/libs/opus/celt/tests/ |
| H A D | test_unit_mathops.c | 92 opus_int32 min_d,max_d,last,chk; in testbitexactcos() local
94 last=min_d=32767; in testbitexactcos()
102 if (d<min_d)min_d=d; in testbitexactcos()
105 if ((chk!=89408644)||(max_d!=5)||(min_d!=0)||(bitexact_cos(64)!=32767)|| in testbitexactcos()
116 opus_int32 min_d,max_d,last,chk; in testbitexactlog2tan() local
118 last=min_d=15059; in testbitexactlog2tan()
130 if (d<min_d)min_d=d; in testbitexactlog2tan()
133 if ((chk!=15821257)||(max_d!=61)||(min_d!=-2)||fail|| in testbitexactlog2tan()
|
| /dports/devel/godot2-tools/godot-2.1.6-stable/thirdparty/opus/celt/tests/ |
| H A D | test_unit_mathops.c | 130 opus_int32 min_d,max_d,last,chk; in testbitexactcos() local
132 last=min_d=32767; in testbitexactcos()
140 if (d<min_d)min_d=d; in testbitexactcos()
143 if ((chk!=89408644)||(max_d!=5)||(min_d!=0)||(bitexact_cos(64)!=32767)|| in testbitexactcos()
154 opus_int32 min_d,max_d,last,chk; in testbitexactlog2tan() local
156 last=min_d=15059; in testbitexactlog2tan()
168 if (d<min_d)min_d=d; in testbitexactlog2tan()
171 if ((chk!=15821257)||(max_d!=61)||(min_d!=-2)||fail|| in testbitexactlog2tan()
|
| /dports/devel/godot2/godot-2.1.6-stable/thirdparty/opus/celt/tests/ |
| H A D | test_unit_mathops.c | 130 opus_int32 min_d,max_d,last,chk; in testbitexactcos() local
132 last=min_d=32767; in testbitexactcos()
140 if (d<min_d)min_d=d; in testbitexactcos()
143 if ((chk!=89408644)||(max_d!=5)||(min_d!=0)||(bitexact_cos(64)!=32767)|| in testbitexactcos()
154 opus_int32 min_d,max_d,last,chk; in testbitexactlog2tan() local
156 last=min_d=15059; in testbitexactlog2tan()
168 if (d<min_d)min_d=d; in testbitexactlog2tan()
171 if ((chk!=15821257)||(max_d!=61)||(min_d!=-2)||fail|| in testbitexactlog2tan()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/opus/src/celt/tests/ |
| H A D | test_unit_mathops.c | 92 opus_int32 min_d,max_d,last,chk; in testbitexactcos() local
94 last=min_d=32767; in testbitexactcos()
102 if (d<min_d)min_d=d; in testbitexactcos()
105 if ((chk!=89408644)||(max_d!=5)||(min_d!=0)||(bitexact_cos(64)!=32767)|| in testbitexactcos()
116 opus_int32 min_d,max_d,last,chk; in testbitexactlog2tan() local
118 last=min_d=15059; in testbitexactlog2tan()
130 if (d<min_d)min_d=d; in testbitexactlog2tan()
133 if ((chk!=15821257)||(max_d!=61)||(min_d!=-2)||fail|| in testbitexactlog2tan()
|
| /dports/audio/opus/opus-1.3.1/celt/tests/ |
| H A D | test_unit_mathops.c | 92 opus_int32 min_d,max_d,last,chk; in testbitexactcos() local
94 last=min_d=32767; in testbitexactcos()
102 if (d<min_d)min_d=d; in testbitexactcos()
105 if ((chk!=89408644)||(max_d!=5)||(min_d!=0)||(bitexact_cos(64)!=32767)|| in testbitexactcos()
116 opus_int32 min_d,max_d,last,chk; in testbitexactlog2tan() local
118 last=min_d=15059; in testbitexactlog2tan()
130 if (d<min_d)min_d=d; in testbitexactlog2tan()
133 if ((chk!=15821257)||(max_d!=61)||(min_d!=-2)||fail|| in testbitexactlog2tan()
|
| /dports/audio/sdl2_mixer/SDL2_mixer-2.0.4/external/opus-1.0.3/celt/tests/ |
| H A D | test_unit_mathops.c | 99 opus_int32 min_d,max_d,last,chk; in testbitexactcos() local
101 last=min_d=32767; in testbitexactcos()
109 if (d<min_d)min_d=d; in testbitexactcos()
112 if ((chk!=89408644)||(max_d!=5)||(min_d!=0)||(bitexact_cos(64)!=32767)|| in testbitexactcos()
123 opus_int32 min_d,max_d,last,chk; in testbitexactlog2tan() local
125 last=min_d=15059; in testbitexactlog2tan()
137 if (d<min_d)min_d=d; in testbitexactlog2tan()
140 if ((chk!=15821257)||(max_d!=61)||(min_d!=-2)||fail|| in testbitexactlog2tan()
|
| /dports/multimedia/gavl/gavl-1.4.0/gavl/ |
| H A D | peakdetector.c | 33 double min_d[GAVL_MAX_CHANNELS]; member
111 pd->min_d[channel] = (double)((int)pd->min_i[channel]) / 128.0; in update_channel_s8()
145 pd->min_d[channel] = (double)((int)pd->min_i[channel]) / 32768.0; in update_channel_s16()
176 if(*samples < pd->min_d[channel]) pd->min_d[channel] = *samples; in update_channel_float()
191 if(*samples < pd->min_d[channel]) pd->min_d[channel] = *samples; in update_channel_double()
263 pd->abs_d[i] = (pd->max_d[i] > fabs(pd->min_d[i])) ? in gavl_peak_detector_update()
264 pd->max_d[i] : fabs(pd->min_d[i]); in gavl_peak_detector_update()
277 if(pd->min_d[i] < min1) in gavl_peak_detector_get_peak()
278 min1 = pd->min_d[i]; in gavl_peak_detector_get_peak()
299 memcpy(min, pd->min_d, pd->format.num_channels * sizeof(*min)); in gavl_peak_detector_get_peaks()
[all …]
|
| /dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/bvxm/ |
| H A D | bvxm_lidar_processor.cxx | 50 float min_d; in prob_density() local
55 if ( ni == min_i || nj == min_j ) min_d = d; in prob_density()
56 if ( d < min_d ) min_d = d; in prob_density()
61 min_d *= thresh; in prob_density()
62 probabilities(i,j,0) = gauss_.prob_density(min_d); in prob_density()
|
| /dports/astro/oskar/OSKAR-2.8.0/oskar/math/test/ |
| H A D | Test_fit_ellipse.cpp | 42 double maj_d = 0.0, min_d = 0.0, pa_d = 0.0; in TEST() local
65 oskar_fit_ellipse_d(&maj_d, &min_d, &pa_d, num_points, &x[0], &y[0], in TEST()
97 EXPECT_NEAR(min_d, 0.0494223702, 1e-9); in TEST()
100 EXPECT_NEAR(min_d, min_f, 1e-5); in TEST()
|
| /dports/cad/cura/Cura-58bae31/cura/ |
| H A D | BuildVolume.py | 358 Vector(min_w, min_h - z_fight_distance, min_d),
359 Vector(max_w, min_h - z_fight_distance, min_d),
393 …mb.addLine(Vector(min_w, min_h, min_d), Vector(max_w, min_h, min_d), color = self._volume_outline_…
394 …mb.addLine(Vector(min_w, min_h, min_d), Vector(min_w, max_h, min_d), color = self._volume_outline_…
395 …mb.addLine(Vector(min_w, max_h, min_d), Vector(max_w, max_h, min_d), color = self._volume_outline_…
396 …mb.addLine(Vector(max_w, min_h, min_d), Vector(max_w, max_h, min_d), color = self._volume_outline_…
466 self._clamp(points[0][1], min_d, max_d))
471 self._clamp(point[1], min_d, max_d))
488 self._clamp(points[0][1], min_d, max_d))
527 min_d = -self._depth / 2
[all …]
|
| /dports/devel/ppl/ppl-1.2/tests/Powerset/ |
| H A D | maxmin1.cc | 254 Coefficient min_d = 0; in test06() local
265 bool ok = ps.minimize(LE, min_n, min_d, min_included) in test06()
266 && min_n == 3 && min_d == 2 && !min_included; in test06()
267 ok = ok && ps.minimize(LE, min_n, min_d, min_included, min_g) in test06()
268 && min_n == 3 && min_d == 2 && !min_included in test06()
272 nout << min_n << "/" << min_d; in test06()
285 ok = ps.minimize(LE, min_n, min_d, min_included) in test06()
286 && min_n == 3 && min_d == 2 && min_included; in test06()
287 ok = ok && ps.minimize(LE, min_n, min_d, min_included, min_g) in test06()
288 && min_n == 3 && min_d == 2 && min_included in test06()
[all …]
|
| /dports/graphics/birdfont/birdfont-2.29.5/libbirdfont/ |
| H A D | PointConverter.vala | 127 double min_d;
154 min_d = Glyph.CANVAS_MAX;
157 min_d = double.MAX;
161 if (d < min_d) {
162 min_d = d;
168 if (min_d > max_d) {
169 max_d = min_d;
|
| /dports/devel/boost-docs/boost_1_72_0/libs/geometry/doc/src/examples/algorithms/ |
| H A D | comparable_distance.cpp | 37 double min_d = boost::numeric::bounds<double>::highest(); in main() local
41 if (d < min_d) in main()
43 min_d = d; in main()
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/geometry/doc/src/examples/algorithms/ |
| H A D | comparable_distance.cpp | 37 double min_d = boost::numeric::bounds<double>::highest(); in main() local
41 if (d < min_d) in main()
43 min_d = d; in main()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/geometry/doc/src/examples/algorithms/ |
| H A D | comparable_distance.cpp | 37 double min_d = boost::numeric::bounds<double>::highest(); in main() local
41 if (d < min_d) in main()
43 min_d = d; in main()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/geometry/doc/src/examples/algorithms/ |
| H A D | comparable_distance.cpp | 37 double min_d = boost::numeric::bounds<double>::highest(); in main() local
41 if (d < min_d) in main()
43 min_d = d; in main()
|
| /dports/databases/percona57-server/boost_1_59_0/libs/geometry/doc/src/examples/algorithms/ |
| H A D | comparable_distance.cpp | 37 double min_d = boost::numeric::bounds<double>::highest(); in main() local
41 if (d < min_d) in main()
43 min_d = d; in main()
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/geometry/doc/src/examples/algorithms/ |
| H A D | comparable_distance.cpp | 37 double min_d = boost::numeric::bounds<double>::highest(); in main() local
41 if (d < min_d) in main()
43 min_d = d; in main()
|