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