/dports/misc/vxl/vxl-3.3.2/contrib/mul/mbl/ |
H A D | mbl_dyn_prog.cxx | 217 double best_cost = ci[0]; in solve() local 220 if (ci[j]<best_cost) { best_j=j; best_cost=ci[j]; } in solve() 225 return best_cost; in solve() 247 double best_cost; in solve_asym() local 252 best_cost=ci[last_state]; in solve_asym() 256 best_cost = ci[0]; in solve_asym() 259 if (ci[j]<best_cost) { best_j=j; best_cost=ci[j]; } in solve_asym() 264 return best_cost; in solve_asym() 298 if (cost<best_cost) { best_cost=cost; k_best = k; } in solve_loop() 301 if (best_cost<best_overall_cost) in solve_loop() [all …]
|
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/misc/espresso/ |
H A D | espresso.c | 58 cost_t cost, best_cost; local 95 copy_cost(&cost, &best_cost); 99 } while (cost.cubes < best_cost.cubes); 102 copy_cost(&cost, &best_cost); 105 if (cost.cubes >= best_cost.cubes) 111 } while (cost.cubes < best_cost.cubes || 112 (cost.cubes == best_cost.cubes && cost.total < best_cost.total));
|
H A D | sparse.c | 29 cost_t cost, best_cost; local 31 cover_cost(F, &best_cost); 35 if (cost.total == best_cost.total) 37 copy_cost(&cost, &best_cost); 40 if (cost.total == best_cost.total) 42 copy_cost(&cost, &best_cost);
|
/dports/math/arb/arb-2.21.1/acb_dirichlet/ |
H A D | hurwitz_precomp_choose_param.c | 18 double MUL_COST, POW_COST, ZETA_COST, height, abss, cost, best_cost; in acb_dirichlet_hurwitz_precomp_choose_param() local 46 best_cost = num_eval * ZETA_COST; in acb_dirichlet_hurwitz_precomp_choose_param() 48 best_cost *= 0.5; in acb_dirichlet_hurwitz_precomp_choose_param() 50 best_cost *= 0.5; in acb_dirichlet_hurwitz_precomp_choose_param() 78 if (cost < best_cost) in acb_dirichlet_hurwitz_precomp_choose_param() 80 best_cost = cost; in acb_dirichlet_hurwitz_precomp_choose_param() 89 if (cost > best_cost) in acb_dirichlet_hurwitz_precomp_choose_param()
|
H A D | roots_init.c | 20 double cost, best_cost; in acb_dirichlet_roots_init() local 46 best_cost = FLINT_BIT_COUNT(reduced_order) * (double) num; in acb_dirichlet_roots_init() 59 if (cost < best_cost) in acb_dirichlet_roots_init() 62 best_cost = cost; in acb_dirichlet_roots_init()
|
/dports/multimedia/libtheora/libtheora-1.1.1/lib/ |
H A D | tokenize.c | 246 ogg_uint32_t best_cost; in oc_enc_tokenize_ac() local 297 best_cost=0xFFFFFFFF; in oc_enc_tokenize_ac() 454 best_cost=cost; in oc_enc_tokenize_ac() 475 best_cost=cost; in oc_enc_tokenize_ac() 494 best_cost=cost; in oc_enc_tokenize_ac() 514 best_cost=cost; in oc_enc_tokenize_ac() 534 best_cost=cost; in oc_enc_tokenize_ac() 554 best_cost=cost; in oc_enc_tokenize_ac() 574 best_cost=cost; in oc_enc_tokenize_ac() 594 best_cost=cost; in oc_enc_tokenize_ac() [all …]
|
/dports/math/vtk9/VTK-9.1.0/ThirdParty/theora/vtktheora/lib/ |
H A D | tokenize.c | 247 ogg_uint32_t best_cost; in oc_enc_tokenize_ac() local 298 best_cost=0xFFFFFFFF; in oc_enc_tokenize_ac() 455 best_cost=cost; in oc_enc_tokenize_ac() 476 best_cost=cost; in oc_enc_tokenize_ac() 495 best_cost=cost; in oc_enc_tokenize_ac() 515 best_cost=cost; in oc_enc_tokenize_ac() 535 best_cost=cost; in oc_enc_tokenize_ac() 555 best_cost=cost; in oc_enc_tokenize_ac() 575 best_cost=cost; in oc_enc_tokenize_ac() 595 best_cost=cost; in oc_enc_tokenize_ac() [all …]
|
/dports/devel/godot2-tools/godot-2.1.6-stable/thirdparty/libtheora/ |
H A D | tokenize.c | 246 ogg_uint32_t best_cost; in oc_enc_tokenize_ac() local 297 best_cost=0xFFFFFFFF; in oc_enc_tokenize_ac() 454 best_cost=cost; in oc_enc_tokenize_ac() 475 best_cost=cost; in oc_enc_tokenize_ac() 494 best_cost=cost; in oc_enc_tokenize_ac() 514 best_cost=cost; in oc_enc_tokenize_ac() 534 best_cost=cost; in oc_enc_tokenize_ac() 554 best_cost=cost; in oc_enc_tokenize_ac() 574 best_cost=cost; in oc_enc_tokenize_ac() 594 best_cost=cost; in oc_enc_tokenize_ac() [all …]
|
/dports/devel/godot/godot-3.2.3-stable/thirdparty/libtheora/ |
H A D | tokenize.c | 246 ogg_uint32_t best_cost; in oc_enc_tokenize_ac() local 297 best_cost=0xFFFFFFFF; in oc_enc_tokenize_ac() 454 best_cost=cost; in oc_enc_tokenize_ac() 475 best_cost=cost; in oc_enc_tokenize_ac() 494 best_cost=cost; in oc_enc_tokenize_ac() 514 best_cost=cost; in oc_enc_tokenize_ac() 534 best_cost=cost; in oc_enc_tokenize_ac() 554 best_cost=cost; in oc_enc_tokenize_ac() 574 best_cost=cost; in oc_enc_tokenize_ac() 594 best_cost=cost; in oc_enc_tokenize_ac() [all …]
|
/dports/devel/godot-tools/godot-3.2.3-stable/thirdparty/libtheora/ |
H A D | tokenize.c | 246 ogg_uint32_t best_cost; in oc_enc_tokenize_ac() local 297 best_cost=0xFFFFFFFF; in oc_enc_tokenize_ac() 454 best_cost=cost; in oc_enc_tokenize_ac() 475 best_cost=cost; in oc_enc_tokenize_ac() 494 best_cost=cost; in oc_enc_tokenize_ac() 514 best_cost=cost; in oc_enc_tokenize_ac() 534 best_cost=cost; in oc_enc_tokenize_ac() 554 best_cost=cost; in oc_enc_tokenize_ac() 574 best_cost=cost; in oc_enc_tokenize_ac() 594 best_cost=cost; in oc_enc_tokenize_ac() [all …]
|
/dports/math/vtk8/VTK-8.2.0/ThirdParty/theora/vtktheora/lib/ |
H A D | tokenize.c | 246 ogg_uint32_t best_cost; in oc_enc_tokenize_ac() local 297 best_cost=0xFFFFFFFF; in oc_enc_tokenize_ac() 454 best_cost=cost; in oc_enc_tokenize_ac() 475 best_cost=cost; in oc_enc_tokenize_ac() 494 best_cost=cost; in oc_enc_tokenize_ac() 514 best_cost=cost; in oc_enc_tokenize_ac() 534 best_cost=cost; in oc_enc_tokenize_ac() 554 best_cost=cost; in oc_enc_tokenize_ac() 574 best_cost=cost; in oc_enc_tokenize_ac() 594 best_cost=cost; in oc_enc_tokenize_ac() [all …]
|
/dports/math/vtk6/VTK-6.2.0/ThirdParty/oggtheora/vtkoggtheora/libtheora-1.1.1/lib/ |
H A D | tokenize.c | 246 ogg_uint32_t best_cost; in oc_enc_tokenize_ac() local 297 best_cost=0xFFFFFFFF; in oc_enc_tokenize_ac() 454 best_cost=cost; in oc_enc_tokenize_ac() 475 best_cost=cost; in oc_enc_tokenize_ac() 494 best_cost=cost; in oc_enc_tokenize_ac() 514 best_cost=cost; in oc_enc_tokenize_ac() 534 best_cost=cost; in oc_enc_tokenize_ac() 554 best_cost=cost; in oc_enc_tokenize_ac() 574 best_cost=cost; in oc_enc_tokenize_ac() 594 best_cost=cost; in oc_enc_tokenize_ac() [all …]
|
/dports/devel/godot2/godot-2.1.6-stable/thirdparty/libtheora/ |
H A D | tokenize.c | 246 ogg_uint32_t best_cost; in oc_enc_tokenize_ac() local 297 best_cost=0xFFFFFFFF; in oc_enc_tokenize_ac() 454 best_cost=cost; in oc_enc_tokenize_ac() 475 best_cost=cost; in oc_enc_tokenize_ac() 494 best_cost=cost; in oc_enc_tokenize_ac() 514 best_cost=cost; in oc_enc_tokenize_ac() 534 best_cost=cost; in oc_enc_tokenize_ac() 554 best_cost=cost; in oc_enc_tokenize_ac() 574 best_cost=cost; in oc_enc_tokenize_ac() 594 best_cost=cost; in oc_enc_tokenize_ac() [all …]
|
/dports/math/vowpal_wabbit/vowpal_wabbit-7.10/vowpalwabbit/ |
H A D | beam.h | 83 best_cost = FLT_MAX; in beam_size() 154 if (cost < best_cost) { in insert() 155 best_cost = cost; in insert() 160 prune_if_gt = max(1.f, best_cost) * pruning_coefficient; in insert() 172 if ((ret == NULL) && el->active && (el->cost <= best_cost)) in pop_best_item() 180 best_cost = next_best_cost; in pop_best_item() 181 prune_if_gt = max(1.f, best_cost) * pruning_coefficient; in pop_best_item() 185 best_cost = FLT_MAX; in pop_best_item() 236 best_cost = A[0].cost; 238 prune_if_gt = max(1.f, best_cost) * pruning_coefficient; [all …]
|
/dports/textproc/p5-Text-Brew/Text-Brew-0.02/lib/Text/ |
H A D | Brew.pm | 36 my $best_cost=$cost_with_sub; 40 if ($cost_with_ins < $best_cost) { 42 $best_cost=$cost_with_ins; 47 if ($cost_with_del < $best_cost) { 49 $best_cost=$cost_with_del; 54 if ($best_cost == $tb->[0]) {$move=MATCH} 55 return [$best_cost,$move,$tb];
|
/dports/misc/vxl/vxl-3.3.2/contrib/mul/mbl/tests/ |
H A D | test_dyn_prog.cxx | 48 double best_cost = dp_cost1(W,pair_cost,ux); in global_optima1() local 52 if (cost<best_cost) { best_cost=cost; best_x=ux; } in global_optima1() 57 return best_cost; in global_optima1() 70 double best_cost = dp_cost2(W,pair_cost,ux); in global_optima2() local 74 if (cost<best_cost) { best_cost=cost; best_x=ux; } in global_optima2() 79 return best_cost; in global_optima2()
|
/dports/databases/pgrouting/pgrouting-3.2.0/include/cpp_common/ |
H A D | pgr_bidirectional.hpp | 78 best_cost(0) { in Pgr_bidirectional() 119 best_cost = INF; in initialize() 166 if (best_cost == INF) return Path(); in bidirectional() 201 if (best_cost >= forward_cost[node] + backward_cost[node]) { in found() 203 best_cost = forward_cost[node] + backward_cost[node]; in found() 226 double best_cost; member in pgrouting::bidirectional::Pgr_bidirectional
|
/dports/graphics/opencv/opencv-4.5.3/contrib/modules/sfm/src/libmv_light/libmv/multiview/ |
H A D | robust_estimation.h | 89 double best_cost = HUGE_VAL; variable 125 if (cost < best_cost) { 126 best_cost = cost; 133 VLOG(4) << "New best cost: " << best_cost << " with " 148 *best_score = best_cost;
|
/dports/graphics/tesseract/tesseract-5.0.0/src/textord/ |
H A D | pitsync1.cpp | 164 double best_cost; // best path in check_pitch_sync() local 217 best_cost = FLT_MAX; in check_pitch_sync() 266 if (segpt->cost_function() < best_cost) { in check_pitch_sync() 267 best_cost = segpt->cost_function(); in check_pitch_sync() 273 } else if (segpt->cost_function() == best_cost && right_best_x == x - 1) { in check_pitch_sync() 368 float best_cost; // best path in make_illegal_segment() local 373 best_cost = FLT_MAX; in make_illegal_segment() 376 if (prevpt->cost_function() < best_cost) { in make_illegal_segment() 378 best_cost = prevpt->cost_function(); in make_illegal_segment() 381 } else if (prevpt->cost_function() == best_cost) { in make_illegal_segment()
|
/dports/devel/kBuild/kBuild-0.1.9998/src/sed/sed/ |
H A D | fmt.c | 131 COST best_cost; /* cost of best paragraph starting here */ member 410 if (w->best_cost - w->next_break->best_cost < best_break) in flush_paragraph() 413 best_break = w->best_cost - w->next_break->best_cost; in flush_paragraph() 440 word_limit->best_cost = 0; in fmt_paragraph() 459 wcost = line_cost (w, len) + w->best_cost; in fmt_paragraph() 471 start->best_cost = best + base_cost (start); in fmt_paragraph()
|
/dports/editors/ssed/sed-3.62/sed/ |
H A D | fmt.c | 131 COST best_cost; /* cost of best paragraph starting here */ member 410 if (w->best_cost - w->next_break->best_cost < best_break) in flush_paragraph() 413 best_break = w->best_cost - w->next_break->best_cost; in flush_paragraph() 440 word_limit->best_cost = 0; in fmt_paragraph() 459 wcost = line_cost (w, len) + w->best_cost; in fmt_paragraph() 471 start->best_cost = best + base_cost (start); in fmt_paragraph()
|
/dports/textproc/libtre/tre-0.8.0/src/ |
H A D | agrep.c | 191 static int best_cost; /* Best match cost found so far. */ variable 368 match_params.max_cost = best_cost; in tre_agrep_handle_file() 376 if (best_match == 1 && best_cost == 0) in tre_agrep_handle_file() 394 if (match.cost < best_cost) in tre_agrep_handle_file() 395 best_cost = match.cost; in tre_agrep_handle_file() 399 if (match.cost > best_cost) in tre_agrep_handle_file() 795 best_cost = INT_MAX; in main() 803 if (best_cost == INT_MAX) in main() 809 match_params.max_cost = best_cost; in main()
|
/dports/sysutils/scalpel/scalpel-2.0/tre-0.7.5-win32/src/ |
H A D | agrep.c | 192 static int best_cost; /* Best match cost found so far. */ variable 369 match_params.max_cost = best_cost; in tre_agrep_handle_file() 377 if (best_match == 1 && best_cost == 0) in tre_agrep_handle_file() 395 if (match.cost < best_cost) in tre_agrep_handle_file() 396 best_cost = match.cost; in tre_agrep_handle_file() 400 if (match.cost > best_cost) in tre_agrep_handle_file() 774 best_cost = INT_MAX; in main() 782 if (best_cost == INT_MAX) in main() 788 match_params.max_cost = best_cost; in main()
|
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/bsgm/ |
H A D | bsgm_disparity_estimator.cxx | 513 unsigned short best_cost = jump_cost; in compute_dir_cost() local 518 best_cost = prc_d < best_cost ? prc_d: best_cost; in compute_dir_cost() 524 best_cost = prc_dm1 < best_cost ? prc_dm1: best_cost; in compute_dir_cost() 528 best_cost = prc_dp1 < best_cost ? prc_dp1: best_cost; in compute_dir_cost() 533 *crc = *cac + best_cost - min_prev_cost; in compute_dir_cost()
|
/dports/math/py-or-tools/or-tools-9.2/ortools/bop/ |
H A D | bop_fs.cc | 241 int64_t best_cost = problem_state.solution().IsFeasible() in Optimize() local 251 (best_cost != std::numeric_limits<int64_t>::max()); in Optimize() 267 true, sat::Coefficient(best_cost) - 1, sat_propagator_)) { in Optimize() 269 learned_info->lower_bound = best_cost; in Optimize() 270 return best_cost == std::numeric_limits<int64_t>::max() in Optimize() 299 CHECK_LT(learned_info->solution.GetCost(), best_cost); in Optimize() 300 best_cost = learned_info->solution.GetCost(); in Optimize() 303 learned_info->lower_bound = best_cost; in Optimize() 304 return best_cost == std::numeric_limits<int64_t>::max() in Optimize() 328 learned_info->lower_bound = best_cost; in Optimize() [all …]
|