Searched refs:lenEnd (Results 1 – 3 of 3) 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 …]
986 UInt32 lenEnd, cur; in GetOptimum() local1093 lenEnd = ((mainLen >= repLens[repMaxIndex]) ? mainLen : repLens[repMaxIndex]); in GetOptimum()1095 if (lenEnd < 2) in GetOptimum()1105 len = lenEnd; in GetOptimum()1179 for (i = cur; i <= lenEnd; i++) in GetOptimum()1198 if (cur == lenEnd) in GetOptimum()1354 while (lenEnd < offset) in GetOptimum()1355 p->opt[++lenEnd].price = kInfinityPrice; in GetOptimum()1382 while (lenEnd < cur + lenTest) in GetOptimum()1383 p->opt[++lenEnd].price = kInfinityPrice; in GetOptimum()[all …]