Searched refs:nextOpt (Results 1 – 1 of 1) sorted by relevance
1346 COptimal *curOpt, *nextOpt; in GetOptimum() local1495 nextOpt = &p->opt[(size_t)cur + 1]; in GetOptimum()1500 if (nextOpt->price < kInfinityPrice in GetOptimum()1503 || litPrice > nextOpt->price in GetOptimum()1513 if (litPrice < nextOpt->price) in GetOptimum()1515 nextOpt->price = litPrice; in GetOptimum()1516 nextOpt->len = 1; in GetOptimum()1517 MakeAs_Lit(nextOpt); in GetOptimum()1535 if (repMatchPrice < nextOpt->price) // 18.new in GetOptimum()1539 nextOpt->len < 2 // we can check nextOpt->len, if skip items are not allowed in p->opt in GetOptimum()[all …]