Home
last modified time | relevance | path

Searched refs:kNumRepDistances (Results 1 – 6 of 6) sorted by relevance

/external/lzma/Java/SevenZip/Compression/LZMA/
DEncoder.java55 int[] _repDistances = new int[Base.kNumRepDistances];
61 for (int i = 0; i < Base.kNumRepDistances; i++) in BaseInit()
535 int[] reps = new int[Base.kNumRepDistances];
536 int[] repLens = new int[Base.kNumRepDistances];
573 for (i = 0; i < Base.kNumRepDistances; i++) in GetOptimum()
590 backRes = _matchDistances[numDistancePairs - 1] + Base.kNumRepDistances; in GetOptimum()
645 for (i = 0; i < Base.kNumRepDistances; i++) in GetOptimum()
683 optimum.BackPrev = distance + Base.kNumRepDistances; in GetOptimum()
720 if (_optimum[cur].BackPrev2 < Base.kNumRepDistances) in GetOptimum()
750 if (pos < Base.kNumRepDistances) in GetOptimum()
[all …]
DBase.java7 public static final int kNumRepDistances = 4; field in Base
/external/lzma/CS/7zip/Compress/LZMA/
DLzmaEncoder.cs55 UInt32[] _repDistances = new UInt32[Base.kNumRepDistances];
61 for (UInt32 i = 0; i < Base.kNumRepDistances; i++) in BaseInit()
535 UInt32[] reps = new UInt32[Base.kNumRepDistances];
536 UInt32[] repLens = new UInt32[Base.kNumRepDistances];
573 for (i = 0; i < Base.kNumRepDistances; i++) in GetOptimum()
590 backRes = _matchDistances[numDistancePairs - 1] + Base.kNumRepDistances; in GetOptimum()
645 for (i = 0; i < Base.kNumRepDistances; i++) in GetOptimum()
683 optimum.BackPrev = distance + Base.kNumRepDistances; in GetOptimum()
720 if (_optimum[cur].BackPrev2 < Base.kNumRepDistances) in GetOptimum()
750 if (pos < Base.kNumRepDistances) in GetOptimum()
[all …]
DLzmaBase.cs7 public const uint kNumRepDistances = 4; field in SevenZip.Compression.LZMA.Base
/external/libgdx/gdx/src/com/badlogic/gdx/utils/compression/lzma/
DEncoder.java58 int[] _repDistances = new int[Base.kNumRepDistances];
63 for (int i = 0; i < Base.kNumRepDistances; i++) in BaseInit()
486 int[] reps = new int[Base.kNumRepDistances];
487 int[] repLens = new int[Base.kNumRepDistances];
517 for (i = 0; i < Base.kNumRepDistances; i++) { in GetOptimum()
530 backRes = _matchDistances[numDistancePairs - 1] + Base.kNumRepDistances; in GetOptimum()
583 for (i = 0; i < Base.kNumRepDistances; i++) { in GetOptimum()
613 optimum.BackPrev = distance + Base.kNumRepDistances; in GetOptimum()
643 if (_optimum[cur].BackPrev2 < Base.kNumRepDistances) in GetOptimum()
665 if (pos < Base.kNumRepDistances) in GetOptimum()
[all …]
DBase.java6 public static final int kNumRepDistances = 4; field in Base