Home
last modified time | relevance | path

Searched refs:bestR (Results 1 – 8 of 8) sorted by relevance

/dports/games/netradiant/netradiant-20150621-src/tools/quake3/q3map2/
H A Dsurface_meta.c485 bestR = r; in MaxAreaIndexes()
499 bestR = rand() % cnt; in MaxAreaIndexes()
502 if ( bestR == bestS || bestR == bestT || bestS == bestT ) { in MaxAreaIndexes()
507 if ( bestR > bestS ) { in MaxAreaIndexes()
508 j = bestR; in MaxAreaIndexes()
509 bestR = bestS; in MaxAreaIndexes()
520 j = bestR; in MaxAreaIndexes()
521 bestR = bestS; in MaxAreaIndexes()
538 indexes[i++] = bestR; in MaxAreaIndexes()
551 j = MaxAreaIndexes( vert + bestR, bestS - bestR + 1, indexes + i ); in MaxAreaIndexes()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/skia/tests/
H A DPathOpsAngleIdeas.cpp294 double bestR = maxRadius; in bruteMinT() local
326 bestR = r; in bruteMinT()
337 if (bestR >= maxRadius) { in bruteMinT()
340 REPORTER_ASSERT(reporter, bestR < maxRadius); in bruteMinT()
343 double lastHighR = bestR; in bruteMinT()
344 r = bestR / 2; in bruteMinT()
358 bestR = lastHighR; in bruteMinT()
/dports/math/singular/Singular-Release-4-2-1/kernel/linear_algebra/
H A DlinearAlgebra.cc69 const int c2, int* bestR, int* bestC, const ring R) in pivot() argument
84 *bestR = r; in pivot()
119 int bestR; int bestC; int intSwap; poly pSwap; int cOffset = 0; in luDecomp() local
124 (!pivot(uMat, r, rr, r + cOffset, r + cOffset, &bestR, &bestC, R))) in luDecomp()
130 permut[r] = permut[bestR]; in luDecomp()
131 permut[bestR] = intSwap; in luDecomp()
138 MATELEM(uMat, r, c) = MATELEM(uMat, bestR, c); in luDecomp()
139 MATELEM(uMat, bestR, c) = pSwap; in luDecomp()
147 MATELEM(lMat, r, c) = MATELEM(lMat, bestR, c); in luDecomp()
148 MATELEM(lMat, bestR, c) = pSwap; in luDecomp()
H A DlinearAlgebra.h88 int* bestR, /**< [out] address of row index of best
/dports/biology/seqan1/seqan-1.3.1/apps/razers/
H A Drazers_spliced.h953 int bestR = rowPosR1; in findBestSplitPosition() local
961 bestR = rowPosR1; in findBestSplitPosition()
967 rowPosR1 = bestR; in findBestSplitPosition()
994 int bestR = rowPosR2; in findBestSplitPosition() local
1003 bestR = rowPosR1; in findBestSplitPosition()
1009 rowPosR1 = bestR; in findBestSplitPosition()
/dports/biology/seqan-apps/seqan-seqan-v2.4.0/apps/razers/
H A Drazers_spliced.h955 int bestR = rowPosR1; in findBestSplitPosition() local
963 bestR = rowPosR1; in findBestSplitPosition()
969 rowPosR1 = bestR; in findBestSplitPosition()
996 int bestR = rowPosR2; in findBestSplitPosition() local
1005 bestR = rowPosR1; in findBestSplitPosition()
1011 rowPosR1 = bestR; in findBestSplitPosition()
/dports/biology/seqan1/seqan-1.3.1/apps/splazers/
H A Drazers_spliced.h943 int bestR = rowPosR1; in findBestSplitPosition() local
960 bestR = rowPosR1; in findBestSplitPosition()
971 rowPosR1 = bestR; in findBestSplitPosition()
999 int bestR = rowPosR2; in findBestSplitPosition() local
1015 bestR = rowPosR1; in findBestSplitPosition()
1023 rowPosR1 = bestR; in findBestSplitPosition()
/dports/biology/seqan-apps/seqan-seqan-v2.4.0/apps/splazers/
H A Drazers_spliced.h1122 int bestR = rowPosR1; in findBestSplitPosition() local
1139 bestR = rowPosR1; in findBestSplitPosition()
1150 rowPosR1 = bestR; in findBestSplitPosition()
1486 int bestR = rowPosR2; in findBestSplitPosition() local
1502 bestR = rowPosR1; in findBestSplitPosition()
1510 rowPosR1 = bestR; in findBestSplitPosition()