Home
last modified time | relevance | path

Searched refs:iBest (Results 1 – 25 of 260) sorted by relevance

1234567891011

/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/sat/xsat/
H A DxsatUtils.h44 int i, j, iBest; in xSAT_UtilSelectSort() local
49 iBest = i; in xSAT_UtilSelectSort()
52 if ( CompFnct( pArray[j], pArray[iBest] ) ) in xSAT_UtilSelectSort()
53 iBest = j; in xSAT_UtilSelectSort()
56 pArray[i] = pArray[iBest]; in xSAT_UtilSelectSort()
57 pArray[iBest] = pTmp; in xSAT_UtilSelectSort()
/dports/math/saga/saga-8.1.3/saga-gis/src/saga_core/saga_api/
H A Dmat_regression_multiple.cpp735 int iBest, iPredictor; in _Get_Step_In() local
751 iBest = iPredictor; in _Get_Step_In()
760 m_bIncluded[iBest] = true; in _Get_Step_In()
761 m_Predictor[m_nPredictors] = iBest; in _Get_Step_In()
766 _Set_Step_Info(X, R2, iBest, true); in _Get_Step_In()
769 return( iBest ); in _Get_Step_In()
780 int iBest, iPredictor; in _Get_Step_Out() local
801 iBest = iPredictor; in _Get_Step_Out()
811 X.Del_Col(1 + iBest); in _Get_Step_Out()
815 m_bIncluded[m_Predictor[iBest]] = false; in _Get_Step_Out()
[all …]
/dports/devel/fossil/fossil-src-2.17/src/
H A Dgraph.c284 int iBest = 0; in findFreeRail() local
296 iBest = i; in findFreeRail()
303 iBest = i; in findFreeRail()
308 if( iBest>p->mxRail ) p->mxRail = iBest; in findFreeRail()
309 return iBest; in findFreeRail()
521 iBest = i; in graph_finish()
526 iBest = i; in graph_finish()
530 if( iBest>i ){ in graph_finish()
542 iBest = i; in graph_finish()
547 iBest = i; in graph_finish()
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/res/
H A DresFilter.c245 int Counter, RetValue, d, d2, k, iDiv, iDiv2, iBest; in Res_FilterCandidatesArea() local
271 iBest = Res_FilterCriticalFanin( pWin->pNode ); in Res_FilterCandidatesArea()
272 if ( iBest == -1 ) in Res_FilterCandidatesArea()
276 pInfo = Res_FilterCollectFaninInfo( pWin, pSim, ~(1 << iBest) ); in Res_FilterCandidatesArea()
286 if ( k != iBest ) in Res_FilterCandidatesArea()
312 if ( k != iBest ) in Res_FilterCandidatesArea()
349 if ( k != iBest ) in Res_FilterCandidatesArea()
413 int i, iBest = -1, CostMax = 0, CostCur; in Res_FilterCriticalFanin() local
424 iBest = i; in Res_FilterCriticalFanin()
429 return iBest; in Res_FilterCriticalFanin()
/dports/math/clp/Clp-1.17.3/Clp/src/
H A DAbcSimplexPrimal.cpp1980 int iBest = -1; in primalRow() local
2427 int iBest = -1; in primalRow() local
3715 int iBest = -1; in pivotResult4() local
3721 iBest = jMinor; in pivotResult4()
3726 iBest=0; in pivotResult4()
3728 if (iBest >= 0) { in pivotResult4()
3729 dualIn_ = stuff[iBest].dualIn_; in pivotResult4()
3730 dualOut_ = stuff[iBest].dualOut_; in pivotResult4()
3742 theta_ = stuff[iBest].theta_; in pivotResult4()
3743 alpha_ = stuff[iBest].alpha_; in pivotResult4()
[all …]
/dports/cad/opencascade/opencascade-7.6.0/src/NCollection/
H A DNCollection_UBTree.hxx381 Standard_Integer iBest = 0; in Add() local
385 iBest = (isOut[0] ? 1 : 0); in Add()
393 iBest = 1; in Add()
397 isOutOfBranch = isOut[iBest]; in Add()
398 pBranch = &pBranch->ChangeChild(iBest); in Add()
/dports/cad/opencascade/opencascade-7.6.0/inc/
H A DNCollection_UBTree.hxx381 Standard_Integer iBest = 0; in Add() local
385 iBest = (isOut[0] ? 1 : 0); in Add()
393 iBest = 1; in Add()
397 isOutOfBranch = isOut[iBest]; in Add()
398 pBranch = &pBranch->ChangeChild(iBest); in Add()
/dports/devel/py-cadquery-pywrap/pywrap-e8c7bc9/opencascade/
H A DNCollection_UBTree.hxx381 Standard_Integer iBest = 0; in Add() local
385 iBest = (isOut[0] ? 1 : 0); in Add()
393 iBest = 1; in Add()
397 isOutOfBranch = isOut[iBest]; in Add()
398 pBranch = &pBranch->ChangeChild(iBest); in Add()
/dports/math/mcsim/mcsim-6.2.0/sim/
H A Doptdsign.c668 long iBest = 0; in DoOptimalDesign() local
751 iBest = nDesignPts + 1; /* out of bounds, undefined */ in DoOptimalDesign()
757 iBest, dBest, dUtility); in DoOptimalDesign()
800 iBest = j; in DoOptimalDesign()
808 piDesign_mask[iBest] = !piDesign_mask[iBest]; in DoOptimalDesign()
814 piDesign_mask, iBest, dBest, dUtility); in DoOptimalDesign()
832 iBest = j; in DoOptimalDesign()
837 piDesign_mask, iBest, dBest, 0); in DoOptimalDesign()
/dports/games/spring/spring_98.0/AI/Skirmish/RAI/
H A DBuilder.cpp786 int iBest=-1; in UBuilderIdle() local
790 iBest=iBQ; in UBuilderIdle()
791 if( iBest >= 0 ) in UBuilderIdle()
828 int iBest=-1; in UBuilderIdle() local
835 iBest = iR->first; in UBuilderIdle()
839 if( iBest != -1 ) in UBuilderIdle()
900 int iBest=-1; in UBuilderIdle() local
907 iBest = iM->first; in UBuilderIdle()
911 if( iBest != -1 ) in UBuilderIdle()
934 int iBest=-1; in UBuilderIdle() local
[all …]
H A DBuilderPlacement.cpp135 int iBest=-1; in cBuilderPlacement() local
142 iBest=iR; in cBuilderPlacement()
146 Seleted.insert(iBest); in cBuilderPlacement()
154 int iBest=-1; in cBuilderPlacement() local
161 iBest=iR; in cBuilderPlacement()
165 Seleted.insert(iBest); in cBuilderPlacement()
869 int iBest=-1; in FindResourceSite() local
890 if( iBest == -1 ) in FindResourceSite()
1176 int iBest=-1; in GetResourceIndex() local
1188 iBest = iR; in GetResourceIndex()
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/aig/ivy/
H A DivyMulti8.c242 int i, j, iBest; in Ivy_MultiSort() local
246 iBest = i; in Ivy_MultiSort()
248 if ( Ivy_Regular(pArgs[j])->Level > Ivy_Regular(pArgs[iBest])->Level ) in Ivy_MultiSort()
249 iBest = j; in Ivy_MultiSort()
251 pArgs[i] = pArgs[iBest]; in Ivy_MultiSort()
252 pArgs[iBest] = pTemp; in Ivy_MultiSort()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/proof/cec/
H A DcecSplit.c215 int i, iBest = -1, CostBest = -1;
220 iBest = i, CostBest = Gia_ObjRefNum(p, pObj);
221 assert( iBest >= 0 );
222 *pnFanouts = Gia_ObjRefNum(p, Gia_ManPi(p, iBest));
224 return iBest;
230 int * pOrder, i, iBest = -1;
246 CostBest = Cost0 + Cost1, iBest = pOrder[i];
261 assert( iBest >= 0 );
262 *pnFanouts = Gia_ObjRefNum(p, Gia_ManPi(p, iBest));
264 return iBest;
/dports/math/bcps/CHiPPS-BiCePS-releases-0.99.2/Bcps/examples/Blis/
H A DBlisHeurRound.cpp200 int iBest = -1; in searchSolution() local
236 iBest = iColumn; in searchSolution()
263 iBest = iColumn; in searchSolution()
272 if (iBest >= 0) { in searchSolution()
275 newSolution[iBest] = newValue; in searchSolution()
/dports/math/alps/CHiPPS-ALPS-releases-2.0.1/Alps/examples/Abc/
H A DAbcHeuristic.cpp219 int iBest = -1; in solution() local
255 iBest = iColumn; in solution()
282 iBest = iColumn; in solution()
291 if (iBest >= 0) { in solution()
294 newSolution[iBest] = newValue; in solution()
/dports/math/cbc/Cbc-releases-2.10.5/Cbc/examples/
H A DCbcBranchFollow2.cpp227 int iBest = -1; in gutsOfFollowOn2() local
255 iBest = iRow; in gutsOfFollowOn2()
265 iBest = iRow; in gutsOfFollowOn2()
274 iBest = iRow; in gutsOfFollowOn2()
283 if (iBest >= 0) { in gutsOfFollowOn2()
285 otherRow = iBest; in gutsOfFollowOn2()
/dports/audio/zrythm/zrythm-1.0.0-alpha.26.0.13/ext/midilib/src/
H A Dm2rtttl.c75 int iBest=9999, iDiff, i, iSetting=0; in rtttlGetClosestTempo() local
81 if (iDiff < iBest) in rtttlGetClosestTempo()
83 iBest = iDiff; in rtttlGetClosestTempo()
/dports/irc/kvirc/KVIrc-5.0.0-73-gbdeac0429/src/modules/mediaplayer/
H A Dlibkvimediaplayer.cpp45 int iBest = 0; in auto_detect_player() local
55 if(iScore > iBest) in auto_detect_player()
57 iBest = iScore; in auto_detect_player()
70 if(iBest < 90) in auto_detect_player()
81 if(iScore > iBest) in auto_detect_player()
83 iBest = iScore; in auto_detect_player()
/dports/math/disco/DisCO-releases-1.0.0-33-g68720be/src/
H A DDcoHeurRounding.cpp162 int iBest = -1; in searchSolution() local
198 iBest = iColumn; in searchSolution()
226 iBest = iColumn; in searchSolution()
235 if (iBest >= 0) { in searchSolution()
238 sol[iBest] = newValue; in searchSolution()
/dports/multimedia/jmref/JM/lencod/src/
H A Drdoq_cabac.c450 int iBest, levelTab[64]; in est_writeRunLevel_CABAC() local
528 iBest = 0; first = 1; in est_writeRunLevel_CABAC()
539 iBest = 0; in est_writeRunLevel_CABAC()
581 iBest = i; in est_writeRunLevel_CABAC()
587 if (iBest > 0) in est_writeRunLevel_CABAC()
589 c1 = c1Tab[iBest]; in est_writeRunLevel_CABAC()
590 c2 = c2Tab[iBest]; in est_writeRunLevel_CABAC()
593 levelTab[k] = dataLevel->level[iBest]; in est_writeRunLevel_CABAC()
/dports/math/cbc/Cbc-releases-2.10.5/Cbc/src/
H A DCbcFollowOn.cpp223 int iBest = -1; in gutsOfFollowOn() local
250 iBest = iRow; in gutsOfFollowOn()
260 iBest = iRow; in gutsOfFollowOn()
269 iBest = iRow; in gutsOfFollowOn()
278 if (iBest >= 0) { in gutsOfFollowOn()
280 otherRow = iBest; in gutsOfFollowOn()
H A DCbcFathomDynamicProgramming.cpp497 int iBest = -1; in fathom() local
514 iBest = i; in fathom()
550 iBest = i; in fathom()
564 while (iBest > 0) { in fathom()
565 int n = decodeBitPattern(iBest - back_[iBest], indices_, numberRows); in fathom()
591 iBest = back_[iBest]; in fathom()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/aig/gia/
H A DgiaBalLut.c615 int i, k, iBest = -1, kBest = -1, BestCost = ABC_INFINITY, Cost; in Bal_ManFindBestPair() local
630 BestCost = Cost, iBest = i, kBest = k; in Bal_ManFindBestPair()
635 return (kBest << 16)|iBest; in Bal_ManFindBestPair()
651 BestCost = Cost, iBest = i, kBest = k; in Bal_ManFindBestPair()
656 return (kBest << 16)|iBest; in Bal_ManFindBestPair()
847 int iBest = Vec_IntEntry( vSuper, Res >> 16 ); in Gia_ManBalanceGate() local
849 Vec_IntRemove( vSuper, iBest ); in Gia_ManBalanceGate()
852 iLit = Gia_ManHashXorReal( pNew, iBest, kBest ); in Gia_ManBalanceGate()
854 iLit = Gia_ManHashAnd( pNew, iBest, kBest ); in Gia_ManBalanceGate()
H A DgiaStr.c1136 int i, iStop, iBest,iBest2; in Str_NtkBalanceMulti() local
1170 iBest = iStop, OccurBest = Str_CountBits(pMatrix[0] & pMatrix[iStop]); in Str_NtkBalanceMulti()
1177 iBest = i, OccurBest = OccurNew; in Str_NtkBalanceMulti()
1179 assert( iBest > 0 && iBest < Vec_IntSize(vSuper) ); in Str_NtkBalanceMulti()
1186 iBest = -1; CostBest = -1; OccurBest2 = -1; OccurBest = -1; in Str_NtkBalanceMulti()
1194 CostBest = CostNew, iBest = i, OccurBest = OccurNew; in Str_NtkBalanceMulti()
1199 assert( iBest > 0 && iBest < Vec_IntSize(vSuper) ); in Str_NtkBalanceMulti()
1206 iBest = iBest2 = -1; CostBest = CostBest2 = -1, OccurBest = OccurBest2 = -1; in Str_NtkBalanceMulti()
1223 if ( iBest >= 0 ) in Str_NtkBalanceMulti()
1225 assert( iBest > 0 ); in Str_NtkBalanceMulti()
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/map/mio/
H A DmioParse.c432 int i, iBest = -1; in Mio_ParseCheckName() local
438 pNameBest = Mio_PinReadName(pPin), iBest = i; in Mio_ParseCheckName()
442 return iBest; in Mio_ParseCheckName()

1234567891011