| /dports/games/flare-engine/flare-engine-1.12/src/ |
| H A D | AStarContainer.cpp | 25 , node_limit(_node_limit) in AStarContainer()
29 nodes.resize(node_limit, NULL); in AStarContainer()
49 if (size >= node_limit) return; in add()
161 , node_limit(_node_limit) in AStarCloseContainer()
165 nodes.resize(node_limit, NULL); in AStarCloseContainer()
185 if (size >= node_limit) return; in add()
|
| H A D | AStarContainer.h | 53 unsigned int node_limit; variable
104 unsigned int node_limit; variable
|
| /dports/multimedia/ppm2fli/ppm2fli-2.1/ |
| H A D | amain.c | 157 node_limit = 2 * FLI_MAX_COLORS; in main()
253 { GETNUMBER(node_limit);} in main()
371 if ((node_limit < MIN_NODE_LIMIT) || (node_limit > MAX_NODE_LIMIT)) in main()
373 fprintf(stderr,"Invalid node limit specified: %d\n",node_limit); in main()
|
| H A D | apro.h | 101 EXT int node_limit, reduce_dynamics, color_depth; variable
|
| H A D | alist.c | 109 fprintf(stdout,"Octree node limit: %d\n",node_limit); in make_fli()
|
| H A D | aoctree.c | 375 if (node_count[depth] >= node_limit) /* reduce octree */ in add_to_large_octree()
|
| /dports/sysutils/slurm-wlm/slurm-20.02.7/src/slurmctld/ |
| H A D | ping_nodes.c | 388 int node_test_cnt = 0, node_limit, node_states, run_cyclic; in run_health_check()
423 node_limit = 0; in run_health_check()
441 node_limit = (node_record_count * 2) / in run_health_check()
443 node_limit = MAX(node_limit, 10); in run_health_check()
458 if (node_test_cnt++ >= node_limit) in run_health_check()
|
| /dports/sysutils/slurm-wlm/slurm-20.02.7/testsuite/expect/ |
| H A D | test21.40 | 108 set node_limit 0
112 set node_limit 1
116 set node_limit 1
126 return $node_limit
|
| /dports/www/osrm-backend/osrm-backend-5.26.0/src/contractor/ |
| H A D | contractor_search.cpp | 55 const int node_limit, in search() argument
66 if (++nodes > node_limit) in search()
|
| /dports/math/gap/gap-4.11.0/pkg/ferret-1.0.2/YAPB++/source/search/ |
| H A D | search_options.hpp | 131 long long node_limit; member
134 only_find_generators(true), find_canonical_perm(false), just_rbase(false), node_limit(-1) in SearchOptions()
|
| H A D | search.hpp | 63 if(so.node_limit >= 0 && Stats::container().node_count >= so.node_limit) in doSearchBranch()
|
| /dports/games/gnugo/gnugo-3.8/engine/ |
| H A D | persistent.c | 104 int node_limit; member
268 if (entry->node_limit != -1) in print_persistent_cache_entry()
269 gprintf("%onode_limit = %d\n", entry->node_limit); in print_persistent_cache_entry()
386 Hash_data *goal_hash, int node_limit) in find_persistent_cache_entry() argument
397 && (entry->node_limit >= node_limit || entry->result_certain) in find_persistent_cache_entry()
414 Hash_data *goal_hash, int node_limit, in search_persistent_cache() argument
421 goal_hash, node_limit); in search_persistent_cache()
472 int certain, int node_limit, in store_persistent_cache() argument
517 entry->node_limit = node_limit; in store_persistent_cache()
965 int node_limit, int *result, int *move) in search_persistent_breakin_cache() argument
[all …]
|
| /dports/math/couenne/Couenne-releases-0.5.8/Couenne/test/ |
| H A D | couenne.opt.base | 2 node_limit 1000
|
| /dports/www/osrm-backend/osrm-backend-5.26.0/include/contractor/ |
| H A D | contractor_search.hpp | 19 const int node_limit,
|
| /dports/math/py-or-tools/or-tools-9.2/ortools/algorithms/ |
| H A D | knapsack_solver_for_cuts.h | 337 void set_node_limit(const int64_t node_limit) { node_limit_ = node_limit; } in set_node_limit() argument
|
| /dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/include/ |
| H A D | sym_tm_params.h | 80 int node_limit; member
|
| /dports/net-mgmt/etherape/etherape-0.9.20/src/ |
| H A D | appdata.h | 42 gint node_limit; /* Max number of nodes to show. If <0 it's not member
|
| H A D | appdata.c | 47 p->node_limit = -1; in appdata_init()
|
| H A D | main.c | 111 {"node-limit", 'l', POPT_ARG_INT, &(appdata.node_limit), 0, in main()
|
| H A D | diagram.c | 1144 if (appdata.node_limit < 0) { in limit_nodes()
1149 limit = appdata.node_limit; in limit_nodes()
|
| /dports/math/giacxcas/giac-1.6.0/src/ |
| H A D | lpsolve.h | 69 int node_limit; member
|
| H A D | lpsolve.cc | 208 node_limit=RAND_MAX; in lp_settings()
998 if (stats.subproblems_examined>=settings.node_limit) { in solve()
1604 parse_limit(rh,prob.settings.node_limit,prob.ctx); in parse_options_and_bounds()
|
| /dports/math/gap/gap-4.11.0/pkg/ferret-1.0.2/src/ |
| H A D | cppmapper.cc | 130 so.node_limit = GAP_get<long>(limit); in fillSearchOptions()
|
| /dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/src/LP/ |
| H A D | lp_heuristics.c | 3629 int node_limit = 10; in lbranching_search() local
3632 sym_set_int_param(env, "node_limit", node_limit); in lbranching_search()
4534 int node_limit = 0; in restricted_search() local
4538 node_limit = MAX(100, MIN(200, 2*(int_num - max_int_fix - unfix_int_inc_cnt))); in restricted_search()
4542 node_limit = MAX(200, MIN(500, 2*(int_num - max_int_fix - unfix_int_inc_cnt))); in restricted_search()
4552 sym_set_int_param(env, "node_limit", node_limit); in restricted_search()
4562 p->par.fr_max_nodes = 10*node_limit; in restricted_search()
4564 p->par.rs_max_nodes = 10*node_limit; in restricted_search()
|
| /dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/src/TreeManager/ |
| H A D | tm_func.c | 354 (tm->par.node_limit >= 0 ?
355 tm->stat.analyzed < tm->par.node_limit : TRUE)
493 }else if (tm->par.node_limit >= 0 &&
494 tm->stat.analyzed >= tm->par.node_limit){
1689 if (tm->par.node_limit >= 0 && tm->stat.analyzed >= tm->par.node_limit){
|