Lines Matching refs:_optimum
303 Optimal[] _optimum = new Optimal[kNumOpts]; field in Encoder
385 _optimum[i] = new Optimal(); in Encoder()
504 int posMem = _optimum[cur].PosPrev; in Backward()
505 int backMem = _optimum[cur].BackPrev; in Backward()
508 if (_optimum[cur].Prev1IsChar) in Backward()
510 _optimum[posMem].MakeAsChar(); in Backward()
511 _optimum[posMem].PosPrev = posMem - 1; in Backward()
512 if (_optimum[cur].Prev2) in Backward()
514 _optimum[posMem - 1].Prev1IsChar = false; in Backward()
515 _optimum[posMem - 1].PosPrev = _optimum[cur].PosPrev2; in Backward()
516 _optimum[posMem - 1].BackPrev = _optimum[cur].BackPrev2; in Backward()
522 backMem = _optimum[posPrev].BackPrev; in Backward()
523 posMem = _optimum[posPrev].PosPrev; in Backward()
525 _optimum[posPrev].BackPrev = backCur; in Backward()
526 _optimum[posPrev].PosPrev = cur; in Backward()
530 backRes = _optimum[0].BackPrev; in Backward()
531 _optimumCurrentIndex = _optimum[0].PosPrev; in Backward()
543 int lenRes = _optimum[_optimumCurrentIndex].PosPrev - _optimumCurrentIndex; in GetOptimum()
544 backRes = _optimum[_optimumCurrentIndex].BackPrev; in GetOptimum()
545 _optimumCurrentIndex = _optimum[_optimumCurrentIndex].PosPrev; in GetOptimum()
604 _optimum[0].State = _state; in GetOptimum()
608 …_optimum[1].Price = SevenZip.Compression.RangeCoder.Encoder.GetPrice0(_isMatch[(_state << Base.kNu… in GetOptimum()
610 _optimum[1].MakeAsChar(); in GetOptimum()
618 if (shortRepPrice < _optimum[1].Price) in GetOptimum()
620 _optimum[1].Price = shortRepPrice; in GetOptimum()
621 _optimum[1].MakeAsShortRep(); in GetOptimum()
629 backRes = _optimum[1].BackPrev; in GetOptimum()
633 _optimum[1].PosPrev = 0; in GetOptimum()
635 _optimum[0].Backs0 = reps[0]; in GetOptimum()
636 _optimum[0].Backs1 = reps[1]; in GetOptimum()
637 _optimum[0].Backs2 = reps[2]; in GetOptimum()
638 _optimum[0].Backs3 = reps[3]; in GetOptimum()
642 _optimum[len--].Price = kIfinityPrice; in GetOptimum()
654 Optimal optimum = _optimum[repLen]; in GetOptimum()
678 Optimal optimum = _optimum[len]; in GetOptimum()
712 int posPrev = _optimum[cur].PosPrev; in GetOptimum()
714 if (_optimum[cur].Prev1IsChar) in GetOptimum()
717 if (_optimum[cur].Prev2) in GetOptimum()
719 state = _optimum[_optimum[cur].PosPrev2].State; in GetOptimum()
720 if (_optimum[cur].BackPrev2 < Base.kNumRepDistances) in GetOptimum()
726 state = _optimum[posPrev].State; in GetOptimum()
730 state = _optimum[posPrev].State; in GetOptimum()
733 if (_optimum[cur].IsShortRep()) in GetOptimum()
741 if (_optimum[cur].Prev1IsChar && _optimum[cur].Prev2) in GetOptimum()
743 posPrev = _optimum[cur].PosPrev2; in GetOptimum()
744 pos = _optimum[cur].BackPrev2; in GetOptimum()
749 pos = _optimum[cur].BackPrev; in GetOptimum()
755 Optimal opt = _optimum[posPrev]; in GetOptimum()
795 _optimum[cur].State = state; in GetOptimum()
796 _optimum[cur].Backs0 = reps[0]; in GetOptimum()
797 _optimum[cur].Backs1 = reps[1]; in GetOptimum()
798 _optimum[cur].Backs2 = reps[2]; in GetOptimum()
799 _optimum[cur].Backs3 = reps[3]; in GetOptimum()
800 int curPrice = _optimum[cur].Price; in GetOptimum()
812 Optimal nextOptimum = _optimum[cur + 1]; in GetOptimum()
863 _optimum[++lenEnd].Price = kIfinityPrice; in GetOptimum()
866 Optimal optimum = _optimum[offset]; in GetOptimum()
890 _optimum[++lenEnd].Price = kIfinityPrice; in GetOptimum()
892 Optimal optimum = _optimum[cur + lenTest]; in GetOptimum()
933 _optimum[++lenEnd].Price = kIfinityPrice; in GetOptimum()
935 Optimal optimum = _optimum[cur + offset]; in GetOptimum()
962 _optimum[++lenEnd].Price = kIfinityPrice; in GetOptimum()
972 Optimal optimum = _optimum[cur + lenTest]; in GetOptimum()
1006 _optimum[++lenEnd].Price = kIfinityPrice; in GetOptimum()
1008 optimum = _optimum[cur + offset]; in GetOptimum()