Home
last modified time | relevance | path

Searched refs:max_cost (Results 1 – 25 of 368) sorted by relevance

12345678910>>...15

/dports/science/py-access/access-1.1.3/access/
H A Dfca.py7 def weighted_catchment(loc_df, cost_df, max_cost = None, cost_source = "origin", cost_dest = "dest"… argument
55 if max_cost is not None: temp = temp[temp[cost_cost] < max_cost].copy()
77 def fca_ratio(demand_df, supply_df, demand_cost_df, supply_cost_df, max_cost, argument
141 total_demand_series = weighted_catchment(demand_df, demand_cost_df, max_cost,
146 total_supply_series = weighted_catchment(supply_df, supply_cost_df, max_cost,
165 def two_stage_fca(demand_df, supply_df, cost_df, max_cost = None, argument
218 total_demand_series = weighted_catchment(demand_df, cost_df, max_cost,
238 two_stage_fca_series = weighted_catchment(supply_to_total_demand_frame, cost_df, max_cost,
246 def three_stage_fca(demand_df, supply_df, cost_df, max_cost, argument
307 total_demand_series = weighted_catchment(demand_df, cost_df, max_cost,
[all …]
H A Daccess.py267 weight_fn = None, max_cost = None, normalize = False): argument
317 weight_fn = weight_fn, max_cost = max_cost)
336 supply_values = None, max_cost = None, normalize = False, argument
441 max_cost = max_cost, normalize = normalize, noise = noise)
628 def two_stage_fca(self, name = "2sfca", cost = None, max_cost = None, argument
766 … max_cost = max_cost, weight_fn = weight_fn, normalize = normalize)
784 max_cost = None, weight_fn = None, normalize = False): argument
905 return self.two_stage_fca(name, cost, max_cost, supply_values, weight_fn, normalize)
909 max_cost = None, weight_fn = None, normalize = False): argument
1018 … max_cost = max_cost, weight_fn = weight_fn, normalize = normalize)
/dports/biology/clustal-omega/clustal-omega-1.2.4/src/kmpp/
H A DKMeans.cpp86 Scalar *min_cost, Scalar *max_cost, Scalar *total_cost, in RunKMeansOnce() argument
115 if (*max_cost < old_cost) *max_cost = old_cost; in RunKMeansOnce()
124 void LogMetaStats(Scalar min_cost, Scalar max_cost, Scalar total_cost, in LogMetaStats() argument
128 << " max=" << max_cost << endl); in LogMetaStats()
147 Scalar min_cost = -1, max_cost = -1, total_cost = 0; in RunKMeans() local
171 RunKMeansOnce(tree, n, k, d, points, centers, &min_cost, &max_cost, &total_cost, start_time, in RunKMeans()
174 LogMetaStats(min_cost, max_cost, total_cost, min_time, max_time, total_time, attempts); in RunKMeans()
195 Scalar min_cost = -1, max_cost = -1, total_cost = 0; in RunKMeansPlusPlus() local
206 RunKMeansOnce(tree, n, k, d, points, centers, &min_cost, &max_cost, &total_cost, start_time, in RunKMeansPlusPlus()
209 LogMetaStats(min_cost, max_cost, total_cost, min_time, max_time, total_time, attempts); in RunKMeansPlusPlus()
/dports/games/wesnoth/wesnoth-1.14.17/data/lua/wml/
H A Dfind_path.lua34 local max_cost = nil
35 …if not allow_multiple_turns then max_cost = unit.moves end --to avoid wrong calculation on already…
48 …local path, cost = wesnoth.find_path( unit, location[1], location[2], { max_cost = max_cost, ignor…
67 max_cost = max_cost,
109 max_cost = max_cost,
/dports/lang/python310/Python-3.10.1/Python/
H A Dsuggestions.c40 size_t max_cost) in levenshtein_distance() argument
62 return max_cost + 1; in levenshtein_distance()
72 if ((b_size - a_size) * MOVE_COST > max_cost) { in levenshtein_distance()
73 return max_cost + 1; in levenshtein_distance()
117 if (minimum > max_cost) { in levenshtein_distance()
119 return max_cost + 1; in levenshtein_distance()
272 _Py_UTF8_Edit_Cost(PyObject *a, PyObject *b, Py_ssize_t max_cost) in _Py_UTF8_Edit_Cost() argument
284 if (max_cost == -1) { in _Py_UTF8_Edit_Cost()
285 max_cost = MOVE_COST * Py_MAX(size_a, size_b); in _Py_UTF8_Edit_Cost()
287 return levenshtein_distance(utf8_a, size_a, utf8_b, size_b, max_cost); in _Py_UTF8_Edit_Cost()
/dports/lang/python311/Python-3.11.0a3/Python/
H A Dsuggestions.c42 size_t max_cost) in levenshtein_distance() argument
64 return max_cost + 1; in levenshtein_distance()
74 if ((b_size - a_size) * MOVE_COST > max_cost) { in levenshtein_distance()
75 return max_cost + 1; in levenshtein_distance()
119 if (minimum > max_cost) { in levenshtein_distance()
121 return max_cost + 1; in levenshtein_distance()
280 _Py_UTF8_Edit_Cost(PyObject *a, PyObject *b, Py_ssize_t max_cost) in _Py_UTF8_Edit_Cost() argument
292 if (max_cost == -1) { in _Py_UTF8_Edit_Cost()
293 max_cost = MOVE_COST * Py_MAX(size_a, size_b); in _Py_UTF8_Edit_Cost()
295 return levenshtein_distance(utf8_a, size_a, utf8_b, size_b, max_cost); in _Py_UTF8_Edit_Cost()
/dports/math/z3/z3-z3-4.8.13/contrib/qprofdiff/
H A Dmain.cpp37 typedef struct { unsigned num_instances, max_generation, max_cost; } map_entry; member
78 entry.num_instances = entry.max_generation = entry.max_cost = 0; in parse()
87 entry.max_cost = max(entry.max_cost, (unsigned)atoi(tokens[3].c_str())); in parse()
102 ", " << it->second.max_cost << endl; in display_data()
126 DIFF_LT(max_cost) in DIFF_LT()
172 de.d_max_cost = lentry.max_cost - rentry.max_cost; in diff()
180 de.d_max_cost = lentry.max_cost; in diff()
197 de.d_max_cost = -(int)rentry.max_cost; in diff()
/dports/math/py-z3-solver/z3-z3-4.8.10/contrib/qprofdiff/
H A Dmain.cpp37 typedef struct { unsigned num_instances, max_generation, max_cost; } map_entry; member
78 entry.num_instances = entry.max_generation = entry.max_cost = 0; in parse()
87 entry.max_cost = max(entry.max_cost, (unsigned)atoi(tokens[3].c_str())); in parse()
102 ", " << it->second.max_cost << endl; in display_data()
126 DIFF_LT(max_cost) in DIFF_LT()
172 de.d_max_cost = lentry.max_cost - rentry.max_cost; in diff()
180 de.d_max_cost = lentry.max_cost; in diff()
197 de.d_max_cost = -(int)rentry.max_cost; in diff()
/dports/math/py-or-tools/or-tools-9.2/examples/python/
H A Dshift_scheduling_sat.py60 soft_max, hard_max, max_cost, prefix):
111 if max_cost > 0:
121 cost_coefficients.append(max_cost * (length - soft_max))
131 soft_max, hard_max, max_cost, prefix):
176 if soft_max < hard_max and max_cost > 0:
182 cost_coefficients.append(max_cost)
304 shift, hard_min, soft_min, min_cost, soft_max, hard_max, max_cost = ct
309 max_cost,
316 shift, hard_min, soft_min, min_cost, soft_max, hard_max, max_cost = ct
322 hard_max, max_cost,
/dports/games/exult/exult-snapshot-v1.7.0.20211128/
H A Dpaths.cc53 int max_cost = 3 * cost_to_goal; in get_max_cost() local
57 return max_cost > min_max_cost ? max_cost : min_max_cost; in get_max_cost()
468 if (max_cost < 8) in get_max_cost()
469 max_cost = 8; in get_max_cost()
470 else if (max_cost > 64) in get_max_cost()
471 max_cost = 64; in get_max_cost()
472 return max_cost; in get_max_cost()
776 if (max_cost > scost) in get_max_cost()
777 max_cost = scost; in get_max_cost()
779 max_cost = 18; in get_max_cost()
[all …]
/dports/games/exult/exult-snapshot-v1.7.0.20211128/pathfinder/
H A DPathFinder.cc33 int max_cost = 3 * cost_to_goal; in get_max_cost() local
35 return max_cost < 74 ? 74 : max_cost; in get_max_cost()
H A Dpath.cc351 int max_cost = client->estimate_cost(start, goal); in Find_path() local
353 nodes.add(new Search_node(start, 0, max_cost, nullptr)); in Find_path()
355 max_cost = client->get_max_cost(max_cost); in Find_path()
384 if (new_cost + new_goal_cost >= max_cost) in Find_path()
/dports/devel/mercurial/mercurial-6.0/mercurial/
H A Dlsprofcalltree.py43 max_cost = 0
46 max_cost = max(max_cost, totaltime)
47 self.out_file.write(b'summary: %d\n' % max_cost)
/dports/net/exabgp4/exabgp-4.2.13/lib/exabgp/vendoring/
H A Dlsprofcalltree.py38 max_cost = 0
41 max_cost = max(max_cost, totaltime)
42 print('summary: %d' % (max_cost,), file=self.out_file)
/dports/print/lyx/lyx-2.3.4.2/src/support/
H A DCache.h48 Cache(int max_cost = 100) : Q(max_cost) {} in Q() argument
73 int max_cost() const { return Q::maxCost(); } in max_cost() function
/dports/graphics/vigra/vigra-8acd73a/include/vigra/
H A Dseededregiongrowing.hxx426 double max_cost) in doxygen_overloaded_function()
507 if((srgType & StopAtThreshold) != 0 && cost > max_cost) in doxygen_overloaded_function()
633 double max_cost = NumericTraits<double>::max()) in seededRegionGrowing() argument
638 stats, srgType, n, max_cost); in seededRegionGrowing()
685 double max_cost = NumericTraits<double>::max()) in seededRegionGrowing() argument
692 stats, srgType, n, max_cost); in seededRegionGrowing()
747 double max_cost, in fastSeededRegionGrowing() argument
819 if((srgType & StopAtThreshold) != 0 && cost > max_cost) in fastSeededRegionGrowing()
918 double max_cost, in fastSeededRegionGrowing() argument
923 stats, srgType, n, max_cost, bucket_count); in fastSeededRegionGrowing()
[all …]
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/Heuristics/
H A Dmst_ins_rout.c40 int *intree = NULL, max_cost; in make_k_tree() local
94 max_cost = -MAXINT; in make_k_tree()
97 max_cost){ in make_k_tree()
98 max_cost = cost; in make_k_tree()
101 if ((cost = MCOST(&p->dist, 0, i, lamda) - max_cost) < next_mu){ in make_k_tree()
/dports/games/spring/spring_98.0/AI/Skirmish/AAI/
H A DAAIBuildTable.cpp126 max_cost[i][s] = -1; in AAIBuildTable()
182 max_cost.clear(); in ~AAIBuildTable()
891 this->max_cost[i][s] = 0; in PrecacheStats()
1250 this->max_cost[i][s] = 0; in PrecacheCosts()
1926 float max_cost = this->max_cost[GROUND_ASSAULT][side]; in GetGroundAssault() local
2016 float max_cost = this->max_cost[HOVER_ASSAULT][side]; in GetHoverAssault() local
2099 float max_cost = this->max_cost[AIR_ASSAULT][side]; in GetAirAssault() local
2181 float max_cost = this->max_cost[SEA_ASSAULT][side]; in GetSeaAssault() local
2263 float max_cost = this->max_cost[SUBMARINE_ASSAULT][side]; in GetSubmarineAssault() local
3182 float max_cost = 0; in BuildFactoryFor() local
[all …]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/webrtc/call/adaptation/
H A Dnew_resource_adaptation_processor_poc.cc98 double max_cost = -1.0; in FindMostExpensiveConsumerThatCanBeAdaptedDown() local
103 if (max_cost < cost) { in FindMostExpensiveConsumerThatCanBeAdaptedDown()
105 max_cost = cost; in FindMostExpensiveConsumerThatCanBeAdaptedDown()
/dports/biology/ncbi-toolkit/ncbi/tools/
H A Dmbalign.c569 max_cost = MAX(Mis_cost, gap_open+GE_cost); in GreedyAlignMemAlloc()
574 Malloc((MAX(max_d, max_cost) + 2) * sizeof(ThreeValPtr)); in GreedyAlignMemAlloc()
581 for (i = 1; i <= max_cost; i++) in GreedyAlignMemAlloc()
874 Int4 max_cost; in MegaBlastAffineGreedyAlign() local
910 max_cost = MAX(Mis_cost, GO_cost+GE_cost); in MegaBlastAffineGreedyAlign()
959 upper = uplow_free+max_d+1+max_cost; in MegaBlastAffineGreedyAlign()
962 lower += max_cost; in MegaBlastAffineGreedyAlign()
963 upper += max_cost; in MegaBlastAffineGreedyAlign()
1089 if (lower[d-max_cost] <= upper[d-max_cost]) stop_condition--; in MegaBlastAffineGreedyAlign()
1096 if (d > max_cost) { in MegaBlastAffineGreedyAlign()
[all …]
/dports/math/z3/z3-z3-4.8.13/examples/python/
H A Drc2.py45 print("cost [", self.min_cost, ":", self.max_cost, "]")
48 self.max_cost = min(self.max_cost, self.get_cost())
114 self.max_cost = sum(Ws[c] for c in Ws)
/dports/math/py-z3-solver/z3-z3-4.8.10/examples/python/
H A Drc2.py47 print("cost [", self.min_cost, ":", self.max_cost, "]")
50 self.max_cost = min(self.max_cost, self.get_cost())
116 self.max_cost = sum(Ws[c] for c in Ws)
/dports/devel/ccdoc/ccdocv08r41/test/
H A Dtest74.h16 max_cost(cmax) in Test()
21 max_cost(cmax) in Test()
/dports/devel/libfirm/libfirm-1.21.0/ir/adt/
H A Dhungarian.c51 unsigned max_cost; /**< the maximal costs in the matrix */ member
122 unsigned max_cost = p->max_cost; in hungarian_prepare_cost_matrix() local
125 cost[r*num_cols + c] = max_cost - cost[r*num_cols + c]; in hungarian_prepare_cost_matrix()
142 p->max_cost = MAX(p->max_cost, cost); in hungarian_add()
/dports/textproc/libtre/tre-0.8.0/src/
H A Dagrep.c368 match_params.max_cost = best_cost; in tre_agrep_handle_file()
498 match_params.max_cost = 0; in main()
575 match_params.max_cost = atoi(optarg); in main()
642 match_params.max_cost = c - '0'; in main()
794 match_params.max_cost = INT_MAX; in main()
809 match_params.max_cost = best_cost; in main()

12345678910>>...15