| /dports/math/py-or-tools/or-tools-9.2/ortools/glop/ |
| H A D | variable_values.h | 176 Fractional new_cost = 0.0; in UpdatePrimalPhaseICosts() local
178 new_cost = 1.0; in UpdatePrimalPhaseICosts()
180 new_cost = -1.0; in UpdatePrimalPhaseICosts()
182 if (new_cost != (*objective)[col]) { in UpdatePrimalPhaseICosts()
184 (*objective)[col] = new_cost; in UpdatePrimalPhaseICosts()
|
| /dports/graphics/py-pygraph/pygraph-0.2.1-4-g037bb2f/pygraph/functions/searching/ |
| H A D | astar.py | 49 new_cost = cost_so_far[current] + graph.edge_cost(current, next_node)
50 if next_node not in cost_so_far or new_cost < cost_so_far[next_node]:
51 cost_so_far[next_node] = new_cost
52 priority = new_cost + heuristic(goal, next_node)
|
| /dports/math/adept/adept-2.0.8/adept/ |
| H A D | minimize_levenberg_marquardt.cpp | 32 Real new_cost; in minimize_levenberg_marquardt() local
102 new_cost = optimizable.calc_cost_function(new_x); in minimize_levenberg_marquardt()
108 bool cost_invalid = !std::isfinite(new_cost); in minimize_levenberg_marquardt()
110 if (new_cost >= cost_function_ || cost_invalid) { in minimize_levenberg_marquardt()
197 Real new_cost; in minimize_levenberg_marquardt_bounded() local
383 new_cost = optimizable.calc_cost_function(new_x); in minimize_levenberg_marquardt_bounded()
389 bool cost_invalid = !std::isfinite(new_cost); in minimize_levenberg_marquardt_bounded()
391 if (new_cost >= cost_function_ || cost_invalid) { in minimize_levenberg_marquardt_bounded()
|
| /dports/net/openmpi3/openmpi-3.1.6/ompi/mca/topo/treematch/treematch/ |
| H A D | tm_topology.c | 575 double *new_cost = NULL; in optimize_arity() local
599 new_cost[i] = (*cost)[i]; in optimize_arity()
604 new_cost[n] = (*cost)[n];; in optimize_arity()
609 new_cost[n+1] = (*cost)[n]; in optimize_arity()
613 new_cost[i] = (*cost)[i-1]; in optimize_arity()
623 *cost=new_cost; in optimize_arity()
630 new_cost[i] = (*cost)[i]; in optimize_arity()
633 new_cost[n] = (*cost)[n];; in optimize_arity()
636 new_cost[n+1] = (*cost)[n]; in optimize_arity()
639 new_cost[i] = (*cost)[i-1]; in optimize_arity()
[all …]
|
| /dports/net/openmpi/openmpi-4.1.1/ompi/mca/topo/treematch/treematch/ |
| H A D | tm_topology.c | 582 double *new_cost = NULL; in optimize_arity() local
606 new_cost[i] = (*cost)[i]; in optimize_arity()
611 new_cost[n] = (*cost)[n];; in optimize_arity()
616 new_cost[n+1] = (*cost)[n]; in optimize_arity()
620 new_cost[i] = (*cost)[i-1]; in optimize_arity()
630 *cost=new_cost; in optimize_arity()
637 new_cost[i] = (*cost)[i]; in optimize_arity()
640 new_cost[n] = (*cost)[n];; in optimize_arity()
643 new_cost[n+1] = (*cost)[n]; in optimize_arity()
646 new_cost[i] = (*cost)[i-1]; in optimize_arity()
[all …]
|
| /dports/devel/valgrind-lts/valgrind-dragonfly-dragonfly/callgrind/ |
| H A D | events.c | 359 Bool CLG_(add_diff_cost)(EventSet* es, ULong* dst, ULong* old, ULong* new_cost) in CLG_()
365 CLG_ASSERT(old && new_cost); in CLG_()
368 if (new_cost[i] == old[i]) continue; in CLG_()
369 dst[i] += new_cost[i] - old[i]; in CLG_()
370 old[i] = new_cost[i]; in CLG_()
377 Bool CLG_(add_diff_cost_lz)(EventSet* es, ULong** pdst, ULong* old, ULong* new_cost) in CLG_()
384 CLG_ASSERT(old && new_cost); in CLG_()
393 if (new_cost[i] == old[i]) continue; in CLG_()
394 dst[i] += new_cost[i] - old[i]; in CLG_()
395 old[i] = new_cost[i]; in CLG_()
|
| /dports/devel/valgrind/valgrind-dragonfly-dragonfly/callgrind/ |
| H A D | events.c | 359 Bool CLG_(add_diff_cost)(EventSet* es, ULong* dst, ULong* old, ULong* new_cost) in CLG_()
365 CLG_ASSERT(old && new_cost); in CLG_()
368 if (new_cost[i] == old[i]) continue; in CLG_()
369 dst[i] += new_cost[i] - old[i]; in CLG_()
370 old[i] = new_cost[i]; in CLG_()
377 Bool CLG_(add_diff_cost_lz)(EventSet* es, ULong** pdst, ULong* old, ULong* new_cost) in CLG_()
384 CLG_ASSERT(old && new_cost); in CLG_()
393 if (new_cost[i] == old[i]) continue; in CLG_()
394 dst[i] += new_cost[i] - old[i]; in CLG_()
395 old[i] = new_cost[i]; in CLG_()
|
| /dports/net/olsrd/olsrd-0.9.8/src/ |
| H A D | olsr_spf.c | 196 olsr_linkcost new_cost; in olsr_spf_relax() local
238 new_cost = tc->path_cost + tc_edge->cost; in olsr_spf_relax()
242 get_linkcost_text(new_cost, true, &lqbuffer)); in olsr_spf_relax()
251 if (new_cost < new_tc->path_cost) { in olsr_spf_relax()
259 new_tc->path_cost = new_cost; in olsr_spf_relax()
270 … get_linkcost_text(new_cost, true, &lqbuffer), tc->next_hop ? olsr_ip_to_string(&nbuf, in olsr_spf_relax()
|
| /dports/math/py-z3-solver/z3-z3-4.8.10/src/math/simplex/ |
| H A D | network_flow_def.h | 56 numeral new_cost = m_potentials[src] - m_potentials[tgt] - m_graph.get_weight(i); in choose_entering_edge() local
57 if (new_cost > cost) { in choose_entering_edge()
58 cost = new_cost; in choose_entering_edge()
78 … numeral new_cost = m_potentials[src] - m_potentials[tgt] - m_graph.get_weight(id); in choose_entering_edge() local
79 if (new_cost.is_pos()) { in choose_entering_edge()
82 if (new_cost > cost) { in choose_entering_edge()
83 cost = new_cost; in choose_entering_edge()
101 numeral new_cost = m_potentials[src] - m_potentials[tgt] - m_graph.get_weight(id); in choose_entering_edge() local
102 if (new_cost > cost) { in choose_entering_edge()
103 cost = new_cost; in choose_entering_edge()
[all …]
|
| /dports/math/z3/z3-z3-4.8.13/src/math/simplex/ |
| H A D | network_flow_def.h | 56 numeral new_cost = m_potentials[src] - m_potentials[tgt] - m_graph.get_weight(i); in choose_entering_edge() local
57 if (new_cost > cost) { in choose_entering_edge()
58 cost = new_cost; in choose_entering_edge()
78 … numeral new_cost = m_potentials[src] - m_potentials[tgt] - m_graph.get_weight(id); in choose_entering_edge() local
79 if (new_cost.is_pos()) { in choose_entering_edge()
82 if (new_cost > cost) { in choose_entering_edge()
83 cost = new_cost; in choose_entering_edge()
101 numeral new_cost = m_potentials[src] - m_potentials[tgt] - m_graph.get_weight(id); in choose_entering_edge() local
102 if (new_cost > cost) { in choose_entering_edge()
103 cost = new_cost; in choose_entering_edge()
[all …]
|
| /dports/finance/frontaccounting/frontaccounting/inventory/includes/db/ |
| H A D | items_trans_db.inc | 52 $new_cost = $material_cost + $labour_cost + $overhead_cost;
54 $value_of_change = round2($qoh * ($new_cost - $last_cost), user_price_dec());
61 number_format2($last_cost, 2), number_format2($new_cost, 2), $stock_id);
67 change_stock_moves_std_cost($stock_id, $date_, $new_cost - $last_cost);
|
| /dports/math/chaco/Chaco-2.2/code/klvspiff/ |
| H A D | bpm_improve.c | 130 double new_cost; /* cost of new separator */ local
206 new_cost = sep_cost(weights[0], weights[1], (double) *sep_weight, (double) max_dev);
217 if ((new_cost < *pcost && new_imbalance <= max_dev) ||
218 (new_cost <= *pcost && new_imbalance < *pimbalance)) {
221 *pcost = new_cost;
|
| /dports/misc/ompl/ompl-1.5.2/tests/geometric/2d/ |
| H A D | 2dcircles_optimize.cpp | 150 base::Cost new_cost = path->cost(pdef->getOptimizationObjective()); in test2DCirclesGeneral() local
152 BOOST_CHECK(!opt->isCostBetterThan(prev_cost, new_cost)); in test2DCirclesGeneral()
154 prev_cost = new_cost; in test2DCirclesGeneral()
244 base::Cost new_cost = path->cost(pdef->getOptimizationObjective()); in test2DCirclesNoGoalBias() local
246 BOOST_CHECK(!opt->isCostBetterThan(prev_cost, new_cost)); in test2DCirclesNoGoalBias()
248 prev_cost = new_cost; in test2DCirclesNoGoalBias()
|
| /dports/games/exult/exult-snapshot-v1.7.0.20211128/pathfinder/ |
| H A D | path.cc | 376 int new_cost = node->get_start_cost() + step_cost; in Find_path() local
380 if (next && next->get_start_cost() <= new_cost) in Find_path()
384 if (new_cost + new_goal_cost >= max_cost) in Find_path()
387 next = new Search_node(ntile, new_cost, in Find_path()
393 next->update(new_cost, new_goal_cost, node); in Find_path()
|
| /dports/graphics/tesseract/tesseract-5.0.0/src/ccstruct/ |
| H A D | dppoint.h | 81 void AddLocalCost(int new_cost) { in AddLocalCost() argument
82 local_cost_ += new_cost; in AddLocalCost()
|
| H A D | dppoint.cpp | 44 int64_t new_cost = (points[i].*cost_func)(prev); in Solve() local
46 new_cost > points[i].total_cost_) { in Solve()
|
| /dports/biology/clustal-omega/clustal-omega-1.2.4/src/kmpp/ |
| H A D | KMeans.cpp | 95 Scalar new_cost = tree.DoKMeansStep(k, centers, 0); in RunKMeansOnce() local
96 is_done = (iteration > 0 && new_cost >= (1 - kEpsilon) * old_cost); in RunKMeansOnce()
97 old_cost = new_cost; in RunKMeansOnce()
98 LOG(true, "Completed iteration #" << (iteration+1) << ", cost=" << new_cost << "..." << endl); in RunKMeansOnce()
|
| /dports/graphics/py-scikit-image/scikit-image-0.19.0/skimage/graph/ |
| H A D | _spath.pyx | 28 _mcp.FLOAT_T new_cost, argument
30 return fabs(old_cost - new_cost)
|
| /dports/lang/gcc12-devel/gcc-12-20211205/gcc/rtl-ssa/ |
| H A D | changes.cc | 58 pp_decimal_int (pp, new_cost); in print()
173 unsigned int new_cost = 0; in changes_are_worthwhile() local
180 change->new_cost = insn_cost (change->rtl (), in changes_are_worthwhile()
182 new_cost += change->new_cost; in changes_are_worthwhile()
185 bool ok_p = (strict_p ? new_cost < old_cost : new_cost <= old_cost); in changes_are_worthwhile()
200 fprintf (dump_file, " %c %d", sep, change->new_cost); in changes_are_worthwhile()
536 insn->set_cost (change.new_cost); in apply_changes_to_insn()
|
| /dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/rtl-ssa/ |
| H A D | changes.cc | 58 pp_decimal_int (pp, new_cost); in print()
173 unsigned int new_cost = 0; in changes_are_worthwhile() local
180 change->new_cost = insn_cost (change->rtl (), in changes_are_worthwhile()
182 new_cost += change->new_cost; in changes_are_worthwhile()
185 bool ok_p = (strict_p ? new_cost < old_cost : new_cost <= old_cost); in changes_are_worthwhile()
200 fprintf (dump_file, " %c %d", sep, change->new_cost); in changes_are_worthwhile()
536 insn->set_cost (change.new_cost); in apply_changes_to_insn()
|
| /dports/lang/gcc11-devel/gcc-11-20211009/gcc/rtl-ssa/ |
| H A D | changes.cc | 58 pp_decimal_int (pp, new_cost); in print()
173 unsigned int new_cost = 0; in changes_are_worthwhile() local
180 change->new_cost = insn_cost (change->rtl (), in changes_are_worthwhile()
182 new_cost += change->new_cost; in changes_are_worthwhile()
185 bool ok_p = (strict_p ? new_cost < old_cost : new_cost <= old_cost); in changes_are_worthwhile()
200 fprintf (dump_file, " %c %d", sep, change->new_cost); in changes_are_worthwhile()
536 insn->set_cost (change.new_cost); in apply_changes_to_insn()
|
| /dports/lang/gcc11/gcc-11.2.0/gcc/rtl-ssa/ |
| H A D | changes.cc | 58 pp_decimal_int (pp, new_cost); in print()
173 unsigned int new_cost = 0; in changes_are_worthwhile() local
180 change->new_cost = insn_cost (change->rtl (), in changes_are_worthwhile()
182 new_cost += change->new_cost; in changes_are_worthwhile()
185 bool ok_p = (strict_p ? new_cost < old_cost : new_cost <= old_cost); in changes_are_worthwhile()
200 fprintf (dump_file, " %c %d", sep, change->new_cost); in changes_are_worthwhile()
536 insn->set_cost (change.new_cost); in apply_changes_to_insn()
|
| /dports/finance/frontaccounting/frontaccounting/inventory/ |
| H A D | cost_update.php | 49 $new_cost = input_num('material_cost') + input_num('labour_cost') variable
61 elseif ($old_cost == $new_cost)
|
| /dports/misc/vxl/vxl-3.3.2/contrib/oxl/osl/ |
| H A D | osl_fit_lines.cxx | 205 float new_cost, new_est_cost; in MeanIncrementalFit() local
235 new_cost = MyGetCost(data_, start, finish, dc); in MeanIncrementalFit()
238 if ( new_cost < threshold_) in MeanIncrementalFit()
244 OutputLine(curves_, start,finish-ignore_end_edgels_,dc,new_cost); in MeanIncrementalFit()
255 new_est_cost = new_cost; in MeanIncrementalFit()
286 new_cost = MyGetCost(data_, start, finish-ignore_end_edgels_, dc); in MeanIncrementalFit()
287 OutputLine(curves_, start,finish-ignore_end_edgels_,dc,new_cost); in MeanIncrementalFit()
311 while (new_cost > threshold_ && segment_length > min_fit_length_) in MeanIncrementalFit()
317 new_cost = MyGetCost(data_, start, i, dc); in MeanIncrementalFit()
320 OutputLine(curves_, start,finish,dc,new_cost); in MeanIncrementalFit()
|
| /dports/japanese/mozc-el/mozc-2.23.2815.102.01/src/composer/internal/ |
| H A D | typing_corrector.cc | 123 const int new_cost = top_n_[i].second + Cost(event.probability()) in InsertCharacter() local
126 if (new_cost < TypingModel::kInfinity) { in InsertCharacter()
128 std::make_pair(top_n_[i].first + key_as_string, new_cost)); in InsertCharacter()
|