Lines Matching defs:_optimum

303 	Optimal[] _optimum = new Optimal[kNumOpts];

385 			_optimum[i] = new Optimal();

504 		int posMem = _optimum[cur].PosPrev;

505 		int backMem = _optimum[cur].BackPrev;

508 			if (_optimum[cur].Prev1IsChar)

510 				_optimum[posMem].MakeAsChar();

511 				_optimum[posMem].PosPrev = posMem - 1;

512 				if (_optimum[cur].Prev2)

514 					_optimum[posMem - 1].Prev1IsChar = false;

515 					_optimum[posMem - 1].PosPrev = _optimum[cur].PosPrev2;

516 					_optimum[posMem - 1].BackPrev = _optimum[cur].BackPrev2;

522 			backMem = _optimum[posPrev].BackPrev;

523 			posMem = _optimum[posPrev].PosPrev;

525 			_optimum[posPrev].BackPrev = backCur;

526 			_optimum[posPrev].PosPrev = cur;

530 		backRes = _optimum[0].BackPrev;

531 		_optimumCurrentIndex = _optimum[0].PosPrev;

543 			int lenRes = _optimum[_optimumCurrentIndex].PosPrev - _optimumCurrentIndex;

544 			backRes = _optimum[_optimumCurrentIndex].BackPrev;

545 			_optimumCurrentIndex = _optimum[_optimumCurrentIndex].PosPrev;

604 		_optimum[0].State = _state;

608 		_optimum[1].Price = SevenZip.Compression.RangeCoder.Encoder.GetPrice0(_isMatch[(_state << Base.kNumPosStatesBitsMax) + posState]) +

610 		_optimum[1].MakeAsChar();

618 			if (shortRepPrice < _optimum[1].Price)

620 				_optimum[1].Price = shortRepPrice;

621 				_optimum[1].MakeAsShortRep();

629 			backRes = _optimum[1].BackPrev;

633 		_optimum[1].PosPrev = 0;

635 		_optimum[0].Backs0 = reps[0];

636 		_optimum[0].Backs1 = reps[1];

637 		_optimum[0].Backs2 = reps[2];

638 		_optimum[0].Backs3 = reps[3];

642 			_optimum[len--].Price = kIfinityPrice;

654 				Optimal optimum = _optimum[repLen];

678 				Optimal optimum = _optimum[len];

712 			int posPrev = _optimum[cur].PosPrev;

714 			if (_optimum[cur].Prev1IsChar)

717 				if (_optimum[cur].Prev2)

719 					state = _optimum[_optimum[cur].PosPrev2].State;

720 					if (_optimum[cur].BackPrev2 < Base.kNumRepDistances)

726 					state = _optimum[posPrev].State;

730 				state = _optimum[posPrev].State;

733 				if (_optimum[cur].IsShortRep())

741 				if (_optimum[cur].Prev1IsChar && _optimum[cur].Prev2)

743 					posPrev = _optimum[cur].PosPrev2;

744 					pos = _optimum[cur].BackPrev2;

749 					pos = _optimum[cur].BackPrev;

755 				Optimal opt = _optimum[posPrev];

795 			_optimum[cur].State = state;

796 			_optimum[cur].Backs0 = reps[0];

797 			_optimum[cur].Backs1 = reps[1];

798 			_optimum[cur].Backs2 = reps[2];

799 			_optimum[cur].Backs3 = reps[3];

800 			int curPrice = _optimum[cur].Price;

812 			Optimal nextOptimum = _optimum[cur + 1];

863 							_optimum[++lenEnd].Price = kIfinityPrice;

866 						Optimal optimum = _optimum[offset];

890 						_optimum[++lenEnd].Price = kIfinityPrice;

892 					Optimal optimum = _optimum[cur + lenTest];

933 								_optimum[++lenEnd].Price = kIfinityPrice;

935 							Optimal optimum = _optimum[cur + offset];

962 					_optimum[++lenEnd].Price = kIfinityPrice;

972 					Optimal optimum = _optimum[cur + lenTest];

1006 									_optimum[++lenEnd].Price = kIfinityPrice;

1008 								optimum = _optimum[cur + offset];