Home
last modified time | relevance | path

Searched refs:totalcost (Results 1 – 25 of 39) sorted by relevance

12

/dports/devel/mercurial/mercurial-6.0/tests/
H A Dtest-lrucachedict.py24 self.assertEqual(d.totalcost, 44)
30 self.assertEqual(d.totalcost, 42)
39 self.assertEqual(d.totalcost, 46)
119 self.assertEqual(dc.totalcost, 6)
131 self.assertEqual(d.totalcost, 4)
134 self.assertEqual(dc.totalcost, 4)
157 self.assertEqual(d.totalcost, 42)
167 self.assertEqual(d.totalcost, 42)
216 self.assertEqual(d.totalcost, 6)
258 self.assertEqual(d.totalcost, 5)
[all …]
/dports/databases/pgrouting/pgrouting-3.2.0/include/mincut/
H A Dpgr_stoerWagner.hpp80 double totalcost = 0; in generatestoerWagner() local
98 totalcost += tmp.cost; in generatestoerWagner()
99 tmp.mincut = totalcost; in generatestoerWagner()
104 pgassert(w == totalcost); in generatestoerWagner()
/dports/databases/pgrouting/pgrouting-3.2.0/include/spanningTree/
H A Dpgr_randomSpanningTree.hpp98 double totalcost = 0; in undirectedGraph() local
104 tmp.tree_cost = totalcost; in undirectedGraph()
122 totalcost += cost; in undirectedGraph()
127 tmp.tree_cost = totalcost; // tree_cost in undirectedGraph()
/dports/math/minizinc/libminizinc-2.5.5/share/minizinc/std/
H A Dcost_mdd.mzn5 Requires that \a x defines a path in the cost MDD with total edge weight \a totalcost.
14 @param totalcost: the total cost of the path defined by \a x
25 var int: totalcost % total cost of path
54 fzn_cost_mdd(x,N,level,E,from,label,cost,to,totalcost);
64 var int: totalcost, % total cost of path
67 fzn_cost_mdd_reif(x, N, level, E, from, label, cost, to, totalcost, b);
H A Dfzn_cost_mdd_reif.mzn9 var int: totalcost, % total cost of path
H A Dfzn_cost_mdd.mzn9 var int: totalcost % total cost of path
50 totalcost = ln[1];
/dports/games/libretro-hatari/hatari-561c07e/src/debug/
H A Dprofile_priv.h73 …(int idx, callinfo_t *callinfo, Uint32 prev_pc, calltype_t flag, Uint32 pc, counters_t *totalcost);
74 extern void Profile_FinalizeCalls(callinfo_t *callinfo, counters_t *totalcost, const char* (get_sym…
75 extern Uint32 Profile_CallEnd(callinfo_t *callinfo, counters_t *totalcost);
H A Dprofile.c292 …t(int idx, callinfo_t *callinfo, Uint32 prev_pc, calltype_t flag, Uint32 pc, counters_t *totalcost) in Profile_CallStart() argument
342 stack->all = *totalcost; in Profile_CallStart()
352 totalcost->calls++; in Profile_CallStart()
360 Uint32 Profile_CallEnd(callinfo_t *callinfo, counters_t *totalcost) in Profile_CallEnd() argument
382 set_counter_diff(&(stack->all), totalcost); in Profile_CallEnd()
405 void Profile_FinalizeCalls(callinfo_t *callinfo, counters_t *totalcost, const char* (*get_symbol)(U… in Profile_FinalizeCalls() argument
413 Profile_CallEnd(callinfo, totalcost); in Profile_FinalizeCalls()
/dports/emulators/hatari/hatari-2.2.1/src/debug/
H A Dprofile_priv.h75 …(int idx, callinfo_t *callinfo, Uint32 prev_pc, calltype_t flag, Uint32 pc, counters_t *totalcost);
76 extern void Profile_FinalizeCalls(callinfo_t *callinfo, counters_t *totalcost, const char* (get_sym…
77 extern Uint32 Profile_CallEnd(callinfo_t *callinfo, counters_t *totalcost);
H A Dprofile.c295 …t(int idx, callinfo_t *callinfo, Uint32 prev_pc, calltype_t flag, Uint32 pc, counters_t *totalcost) in Profile_CallStart() argument
345 stack->all = *totalcost; in Profile_CallStart()
355 totalcost->calls++; in Profile_CallStart()
363 Uint32 Profile_CallEnd(callinfo_t *callinfo, counters_t *totalcost) in Profile_CallEnd() argument
385 set_counter_diff(&(stack->all), totalcost); in Profile_CallEnd()
408 void Profile_FinalizeCalls(callinfo_t *callinfo, counters_t *totalcost, const char* (*get_symbol)(U… in Profile_FinalizeCalls() argument
416 Profile_CallEnd(callinfo, totalcost); in Profile_FinalizeCalls()
/dports/editors/emacs-devel/emacs-4d1968b/src/
H A Dcm.c183 totalcost; in calccost() local
198 totalcost = 0; in calccost()
210 totalcost = c * deltay; in calccost()
266 totalcost += tabcost; /* use the tabs */ in calccost()
293 totalcost += c * deltax; in calccost()
299 return totalcost; in calccost()
/dports/editors/emacs/emacs-27.2/src/
H A Dcm.c183 totalcost; in calccost() local
198 totalcost = 0; in calccost()
210 totalcost = c * deltay; in calccost()
266 totalcost += tabcost; /* use the tabs */ in calccost()
293 totalcost += c * deltax; in calccost()
299 return totalcost; in calccost()
/dports/games/minetest/minetest-5.4.1/src/
H A Dpathfinder.cpp445 totalcost(b.totalcost), in PathGridnode()
465 totalcost = b.totalcost; in operator =()
717 startpos.totalcost = 0; in getPath()
1011 g_pos.totalcost = current_cost; in updateAllCosts()
1066 if ((g_pos2.totalcost < 0) || in updateAllCosts()
1067 (g_pos2.totalcost > new_cost)) { in updateAllCosts()
1069 PP(ipos2) << " from: " << g_pos2.totalcost << " to "<< in updateAllCosts()
1133 s_pos.totalcost = 0; in updateCostHeuristic()
1168 int current_totalcost = g_pos.totalcost; in updateCostHeuristic()
1191 n_pos.totalcost = current_totalcost + cost.value; in updateCostHeuristic()
[all …]
/dports/games/widelands/widelands-build21/src/economy/
H A Droute.cc45 void Route::init(int32_t totalcost) { in init() argument
46 totalcost_ = totalcost; in init()
/dports/cad/pcb/pcb-4.2.0/gts/
H A Dpartition.c727 gdouble bestcost = 0., totalcost = 0., best_balance; in gts_graph_bisection_kl_refine() local
766 totalcost += cost; in gts_graph_bisection_kl_refine()
767 if (totalcost < bestcost) { in gts_graph_bisection_kl_refine()
768 bestcost = totalcost; in gts_graph_bisection_kl_refine()
771 else if (totalcost == bestcost) { in gts_graph_bisection_kl_refine()
892 gdouble bestcost = 0., totalcost = 0., best_balance; in gts_graph_bisection_bkl_refine() local
946 totalcost += cost; in gts_graph_bisection_bkl_refine()
950 bestcost = totalcost; in gts_graph_bisection_bkl_refine()
955 else if (totalcost < bestcost && in gts_graph_bisection_bkl_refine()
957 bestcost = totalcost; in gts_graph_bisection_bkl_refine()
[all …]
/dports/science/afni/afni-AFNI_21.3.16/src/SUMA/gts/src/
H A Dpartition.c725 gdouble bestcost = 0., totalcost = 0., best_balance; in gts_graph_bisection_kl_refine() local
764 totalcost += cost; in gts_graph_bisection_kl_refine()
765 if (totalcost < bestcost) { in gts_graph_bisection_kl_refine()
766 bestcost = totalcost; in gts_graph_bisection_kl_refine()
769 else if (totalcost == bestcost) { in gts_graph_bisection_kl_refine()
890 gdouble bestcost = 0., totalcost = 0., best_balance; in gts_graph_bisection_bkl_refine() local
944 totalcost += cost; in gts_graph_bisection_bkl_refine()
948 bestcost = totalcost; in gts_graph_bisection_bkl_refine()
953 else if (totalcost < bestcost && in gts_graph_bisection_bkl_refine()
955 bestcost = totalcost; in gts_graph_bisection_bkl_refine()
[all …]
/dports/graphics/gts/gts-0.7.6/src/
H A Dpartition.c725 gdouble bestcost = 0., totalcost = 0., best_balance; in gts_graph_bisection_kl_refine() local
764 totalcost += cost; in gts_graph_bisection_kl_refine()
765 if (totalcost < bestcost) { in gts_graph_bisection_kl_refine()
766 bestcost = totalcost; in gts_graph_bisection_kl_refine()
769 else if (totalcost == bestcost) { in gts_graph_bisection_kl_refine()
890 gdouble bestcost = 0., totalcost = 0., best_balance; in gts_graph_bisection_bkl_refine() local
944 totalcost += cost; in gts_graph_bisection_bkl_refine()
948 bestcost = totalcost; in gts_graph_bisection_bkl_refine()
953 else if (totalcost < bestcost && in gts_graph_bisection_bkl_refine()
955 bestcost = totalcost; in gts_graph_bisection_bkl_refine()
[all …]
/dports/science/lammps/lammps-stable_29Sep2021/src/
H A Dbalance.cpp544 double mycost,totalcost; in imbalance_factor() local
556 MPI_Allreduce(&mycost,&totalcost,1,MPI_DOUBLE,MPI_SUM,world); in imbalance_factor()
559 if (maxcost > 0.0) imbalance = maxcost / (totalcost/nprocs); in imbalance_factor()
776 double mycost,totalcost,boxsize; in shift() local
828 MPI_Allreduce(&mycost,&totalcost,1,MPI_DOUBLE,MPI_SUM,world); in shift()
830 for (i = 0; i < np; i++) target[i] = totalcost/np * i; in shift()
831 target[np] = totalcost; in shift()
839 losum[np] = hisum[np] = totalcost; in shift()
1153 double totalcost = 0.0; in imbalance_splits() local
1156 totalcost += allproccost[i]; in imbalance_splits()
[all …]
/dports/science/sparta/sparta-20Oct2021/src/
H A Dfix_balance.cpp295 double mycost,totalcost; in imbalance_factor() local
303 MPI_Allreduce(&mycost,&totalcost,1,MPI_DOUBLE,MPI_SUM,world); in imbalance_factor()
307 if (maxcost) imbalance = maxcost / (totalcost / nprocs); in imbalance_factor()
/dports/games/spring/spring_98.0/AI/Skirmish/KAIK/
H A DPathFinder.h51 float totalcost; variable
/dports/math/gap/gap-4.11.0/pkg/irredsol-1.4/lib/
H A Drecognize.gi185 cost, weight, mingens, mincost, mingenspos, totalcost, pos, d, ind, imgs, hom, count,
291 totalcost := 1;
314 totalcost := totalcost + cost[pos];
323 totalcost := totalcost-cost[genspos[j]];
328 if totalcost > mincost then
334 if totalcost < mincost then
336 mincost := totalcost;
340 Info(InfoMorph, 3, "ConjugatingMat: found generating system of cost ", totalcost);
/dports/devel/mercurial/mercurial-6.0/mercurial/
H A Dutil.py1459 self.totalcost = 0
1485 self.totalcost -= node.cost
1488 self.totalcost += cost
1504 self.totalcost -= node.cost
1510 self.totalcost += cost
1535 self.totalcost -= node.cost
1571 self.totalcost -= n.cost
1631 self.totalcost -= n.cost
1701 if len(self) <= 1 or self.totalcost <= self.maxcost:
1723 while len(self) > 1 and self.totalcost > targetcost:
[all …]
/dports/archivers/maxcso/maxcso-1.10.0/zopfli/src/zopfli/
H A Ddeflate.c745 double totalcost = 0; in ZopfliDeflatePart() local
787 totalcost += ZopfliCalculateBlockSizeAutoType(&store, 0, store.size); in ZopfliDeflatePart()
811 if (totalcost2 < totalcost) { in ZopfliDeflatePart()
/dports/archivers/zopfli/zopfli-zopfli-1.0.3/src/zopfli/
H A Ddeflate.c820 double totalcost = 0; in ZopfliDeflatePart() local
862 totalcost += ZopfliCalculateBlockSizeAutoType(&store, 0, store.size); in ZopfliDeflatePart()
886 if (totalcost2 < totalcost) { in ZopfliDeflatePart()
/dports/archivers/pigz/pigz-2.6/zopfli/src/zopfli/
H A Ddeflate.c821 double totalcost = 0; in ZopfliDeflatePart() local
863 totalcost += ZopfliCalculateBlockSizeAutoType(&store, 0, store.size); in ZopfliDeflatePart()
887 if (totalcost2 < totalcost) { in ZopfliDeflatePart()

12