Home
last modified time | relevance | path

Searched refs:bestval (Results 1 – 25 of 113) sorted by relevance

12345

/dports/games/shockolate/systemshock-0.8.2-43-ga9eb1b93/src/GameSrc/
H A Dminimax.c123 int value, bestval; in minimax_step() local
135 FSTACK_POPVAR(bestval); in minimax_step()
150 bestval = minimize ? INT_MAX : INT_MIN; in minimax_step()
152 if ((!minimize) ^ (value < bestval)) { // new value is better than previous in minimax_step()
153 bestval = value; in minimax_step()
161 if (bestval == (minimize ? INT_MIN : INT_MAX)) { in minimax_step()
163 FSTACK_PUSHVAR(bestval); in minimax_step()
171 bestval = static_evaluator(boardpos); in minimax_step()
173 FSTACK_PUSHVAR(bestval); in minimax_step()
180 FSTACK_PUSHVAR(bestval); in minimax_step()
[all …]
/dports/audio/sc3-plugins/sc3-plugins-Version-3.9.0/source/MCLDUGens/
H A DMCLDBufferUGens.cpp489 bestval = -INFINITY; in BufMax_next()
502 ZOUT0(0) = bestval; in BufMax_next()
528 bestval = INFINITY; in BufMin_next()
541 ZOUT0(0) = bestval; in BufMin_next()
559 float val, bestval; in ArrayMax_next() local
566 if(bestval < val){ in ArrayMax_next()
567 bestval = val; in ArrayMax_next()
590 float val, bestval; in ArrayMin_next() local
593 bestval = INFINITY; in ArrayMin_next()
597 if(bestval > val){ in ArrayMin_next()
[all …]
/dports/math/chaco/Chaco-2.2/code/bpmatch/
H A Dcheckbp.c25 double val, bestval; /* value to decide set assignment */ local
44 bestval = 0;
52 if (j == 0 || val < bestval) {
53 bestval = val;
62 if (fabs(setval - bestval) >= tol * (fabs(setval) + fabs(bestval))) {
64 i, sets[i], setval, bestset, bestval);
H A Dinits2d.c23 double val, bestval; /* values for determining set preferences */ local
56 bestval = 0;
59 if (j == 0 || val < bestval) {
60 bestval = val;
H A Dinits3d.c23 double val, bestval; /* values for determining set preferences */ local
80 bestval = 0;
83 if (j == 0 || val < bestval) {
84 bestval = val;
/dports/games/xataxx/xataxx/
H A Dnubot.c163 int temp, bestval = (-10000); local
192 if (vall[ix] > bestval) bestval = vall[ix];
196 for (ix=0; movel[ix].ox!=(-1) && (vall[ix]!=bestval || random()%2); ix++);
205 if (vall[ix]==bestval) {
217 if (vall[ix]==bestval && (!movel[ix].jump)) gomove--;
226 if (vall[ix]==bestval) gomove--;
251 int temp, bestval = (-10000); local
268 vall = -veb(oplayer, tboard[depth], depth+1, -bestval);
269 if (vall > bestval) bestval = vall;
270 if (bestval >= dee) return bestval;
[all …]
/dports/math/SCIP/scip-7.0.3/examples/TSP/src/
H A DHeurFrats.cpp141 SCIP_Real bestval; in SCIP_DECL_HEUREXEC() local
146 bestval = -1; in SCIP_DECL_HEUREXEC()
157 if( SCIPgetSolVal(scip, sol, edge->var) > bestval && !visited[edge->adjac->id] in SCIP_DECL_HEUREXEC()
160 bestval = SCIPgetSolVal(scip, sol, edge->var); in SCIP_DECL_HEUREXEC()
178 bestval = SCIPgetSolVal(scip, sol, edge->var); in SCIP_DECL_HEUREXEC()
188 if( bestval == -1 ) in SCIP_DECL_HEUREXEC()
196 assert(SCIPisFeasLE(scip, 0.0, bestval) && SCIPisFeasLE(scip, bestval, 1.0)); in SCIP_DECL_HEUREXEC()
197 assert(bestval == SCIPgetSolVal(scip, sol, bestedge->var)); /*lint !e777*/ in SCIP_DECL_HEUREXEC()
/dports/math/concorde/concorde/TINY/
H A Dbnbmsp.c86 double bestval; member
137 s.bestval = initlimit; in CCtiny_bnb_msp()
247 if (s.bestval >= initlimit) { in CCtiny_bnb_msp()
608 double bestval; in select_edge() local
623 bestval = 0.0; in select_edge()
697 int bestval; in select_edge() local
702 bestval = -1; in select_edge()
722 if (bestval >= 0) { in select_edge()
734 bestval = adjvec[j].weight; in select_edge()
742 if (bestval == -1) { in select_edge()
[all …]
/dports/math/chaco/Chaco-2.2/code/klvspiff/
H A Dnway_klv.c198 bestval = -maxdval - 1;
216 bestval = ltop - maxdval;
237 if (rtop - maxdval > bestval ||
238 (rtop - maxdval == bestval &&
245 bestval = rtop - maxdval;
249 if (bestval == -maxdval - 1) { /* No allowed moves */
294 gtotal += bestval;
314 if (bestval < 0) {
333 gtotal -= bestval;
339 else if (bestval > 0) {
[all …]
/dports/multimedia/v4l-utils/linux-5.13-rc2/drivers/clk/actions/
H A Dowl-factor.c74 int bestval = 0; in owl_clk_val_best() local
81 bestval = _get_table_val(clkt, rate, parent_rate); in owl_clk_val_best()
82 return bestval; in owl_clk_val_best()
105 bestval = clkt->val; in owl_clk_val_best()
111 if (!bestval) { in owl_clk_val_best()
112 bestval = _get_table_maxval(clkt); in owl_clk_val_best()
117 return bestval; in owl_clk_val_best()
/dports/multimedia/v4l_compat/linux-5.13-rc2/drivers/clk/actions/
H A Dowl-factor.c74 int bestval = 0; in owl_clk_val_best() local
81 bestval = _get_table_val(clkt, rate, parent_rate); in owl_clk_val_best()
82 return bestval; in owl_clk_val_best()
105 bestval = clkt->val; in owl_clk_val_best()
111 if (!bestval) { in owl_clk_val_best()
112 bestval = _get_table_maxval(clkt); in owl_clk_val_best()
117 return bestval; in owl_clk_val_best()
/dports/multimedia/libv4l/linux-5.13-rc2/drivers/clk/actions/
H A Dowl-factor.c74 int bestval = 0; in owl_clk_val_best() local
81 bestval = _get_table_val(clkt, rate, parent_rate); in owl_clk_val_best()
82 return bestval; in owl_clk_val_best()
105 bestval = clkt->val; in owl_clk_val_best()
111 if (!bestval) { in owl_clk_val_best()
112 bestval = _get_table_maxval(clkt); in owl_clk_val_best()
117 return bestval; in owl_clk_val_best()
/dports/math/SCIP/scip-7.0.3/src/scip/
H A Dbranch_inference.c140 …SCIP_Real* bestval /**< pointer to the solution value of the currently best… in evaluateAggrCand() argument
149 (*bestval) = val; in evaluateAggrCand()
177 (*bestval) = val; in evaluateAggrCand()
329 SCIP_Real bestval; in performBranching() local
359 bestval = SCIP_UNKNOWN; in performBranching()
368 bestval = candsols[0]; in performBranching()
411 evaluateAggrCand(cand, aggrscore, val, &bestaggrcand, &bestaggrscore, &bestval); in performBranching()
422 bestval = candsols[0]; in performBranching()
424 bestval = SCIP_UNKNOWN; in performBranching()
455 evaluateAggrCand(cand, aggrscore, val, &bestaggrcand, &bestaggrscore, &bestval); in performBranching()
[all …]
/dports/games/xonotic/Xonotic/misc/tools/
H A Dweapon-profiler-analyzer.pl34 my $bestval = 0;
38 if($v*$v > $bestval*$bestval)
41 $bestval = $v;
55 $bigmatrix[$j]->[$k] -= $bigmatrix[$i]->[$k] * $r / $bestval;
63 my $bestval = $bigmatrix[$i]->[$i];
69 $bigmatrix[$j]->[$k] -= $bigmatrix[$i]->[$k] * $r / $bestval;
/dports/math/chaco/Chaco-2.2/code/klspiff/
H A Dnway_kl.c77 int bestval; /* best change in value for a vtx move */ local
248 bestval = -maxdval - 1;
275 if (k - maxdval > bestval) {
276 bestval = k - maxdval;
286 else if (k - maxdval == bestval) {
302 bestval = k - maxdval;
314 if (bestval == -maxdval - 1) { /* No allowed moves */
346 gtotal += bestval;
362 step, bestvtx, bestval, bestfrom, bestto);
366 if (bestval < 0) {
[all …]
H A Dnway_kl.old74 int bestval; /* best change in value for a vtx move */
238 bestval = -maxdval - 1;
274 if ((!enforce_balance_hard && k - maxdval > bestval) ||
276 bestval = k - maxdval;
305 bestval = k - maxdval;
317 if (bestval == -maxdval - 1) { /* No allowed moves */
348 gtotal += bestval;
355 printf("At KL step %d, bestvtx=%d, bestval=%d (%d-> %d)\n",
356 step, bestvtx, bestval, bestfrom, bestto);
360 if (bestval < 0) {
[all …]
/dports/games/mahjong/mj-1.16-src/
H A Dgreedy.c654 double bestval,val; in check_discard() local
706 bestval = val; in check_discard()
725 bestval = val; in check_discard()
746 bestval = val; in check_discard()
758 bestval = val; in check_discard()
770 bestval = val; in check_discard()
1460 bestval = -1000.0; in maybe_switch_strategy()
1475 bestval = val ; in maybe_switch_strategy()
1494 bestval = -1000; in maybe_switch_strategy()
1503 bestval = val ; in maybe_switch_strategy()
[all …]
/dports/games/NBlood/NBlood-a1689a4/source/build/src/
H A Dcache1d.cpp124 int32_t bestval = INT32_MAX; in findBlock() local
152 if (daval >= bestval) in findBlock()
156 if (daval < bestval) in findBlock()
158 bestval = daval; in findBlock()
162 if (bestval == 0) in findBlock()
167 return bestval; in findBlock()
/dports/science/fasthenry/fasthenry-3.0wr/src/fasthenry/
H A Ddirect.c205 double normal, multiplier, bestval, nextbest; local
211 bestval = ABS(mat[i][i]);
214 if(nextbest > bestval) {
216 bestval = nextbest;
225 bestval = mat[k][best];
227 mat[k][i] = bestval;
256 bestval = mat[k][i];
258 mat[k][i] = bestval;
/dports/games/crimson/crimson-0.5.3/src/cf/
H A Dai.cpp259 if ( val > bestval ) { in AssignObjectives()
260 bestval = val; in AssignObjectives()
321 bestval = 0; in BuildReinforcements()
334 bestval = val; in BuildReinforcements()
849 unsigned short bestval = 0; in FindBestTarget() local
878 if ( val > bestval ) { in FindBestTarget()
879 bestval = val; in FindBestTarget()
951 bestval = vals[i]; in FindBestHex()
994 bestval = val; in FindTransport()
1023 if ( val > bestval ) { in FindTransport()
[all …]
/dports/science/fastcap/fastcap-2.0wr/src/
H A Ddirect.c238 double normal, multiplier, bestval, nextbest; local
244 bestval = ABS(mat[i][i]);
247 if(nextbest > bestval) {
249 bestval = nextbest;
258 bestval = mat[k][best];
260 mat[k][i] = bestval;
289 bestval = mat[k][i];
291 mat[k][i] = bestval;
/dports/graphics/jogamp-jogl/jogl/src/jogl/classes/jogamp/opengl/util/pngj/
H A DFilterWriteStrategy.java80 double bestval = Double.MAX_VALUE; in gimmeFilterType() local
85 if (val <= bestval) { in gimmeFilterType()
86 bestval = val; in gimmeFilterType()
/dports/math/alps/CHiPPS-ALPS-releases-2.0.1/Alps/examples/Knap/
H A DKnapTreeNode.cpp101 int bestval = 0; in process() local
106 bestval = -static_cast<int>(broker()->getIncumbentValue()); in process()
117 if (valRelax <= bestval) in process()
129 if (bestval < val) { // Find a better solution in process()
/dports/games/crafty/crafty-25.2_1/
H A Dnext.c18 int hist, bestval, possible; in NextMove() local
272 bestval = -99999999; in NextMove()
281 if (hist > bestval) { in NextMove()
282 bestval = hist; in NextMove()
307 bestval = -99999999; in NextMove()
312 if (hist > bestval) { in NextMove()
313 bestval = hist; in NextMove()
/dports/math/octave-forge-optim/optim-1.6.1/inst/
H A Dde_min.m122 function [bestmem, bestval, nfeval, convergence] = de_min(fcn, varargin)
235 bestval = val(1); # best objective function value so far variable
239 if (val(i) < bestval) # if member is better
241 bestval = val(i); variable
247 bestvalit = bestval; # best value of current iteration
263 ((abs (max (val) - bestval) / max (1, abs (max (val))) > tol)))
371 ## we update bestval only in case of success to save time
373 bestval = tempval; # new best value variable
391 iter, bestval, max(val));
418 if (bestval <= VTR)
[all …]

12345