Lines Matching full:optimum
654 Optimal optimum = _optimum[repLen];
655 if (curAndLenPrice < optimum.Price)
657 optimum.Price = curAndLenPrice;
658 optimum.PosPrev = 0;
659 optimum.BackPrev = i;
660 optimum.Prev1IsChar = false;
678 Optimal optimum = _optimum[len];
679 if (curAndLenPrice < optimum.Price)
681 optimum.Price = curAndLenPrice;
682 optimum.PosPrev = 0;
683 optimum.BackPrev = distance + Base.kNumRepDistances;
684 optimum.Prev1IsChar = false;
866 Optimal optimum = _optimum[offset];
867 if (curAndLenPrice < optimum.Price)
869 optimum.Price = curAndLenPrice;
870 optimum.PosPrev = cur + 1;
871 optimum.BackPrev = 0;
872 optimum.Prev1IsChar = true;
873 optimum.Prev2 = false;
892 Optimal optimum = _optimum[cur + lenTest];
893 if (curAndLenPrice < optimum.Price)
895 optimum.Price = curAndLenPrice;
896 optimum.PosPrev = cur;
897 optimum.BackPrev = repIndex;
898 optimum.Prev1IsChar = false;
935 Optimal optimum = _optimum[cur + offset];
936 if (curAndLenPrice < optimum.Price)
938 optimum.Price = curAndLenPrice;
939 optimum.PosPrev = cur + lenTest + 1;
940 optimum.BackPrev = 0;
941 optimum.Prev1IsChar = true;
942 optimum.Prev2 = true;
943 optimum.PosPrev2 = cur;
944 optimum.BackPrev2 = repIndex;
972 Optimal optimum = _optimum[cur + lenTest];
973 if (curAndLenPrice < optimum.Price)
975 optimum.Price = curAndLenPrice;
976 optimum.PosPrev = cur;
977 optimum.BackPrev = curBack + Base.kNumRepDistances;
978 optimum.Prev1IsChar = false;
1008 optimum = _optimum[cur + offset];
1009 if (curAndLenPrice < optimum.Price)
1011 optimum.Price = curAndLenPrice;
1012 optimum.PosPrev = cur + lenTest + 1;
1013 optimum.BackPrev = 0;
1014 optimum.Prev1IsChar = true;
1015 optimum.Prev2 = true;
1016 optimum.PosPrev2 = cur;
1017 optimum.BackPrev2 = curBack + Base.kNumRepDistances;
