HomeSort by relevance Sort by last modified time
    Searched refs:kNumRepDistances (Results 1 - 4 of 4) sorted by null

  /external/lzma/Java/SevenZip/Compression/LZMA/
Base.java 7 public static final int kNumRepDistances = 4;
Encoder.java 55 int[] _repDistances = new int[Base.kNumRepDistances];
61 for (int i = 0; i < Base.kNumRepDistances; i++)
535 int[] reps = new int[Base.kNumRepDistances];
536 int[] repLens = new int[Base.kNumRepDistances];
573 for (i = 0; i < Base.kNumRepDistances; i++)
590 backRes = _matchDistances[numDistancePairs - 1] + Base.kNumRepDistances;
645 for (i = 0; i < Base.kNumRepDistances; i++)
683 optimum.BackPrev = distance + Base.kNumRepDistances;
720 if (_optimum[cur].BackPrev2 < Base.kNumRepDistances)
750 if (pos < Base.kNumRepDistances)
    [all...]
  /external/lzma/CS/7zip/Compress/LZMA/
LzmaEncoder.cs 55 UInt32[] _repDistances = new UInt32[Base.kNumRepDistances];
61 for (UInt32 i = 0; i < Base.kNumRepDistances; i++)
535 UInt32[] reps = new UInt32[Base.kNumRepDistances];
536 UInt32[] repLens = new UInt32[Base.kNumRepDistances];
573 for (i = 0; i < Base.kNumRepDistances; i++)
590 backRes = _matchDistances[numDistancePairs - 1] + Base.kNumRepDistances;
645 for (i = 0; i < Base.kNumRepDistances; i++)
683 optimum.BackPrev = distance + Base.kNumRepDistances;
720 if (_optimum[cur].BackPrev2 < Base.kNumRepDistances)
750 if (pos < Base.kNumRepDistances)
    [all...]
LzmaBase.cs 7 public const uint kNumRepDistances = 4;

Completed in 46 milliseconds