653 				int curAndLenPrice = price + _repMatchLenEncoder.GetPrice(repLen - 2, posState);  in GetOptimum()  local
655 				if (curAndLenPrice < optimum.Price)  in GetOptimum()
657 					optimum.Price = curAndLenPrice;  in GetOptimum()
677 				int curAndLenPrice = normalMatchPrice + GetPosLenPrice(distance, len, posState);  in GetOptimum()  local
679 				if (curAndLenPrice < optimum.Price)  in GetOptimum()
681 					optimum.Price = curAndLenPrice;  in GetOptimum()
864 						int curAndLenPrice = nextRepMatchPrice + GetRepPrice(  in GetOptimum()  local
867 						if (curAndLenPrice < optimum.Price)  in GetOptimum()
869 							optimum.Price = curAndLenPrice;  in GetOptimum()
891 					int curAndLenPrice = repMatchPrice + GetRepPrice(repIndex, lenTest, state, posState);  in GetOptimum()  local
893 					if (curAndLenPrice < optimum.Price)  in GetOptimum()
895 						optimum.Price = curAndLenPrice;  in GetOptimum()
934 							int curAndLenPrice = nextRepMatchPrice + GetRepPrice(0, lenTest2, state2, posStateNext);  in GetOptimum()  local
936 							if (curAndLenPrice < optimum.Price)  in GetOptimum()
938 								optimum.Price = curAndLenPrice;  in GetOptimum()
971 					int curAndLenPrice = normalMatchPrice + GetPosLenPrice(curBack, lenTest, posState);  in GetOptimum()  local
973 					if (curAndLenPrice < optimum.Price)  in GetOptimum()
975 						optimum.Price = curAndLenPrice;  in GetOptimum()
992 								int curAndLenCharPrice = curAndLenPrice +  in GetOptimum()
1007 								curAndLenPrice = nextRepMatchPrice + GetRepPrice(0, lenTest2, state2, posStateNext);  in GetOptimum()
1009 								if (curAndLenPrice < optimum.Price)  in GetOptimum()
1011 									optimum.Price = curAndLenPrice;  in GetOptimum()