Searched refs:lenEnd (Results 1 – 4 of 4) sorted by relevance
625 int lenEnd = ((lenMain >= repLens[repMaxIndex]) ? lenMain : repLens[repMaxIndex]); in GetOptimum() local627 if (lenEnd < 2) in GetOptimum()640 int len = lenEnd; in GetOptimum()700 if (cur == lenEnd) in GetOptimum()862 while (lenEnd < offset) in GetOptimum()863 _optimum[++lenEnd].Price = kIfinityPrice; in GetOptimum()889 while (lenEnd < cur + lenTest) in GetOptimum()890 _optimum[++lenEnd].Price = kIfinityPrice; in GetOptimum()932 while (lenEnd < cur + offset) in GetOptimum()933 _optimum[++lenEnd].Price = kIfinityPrice; in GetOptimum()[all …]
625 UInt32 lenEnd = ((lenMain >= repLens[repMaxIndex]) ? lenMain : repLens[repMaxIndex]); in GetOptimum()627 if(lenEnd < 2) in GetOptimum()640 UInt32 len = lenEnd; in GetOptimum()700 if (cur == lenEnd) in GetOptimum()862 while (lenEnd < offset) in GetOptimum()863 _optimum[++lenEnd].Price = kIfinityPrice; in GetOptimum()889 while (lenEnd < cur + lenTest) in GetOptimum()890 _optimum[++lenEnd].Price = kIfinityPrice; in GetOptimum()932 while(lenEnd < cur + offset) in GetOptimum()933 _optimum[++lenEnd].Price = kIfinityPrice; in GetOptimum()[all …]
564 int lenEnd = ((lenMain >= repLens[repMaxIndex]) ? lenMain : repLens[repMaxIndex]); in GetOptimum() local566 if (lenEnd < 2) { in GetOptimum()578 int len = lenEnd; in GetOptimum()627 if (cur == lenEnd) return Backward(cur); in GetOptimum()763 while (lenEnd < offset) in GetOptimum()764 _optimum[++lenEnd].Price = kIfinityPrice; in GetOptimum()785 while (lenEnd < cur + lenTest) in GetOptimum()786 _optimum[++lenEnd].Price = kIfinityPrice; in GetOptimum()825 while (lenEnd < cur + offset) in GetOptimum()826 _optimum[++lenEnd].Price = kIfinityPrice; in GetOptimum()[all …]
944 UInt32 numAvail, mainLen, numPairs, repMaxIndex, i, posState, lenEnd, len, cur; in GetOptimum() local1046 lenEnd = ((mainLen >= repLens[repMaxIndex]) ? mainLen : repLens[repMaxIndex]); in GetOptimum()1048 if (lenEnd < 2) in GetOptimum()1058 len = lenEnd; in GetOptimum()1132 for (i = cur; i <= lenEnd; i++) in GetOptimum()1148 if (cur == lenEnd) in GetOptimum()1304 while (lenEnd < offset) in GetOptimum()1305 p->opt[++lenEnd].price = kInfinityPrice; in GetOptimum()1332 while (lenEnd < cur + lenTest) in GetOptimum()1333 p->opt[++lenEnd].price = kInfinityPrice; in GetOptimum()[all …]