Home
last modified time | relevance | path

Searched refs:best2 (Results 1 – 25 of 125) sorted by relevance

12345

/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/misc/espresso/
H A Dsolution.c95 solution_choose_best(best1, best2) in solution_choose_best() argument
96 solution_t *best1, *best2; in solution_choose_best()
99 if (best2 != NIL(solution_t)) {
100 if (best1->cost <= best2->cost) {
101 solution_free(best2);
105 return best2;
111 if (best2 != NIL(solution_t)) {
112 return best2;
/dports/games/netradiant/netradiant-20150621-src/tools/quake3/q3map2/
H A Dlightmaps.c59 int best, best2; in AllocLMBlock() local
64 best2 = 0; in AllocLMBlock()
70 if ( allocated[i + j] > best2 ) { in AllocLMBlock()
71 best2 = allocated[i + j]; in AllocLMBlock()
76 *y = best = best2; in AllocLMBlock()
/dports/www/pmwiki/pmwiki-2.2.141/scripts/
H A Dphpdiff.php63 $best1 = $t1_end; $best2 = $t2_end;
65 while(($s1 + $s2 - $a1 - $a2) < ($best1 + $best2 - $a1 - $a2)) {
69 if ($d >= $s1 && ($d + $s2 - $a1 - $a2) < ($best1 + $best2 - $a1 - $a2))
70 { $best1 = $d; $best2 = $s2; }
74 if ($d >= $s2 && ($s1 + $d - $a1 - $a2) < ($best1 + $best2 - $a1 - $a2))
75 { $best1 = $s1; $best2 = $d; }
79 while ($a2 < $best2) { $actions[] = 2; $a2++; } # added elements
/dports/math/cudd/cudd-3.0.0/dddmp/exp/
H A Dtest7.sh.in76 ${dest}/4.best2.tmp
141 ${dest}/4.best2.tmp
143 ${dest}/4.best2.tmp
147 ${dest}/4.best2.bdd.tmp
164 diff --strip-trailing-cr --brief ${where}/4.bdd.bis4 ${dest}/4.best2.bdd.tmp
168 ${dest}/4.node3.bdd.tmp ${dest}/4.best1.bdd.tmp ${dest}/4.best2.bdd.tmp \
169 ${dest}/4b.bdd.tmp ${dest}/4.best1.tmp ${dest}/4.best2.tmp \
/dports/comms/wsjtz/wsjtx/map65/libm65/
H A Dsynctst.f9035 best2=1.0
66 if(worst2.lt.best2) then
67 best2=worst2
80 print*,worst,best2,n0best,lagbest
/dports/lang/fpc-source/fpc-3.2.2/packages/ptc/src/dos/cga/
H A Dcga.pp205 best2 := I;
213 best2 := I;
221 best2 := I;
229 best2 := I;
237 0: best2 := best1;
239 if best1 > best2 then
242 best1 := best2;
243 best2 := tmp;
378 best1, best2: Integer;
450 res := best2
[all …]
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/
H A Dipa-modref-tree.c565 int best1 = -1, best2 = -1; in insert() local
573 best2 < 0 ? a : (*accesses)[best2])) in insert()
576 best2 = j; in insert()
581 best2 < 0 ? a : (*accesses)[best2])) in insert()
584 best2 = -1; in insert()
587 (*accesses)[best1].forced_merge (best2 < 0 ? a : (*accesses)[best2], in insert()
591 (best2 < 0 ? a : (*accesses)[best2])); in insert()
594 if (dump_file && best2 >= 0) in insert()
597 " merging %i and %i\n", best1, best2); in insert()
603 if (best2 >= 0) in insert()
/dports/biology/diamond/diamond-2.0.13/src/dp/
H A Dungapped_simd.cpp60 int8_t best2[CHANNELS]; in window_ungapped() local
61 best.store(best2); in window_ungapped()
64 out[i] = ScoreTraits<Sv>::int_score(best2[d + i]); in window_ungapped()
/dports/multimedia/mjpegtools/mjpegtools-2.1.0/utils/altivec/
H A Dfind_best_one_pel.c449 me_result_s best, best1, best2; in find_best_one_pel_altivec_verify() local
457 best2 = *best_so_far; in find_best_one_pel_altivec_verify()
459 if (best1.weight != best2.weight || in find_best_one_pel_altivec_verify()
460 best1.x != best2.x || in find_best_one_pel_altivec_verify()
461 best1.y != best2.y) in find_best_one_pel_altivec_verify()
469 best2.weight, best2.x, best2.y); in find_best_one_pel_altivec_verify()
/dports/math/freefem++/FreeFem-sources-4.6/examples/plugin/
H A Dcmaes-VarIneq.edp116 Vh best1,best2;
117 SSPToFEF(best1[],best2[],start);
119 Th = adaptmesh(Th,best1,best2);
121 ou2 = best2;
H A DVarIneq2.edp164 Vh best1,best2;
166 best2[] = start(Vh.ndof:2*Vh.ndof-1);
168 Th = adaptmesh(Th,best1,best2,err=0.05);
171 oldu2=best2;
/dports/math/freefem++/FreeFem-sources-4.6/examples/mpi/
H A Dcmaes-mpi-VarIneq.edp118 Vh best1,best2;
119 SSPToFEF(best1[],best2[],start);
121 Th = adaptmesh(Th,best1,best2);
123 ou2 = best2;
/dports/math/freefem++/FreeFem-sources-4.6/unit/parallel/
H A Dmpi-cmaes.edp113 Vh best1,best2;
114 SSPToFEF(best1[],best2[],start);
116 Th = adaptmesh(Th,best1,best2);
118 ou2 = best2;
/dports/math/ogdf/OGDF/src/coin/CoinUtils/
H A DCoinStructuredModel.cpp793 double best2[3]={0.0,0.0,0.0}; in decompose() local
960 best2[iWay]=best; in decompose()
963 best2[iWay]=-(numberRows-bestRowsDone); in decompose()
965 best2[iWay]=-numberRows; in decompose()
972 if (best2[2]<best2[0]||best2[2]<best2[1]) { in decompose()
975 if (best2[0]>best2[1]) { in decompose()
1334 double best2[3]={0.0,0.0,0.0}; in decompose() local
1471 best2[iWay]=best; in decompose()
1476 best2[iWay]=-numberColumns; in decompose()
1483 if (best2[2]<best2[0]||best2[2]<best2[1]) { in decompose()
[all …]
/dports/games/gtkradiant/GPL/GtkRadiant/tools/quake3/q3map2/
H A Dlightmaps.c59 int best, best2; in AllocLMBlock() local
64 best2 = 0; in AllocLMBlock()
70 if (allocated[i+j] > best2) { in AllocLMBlock()
71 best2 = allocated[i+j]; in AllocLMBlock()
76 *y = best = best2; in AllocLMBlock()
/dports/math/parmgridgen/ParMGridGen-1.0/MGridGen/Lib/
H A Dkwayfm.c741 realtype old, new, best, best1, best2, id, ed, maxar; in Random_KWayMultiObjRefine() local
851 if (best2 < old-new) { in Random_KWayMultiObjRefine()
852 best2 = old-new; in Random_KWayMultiObjRefine()
859 jbest2, best1, best2)); in Random_KWayMultiObjRefine()
869 best = best2; in Random_KWayMultiObjRefine()
871 printf("\t2nd OBJECTIVE. Gain: %8.6f\n", best2)); in Random_KWayMultiObjRefine()
939 realtype old, new, best, best1, best2, id, ed, maxar; in Random_KWayMultiObjRefine2() local
1038 if (best2 < old-new) { in Random_KWayMultiObjRefine2()
1039 best2 = old-new; in Random_KWayMultiObjRefine2()
1046 jbest2, best1, best2)); in Random_KWayMultiObjRefine2()
[all …]
/dports/math/z3/z3-z3-4.8.13/src/tactic/arith/
H A Dfix_dl_var_tactic.cpp196 unsigned best1, best2; in most_occs() local
199 r2 = most_occs(m_occs, best2); in most_occs()
206 tout << "r2 occs: " << best2 << "\n"; in most_occs()
209 if (best2 > NESTED_PENALTY * best1) in most_occs()
/dports/math/py-z3-solver/z3-z3-4.8.10/src/tactic/arith/
H A Dfix_dl_var_tactic.cpp196 unsigned best1, best2; in most_occs() local
199 r2 = most_occs(m_occs, best2); in most_occs()
206 tout << "r2 occs: " << best2 << "\n"; in most_occs()
209 if (best2 > NESTED_PENALTY * best1) in most_occs()
/dports/math/osi/Osi-0.108.6/CoinUtils/src/
H A DCoinStructuredModel.cpp782 double best2[3] = { 0.0, 0.0, 0.0 }; in decompose() local
946 best2[iWay] = best; in decompose()
949 best2[iWay] = -(numberRows - bestRowsDone); in decompose()
951 best2[iWay] = -numberRows; in decompose()
958 if (best2[2] < best2[0] || best2[2] < best2[1]) { in decompose()
961 if (best2[0] > best2[1]) { in decompose()
1360 double best2[3] = { 0.0, 0.0, 0.0 }; in decompose() local
1494 best2[iWay] = best; in decompose()
1499 best2[iWay] = -numberColumns; in decompose()
1506 if (best2[2] < best2[0] || best2[2] < best2[1]) { in decompose()
[all …]
/dports/math/coinutils/CoinUtils-2.11.4/CoinUtils/src/
H A DCoinStructuredModel.cpp782 double best2[3] = { 0.0, 0.0, 0.0 }; in decompose() local
946 best2[iWay] = best; in decompose()
949 best2[iWay] = -(numberRows - bestRowsDone); in decompose()
951 best2[iWay] = -numberRows; in decompose()
958 if (best2[2] < best2[0] || best2[2] < best2[1]) { in decompose()
961 if (best2[0] > best2[1]) { in decompose()
1360 double best2[3] = { 0.0, 0.0, 0.0 }; in decompose() local
1494 best2[iWay] = best; in decompose()
1499 best2[iWay] = -numberColumns; in decompose()
1506 if (best2[2] < best2[0] || best2[2] < best2[1]) { in decompose()
[all …]
/dports/math/clp/Clp-1.17.3/CoinUtils/src/
H A DCoinStructuredModel.cpp782 double best2[3] = { 0.0, 0.0, 0.0 }; in decompose() local
946 best2[iWay] = best; in decompose()
949 best2[iWay] = -(numberRows - bestRowsDone); in decompose()
951 best2[iWay] = -numberRows; in decompose()
958 if (best2[2] < best2[0] || best2[2] < best2[1]) { in decompose()
961 if (best2[0] > best2[1]) { in decompose()
1360 double best2[3] = { 0.0, 0.0, 0.0 }; in decompose() local
1494 best2[iWay] = best; in decompose()
1499 best2[iWay] = -numberColumns; in decompose()
1506 if (best2[2] < best2[0] || best2[2] < best2[1]) { in decompose()
[all …]
/dports/math/freefem++/FreeFem-sources-4.6/unit/plugins/
H A Dff-NLopt.edp165 Vh best1,best2;
167 best2[] = start(Vh.ndof:2*Vh.ndof-1);
169 Th = adaptmesh(Th,best1,best2,err=0.05);
172 oldu2=best2;
/dports/games/ufoai/ufoai-2.5-source/src/client/renderer/
H A Dr_lightmap.cpp111 int best2 = 0; in R_AllocLightmapBlock() local
116 if (r_lightmaps.allocated[i + j] > best2) in R_AllocLightmapBlock()
117 best2 = r_lightmaps.allocated[i + j]; in R_AllocLightmapBlock()
122 *y = best = best2; in R_AllocLightmapBlock()
/dports/audio/faust/faust-2.37.3/architecture/faust/dsp/
H A Ddsp-optimizer.h375 std::vector<std::string> best2 = best1.second; in findOptimizedParameters() local
376 best2.push_back("-mcd"); in findOptimizedParameters()
377 best2.push_back(std::to_string(size)); in findOptimizedParameters()
378 options_table.push_back(best2); in findOptimizedParameters()
/dports/biology/bowtie2/bowtie2-2.4.4/
H A Daligner_seed2.h1001 assert(!(best2 < tmp)); in rotate()
1002 best1 = best2; in rotate()
1004 best2 = best3; in rotate()
1023 best3 = best2; in update()
1024 best2 = best1; in update()
1026 } else if(!best2.inited()) { in update()
1027 best2 = e; in update()
1028 } else if(e < best2) { in update()
1031 best3 = best2; in update()
1032 best2 = e; in update()
[all …]

12345