Lines Matching defs:Price
290 public int Price;
608 _optimum[1].Price = SevenZip.Compression.RangeCoder.Encoder.GetPrice0(_isMatch[(_state << Base.kNumPosStatesBitsMax) + posState]) +
618 if (shortRepPrice < _optimum[1].Price)
620 _optimum[1].Price = shortRepPrice;
642 _optimum[len--].Price = kIfinityPrice;
655 if (curAndLenPrice < optimum.Price)
657 optimum.Price = curAndLenPrice;
679 if (curAndLenPrice < optimum.Price)
681 optimum.Price = curAndLenPrice;
800 int curPrice = _optimum[cur].Price;
815 if (curAnd1Price < nextOptimum.Price)
817 nextOptimum.Price = curAnd1Price;
830 if (shortRepPrice <= nextOptimum.Price)
832 nextOptimum.Price = shortRepPrice;
863 _optimum[++lenEnd].Price = kIfinityPrice;
867 if (curAndLenPrice < optimum.Price)
869 optimum.Price = curAndLenPrice;
890 _optimum[++lenEnd].Price = kIfinityPrice;
893 if (curAndLenPrice < optimum.Price)
895 optimum.Price = curAndLenPrice;
933 _optimum[++lenEnd].Price = kIfinityPrice;
936 if (curAndLenPrice < optimum.Price)
938 optimum.Price = curAndLenPrice;
962 _optimum[++lenEnd].Price = kIfinityPrice;
973 if (curAndLenPrice < optimum.Price)
975 optimum.Price = curAndLenPrice;
1006 _optimum[++lenEnd].Price = kIfinityPrice;
1009 if (curAndLenPrice < optimum.Price)
1011 optimum.Price = curAndLenPrice;