Java 类com.badlogic.gdx.utils.compression.rangecoder.BitTreeEncoder 实例源码

public Encoder()
{
  int j;
  for (int i = 0; ; i++)
  {
    j = 0;
    if (i >= 4096)
      break;
    this._optimum[i] = new Encoder.Optimal(this);
  }
  while (j < 4)
  {
    this._posSlotEncoder[j] = new BitTreeEncoder(6);
    j++;
  }
}

void FillDistancesPrices()
{
  for (int i = 4; i < 128; i++)
  {
    int i4 = GetPosSlot(i);
    int i5 = -1 + (i4 >> 1);
    int i6 = (0x2 | i4 & 0x1) << i5;
    this.tempPrices[i] = BitTreeEncoder.ReverseGetPrice(this._posEncoders, -1 + (i6 - i4), i5, i - i6);
  }
  for (int j = 0; j < 4; j++)
  {
    BitTreeEncoder localBitTreeEncoder = this._posSlotEncoder[j];
    int k = j << 6;
    for (int m = 0; m < this._distTableSize; m++)
      this._posSlotPrices[(k + m)] = localBitTreeEncoder.GetPrice(m);
    for (int n = 14; n < this._distTableSize; n++)
    {
      int[] arrayOfInt = this._posSlotPrices;
      int i3 = k + n;
      arrayOfInt[i3] += (-4 + (-1 + (n >> 1)) << 6);
    }
    int i1 = j * 128;
    for (int i2 = 0; i2 < 4; i2++)
      this._distancesPrices[(i1 + i2)] = this._posSlotPrices[(k + i2)];
    while (i2 < 128)
    {
      this._distancesPrices[(i1 + i2)] = (this._posSlotPrices[(k + GetPosSlot(i2))] + this.tempPrices[i2]);
      i2++;
    }
  }
  this._matchPriceCount = 0;
}

public Encoder$LenEncoder(Encoder paramEncoder)
{
  for (int i = 0; i < 16; i++)
  {
    this._lowCoder[i] = new BitTreeEncoder(3);
    this._midCoder[i] = new BitTreeEncoder(3);
  }
}

public LenEncoder () {
    for (int posState = 0; posState < Base.kNumPosStatesEncodingMax; posState++) {
        _lowCoder[posState] = new BitTreeEncoder(Base.kNumLowLenBits);
        _midCoder[posState] = new BitTreeEncoder(Base.kNumMidLenBits);
    }
}

public Encoder () {
    for (int i = 0; i < kNumOpts; i++)
        _optimum[i] = new Optimal();
    for (int i = 0; i < Base.kNumLenToPosStates; i++)
        _posSlotEncoder[i] = new BitTreeEncoder(Base.kNumPosSlotBits);
}

public LenEncoder() {
    for (int posState = 0; posState < Base.kNumPosStatesEncodingMax; posState++) {
        _lowCoder[posState] = new BitTreeEncoder(Base.kNumLowLenBits);
        _midCoder[posState] = new BitTreeEncoder(Base.kNumMidLenBits);
    }
}

public Encoder() {
    for (int i = 0; i < kNumOpts; i++)
        _optimum[i] = new Optimal();
    for (int i = 0; i < Base.kNumLenToPosStates; i++)
        _posSlotEncoder[i] = new BitTreeEncoder(Base.kNumPosSlotBits);
}