Home
last modified time | relevance | path

Searched refs:best_t (Results 1 – 25 of 30) sorted by relevance

12

/dports/graphics/tesseract/tesseract-5.0.0/src/ccstruct/
H A Dotsuthr.cpp69 int best_t = OtsuStats(histogram, &H, &best_omega_0); in OtsuThreshold() local
78 thresholds[ch] = best_t; in OtsuThreshold()
105 int best_t = OtsuStats(histogram, &H, &best_omega_0); in OtsuThreshold() local
114 thresholds[ch] = best_t; in OtsuThreshold()
176 int best_t = -1; in OtsuStats() local
197 if (best_t < 0 || sig_sq_B > best_sig_sq_B) { in OtsuStats()
199 best_t = t; in OtsuStats()
209 return best_t; in OtsuStats()
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bbas/imesh/algo/
H A Dimesh_intersect.cxx412 best_t = t; in imesh_triangle_intersect()
417 best_t = t; in imesh_triangle_intersect()
422 best_t = t; in imesh_triangle_intersect()
432 best_t = t; in imesh_triangle_intersect()
437 best_t = t; in imesh_triangle_intersect()
442 best_t = t; in imesh_triangle_intersect()
453 best_t = t; in imesh_triangle_intersect()
458 best_t = t; in imesh_triangle_intersect()
463 best_t = t; in imesh_triangle_intersect()
468 u+=best_t*du; in imesh_triangle_intersect()
[all …]
/dports/lang/halide/Halide-release_2019_08_27-2654-g664dc4993/apps/openglcompute/jni/
H A Doglc_run.cpp27 double best_t = DBL_MAX; member
51 if (t < best_t) { in run()
52 best_t = t; in run()
158 openglcompute.best_t, openglcompute.best_rep, in test()
159 openglcompute_with_copying.best_t, openglcompute_with_copying.best_rep, in test()
160 arm.best_t, arm.best_rep); in test()
/dports/science/py-nilearn/nilearn-0.8.1/nilearn/decoding/
H A Dfista.py172 best_t = t
253 best_t = t
256 init = dict(w=best_w.copy(), z=best_z, t=best_t, dgap_tol=best_dgap_tol,
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/surface/src/3rdparty/opennurbs/
H A Dopennurbs_polyline.cpp240 double segment_t, segment_d, best_t, best_d; in ClosestPointTo() local
241 best_t = 0.0; // to keep lint quiet in ClosestPointTo()
267 best_t = segment_t + ((double)segment_index); in ClosestPointTo()
274 *t = best_t; in ClosestPointTo()
/dports/math/gismo/gismo-21.12.0/external/onurbs/
H A Dopennurbs_polyline.cpp240 double segment_t, segment_d, best_t, best_d; in ClosestPointTo() local
241 best_t = 0.0; // to keep lint quiet in ClosestPointTo()
267 best_t = segment_t + ((double)segment_index); in ClosestPointTo()
274 *t = best_t; in ClosestPointTo()
/dports/cad/atlc/atlc-4.6.1/src/
H A Dconvert_create_bmp_for_coupled_microstrip_dimensions_to_integers.c53 int best_h=-1, best_t=-1; in convert_create_create_bmp_for_coupled_microstrip_dimensions_to_integers() local
114 best_t=pcb->t; in convert_create_create_bmp_for_coupled_microstrip_dimensions_to_integers()
124 pcb->t=best_t; in convert_create_create_bmp_for_coupled_microstrip_dimensions_to_integers()
/dports/math/librsb/librsb-1.2.0.10/
H A Drsb_test_matops.c2870 best_t = RSB_MIN_ABOVE_INF(spmv_t,best_t,tinf); in rsb__main_block_partitioned_spmv_uaua()
3522 (mct)/(best_t), in rsb__main_block_partitioned_spmv_uaua()
3543 eperf, (eperf-raw_Mflops/best_t)/(raw_Mflops/best_t), in rsb__main_block_partitioned_spmv_uaua()
3559 smt=best_t; in rsb__main_block_partitioned_spmv_uaua()
3568 pmt=best_t; in rsb__main_block_partitioned_spmv_uaua()
3645 …TDOUT("\t%10.2lf\t%10.2lf\t%10.2lf\t%10.2lf\n",mest/best_t,msat/best_t,meit/best_t,(msat+meit)/bes… in rsb__main_block_partitioned_spmv_uaua()
6811 best_t = RSB_MIN_ABOVE_INF(spmv_t,best_t,tinf); in rsb__main_block_partitioned_spsv_uxua()
7420 eperf, (eperf-raw_Mflops/best_t)/(raw_Mflops/best_t), in rsb__main_block_partitioned_spsv_uxua()
7445 sst=best_t; in rsb__main_block_partitioned_spsv_uxua()
7447 pst=best_t; in rsb__main_block_partitioned_spsv_uxua()
[all …]
H A Drsb_test_matops.m43476 best_t = RSB_MIN_ABOVE_INF(spmv_t,best_t,tinf);
4177 base_best_t=best_t;
4179 serial_best_t=best_t;
4223 (mct)/(best_t),
4227 /* (fet)/(best_t),*/
4244 eperf, (eperf-raw_Mflops/best_t)/(raw_Mflops/best_t),
4279 sst=best_t;
4281 pst=best_t;
4293 smt=best_t;
4302 pmt=best_t;
[all …]
/dports/graphics/gifsicle/gifsicle-1.93/src/
H A Dgifwrite.c329 …gbdiff dither, unsigned long base_diff, const unsigned int max_diff, struct selected_node *best_t);
340 struct selected_node best_t = {node, pos, base_diff}; in gfc_lookup_lossy() local
342 if (pos >= image_endpos) return best_t; in gfc_lookup_lossy()
358 …y_try_node(gfc, gfcm, gfi, pos, node->child.m[i], suffix, i, dither, base_diff, max_diff, &best_t); in gfc_lookup_lossy()
363 …sy_try_node(gfc, gfcm, gfi, pos, node, suffix, node->suffix, dither, base_diff, max_diff, &best_t); in gfc_lookup_lossy()
367 return best_t; in gfc_lookup_lossy()
384 …rgbdiff dither, unsigned long base_diff, const unsigned int max_diff, struct selected_node *best_t) in gfc_lookup_lossy_try_node() argument
393 if (t.pos > best_t->pos || (t.pos == best_t->pos && t.diff < best_t->diff)) { in gfc_lookup_lossy_try_node()
394 *best_t = t; in gfc_lookup_lossy_try_node()
/dports/graphics/gifski/gifski-1.5.0/cargo-crates/gifsicle-1.92.5/vendor/src/
H A Dgifwrite.c329 …gbdiff dither, unsigned long base_diff, const unsigned int max_diff, struct selected_node *best_t);
340 struct selected_node best_t = {node, pos, base_diff}; in gfc_lookup_lossy() local
342 if (pos >= image_endpos) return best_t; in gfc_lookup_lossy()
358 …y_try_node(gfc, gfcm, gfi, pos, node->child.m[i], suffix, i, dither, base_diff, max_diff, &best_t); in gfc_lookup_lossy()
363 …sy_try_node(gfc, gfcm, gfi, pos, node, suffix, node->suffix, dither, base_diff, max_diff, &best_t); in gfc_lookup_lossy()
367 return best_t; in gfc_lookup_lossy()
384 …rgbdiff dither, unsigned long base_diff, const unsigned int max_diff, struct selected_node *best_t) in gfc_lookup_lossy_try_node() argument
393 if (t.pos > best_t->pos || (t.pos == best_t->pos && t.diff < best_t->diff)) { in gfc_lookup_lossy_try_node()
394 *best_t = t; in gfc_lookup_lossy_try_node()
/dports/converters/fribidi/fribidi-1.0.11/gen.tab/
H A Dpacktab.c141 static long t[22], best_t[22], clusters[22], best_cluster[22]; variable
158 best_t[i] = t[i]; in found()
257 if (best_t[lev] == 1) in write_array()
264 t[lev + 1] = best_t[lev + 1]; in write_array()
/dports/devel/glib20/glib-2.70.4/glib/glib-mirroring-tab/
H A Dpacktab.c120 static long t[22], best_t[22], clusters[22], best_cluster[22]; variable
137 best_t[i] = t[i]; in found()
236 if (best_t[lev] == 1) in write_array()
243 t[lev + 1] = best_t[lev + 1]; in write_array()
/dports/www/lagrange/lagrange-1.7.3/lib/fribidi/gen.tab/
H A Dpacktab.c141 static long t[22], best_t[22], clusters[22], best_cluster[22]; variable
158 best_t[i] = t[i]; in found()
257 if (best_t[lev] == 1) in write_array()
264 t[lev + 1] = best_t[lev + 1]; in write_array()
/dports/games/simutrans/simutrans-121.0/
H A Dsimcity.h90 class best_t {
260 best_t best_haus;
261 best_t best_strasse;
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/registration/include/pcl/registration/impl/
H A Dia_fpcs.hpp416 float best_t = 0.f; in selectBaseTriangle() local
435 if (t > best_t && u.squaredNorm() < max_base_diameter_sqr_ && in selectBaseTriangle()
437 best_t = t; in selectBaseTriangle()
444 return (best_t == 0.f ? -1 : 0); in selectBaseTriangle()
453 float best_t = FLT_MAX; in setupBase() local
480 if (t < best_t) { in setupBase()
481 best_t = t; in setupBase()
/dports/devel/allegro5/allegro5-5.2.7.0/addons/primitives/
H A Dtriangulator.c112 float best_t; in poly_find_closest_intersection() local
124 best_t = FLT_MAX; in poly_find_closest_intersection()
144 …p0, p1, intersection, &t0, &t1) && (t1 >= 0.0f) && (t1 <= 1.0f) && (t0 >= 0.0f) && (t0 < best_t)) { in poly_find_closest_intersection()
146 best_t = t0; in poly_find_closest_intersection()
/dports/textproc/cast2gif/cast2gif-0.1.0/cargo-crates/kurbo-0.5.11/src/
H A Dcubicbez.rs179 let mut best_t = 0.0; in nearest() localVariable
183 best_t = t0 + t * (t1 - t0); in nearest()
187 (best_t, best_r.unwrap()) in nearest()
/dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/kurbo-0.6.1/src/
H A Dcubicbez.rs205 let mut best_t = 0.0; in nearest() localVariable
209 best_t = t0 + t * (t1 - t0); in nearest()
213 (best_t, best_r.unwrap()) in nearest()
/dports/math/faiss/faiss-1.7.1/faiss/
H A DAutoTune.cpp656 double best_t = ops->t_for_perf(upper_bound_perf); in explore() local
661 best_t <= lower_bound_t ? "skip\n" : ""); in explore()
662 if (best_t <= lower_bound_t) in explore()
/dports/misc/darknet/darknet-darknet_yolo_v4_pre/src/
H A Dgaussian_yolo_layer.c465 int best_t = 0; in forward_gaussian_yolo_layer() local
488 best_t = t; in forward_gaussian_yolo_layer()
522 int class_id = state.truth[best_t*(4 + 1) + b*l.truths + 4]; in forward_gaussian_yolo_layer()
527 … box truth = float_to_box_stride(state.truth + best_t*(4 + 1) + b*l.truths, 1); in forward_gaussian_yolo_layer()
H A Dyolo_layer.c379 int best_t = 0; in forward_yolo_layer() local
402 best_t = t; in forward_yolo_layer()
437 int class_id = state.truth[best_t*(4 + 1) + b*l.truths + 4]; in forward_yolo_layer()
442 … box truth = float_to_box_stride(state.truth + best_t*(4 + 1) + b*l.truths, 1); in forward_yolo_layer()
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/bstm/ocl/algo/
H A Dbstm_ocl_particle_filter.cxx803 vgl_vector_3d<double> best_t; in best_bb() local
809 best_t = T[particle_no]; in best_bb()
814 << " and T: " << best_t << " and R: " << best_r.as_euler_angles() << std::endl; in best_bb()
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/baml/
H A Dbaml_detect_change.cxx166 float best_t = 0.0f; in expected_time_change() local
175 best_t = (float)t; in expected_time_change()
178 change_time(x, y) = best_t; in expected_time_change()
/dports/www/edbrowse/edbrowse-3.7.7/src/
H A Dhtml.c2886 struct jsTimer *t, *best_t = 0; in soonest() local
2890 if (!best_t || t->sec < best_t->sec || in soonest()
2891 (t->sec == best_t->sec && t->ms < best_t->ms)) in soonest()
2892 best_t = t; in soonest()
2894 return best_t; in soonest()

12