Home
last modified time | relevance | path

Searched refs:kNumOpts (Results 1 – 4 of 4) sorted by relevance

/external/lzma/Java/SevenZip/Compression/LZMA/
DEncoder.java279 static final int kNumOpts = 1 << 12; field in Encoder
303 Optimal[] _optimum = new Optimal[kNumOpts];
377 _matchFinder.Create(_dictionarySize, kNumOpts, _numFastBytes, Base.kMatchMaxLen + 1); in Create()
384 for (int i = 0; i < kNumOpts; i++) in Encoder()
840 numAvailableBytesFull = Math.min(kNumOpts - 1 - cur, numAvailableBytesFull); in GetOptimum()
/external/lzma/CS/7zip/Compress/LZMA/
DLzmaEncoder.cs279 const UInt32 kNumOpts = 1 << 12; field in SevenZip.Compression.LZMA.Encoder
303 Optimal[] _optimum = new Optimal[kNumOpts];
377 _matchFinder.Create(_dictionarySize, kNumOpts, _numFastBytes, Base.kMatchMaxLen + 1); in Create()
384 for (int i = 0; i < kNumOpts; i++) in Encoder()
840 numAvailableBytesFull = Math.Min(kNumOpts - 1 - cur, numAvailableBytesFull); in GetOptimum()
/external/libgdx/gdx/src/com/badlogic/gdx/utils/compression/lzma/
DEncoder.java249 static final int kNumOpts = 1 << 12; field in Encoder
285 Optimal[] _optimum = new Optimal[kNumOpts];
355 _matchFinder.Create(_dictionarySize, kNumOpts, _numFastBytes, Base.kMatchMaxLen + 1); in Create()
361 for (int i = 0; i < kNumOpts; i++) in Encoder()
744 numAvailableBytesFull = Math.min(kNumOpts - 1 - cur, numAvailableBytesFull); in GetOptimum()
/external/lzma/C/
DLzmaEnc.c170 #define kNumOpts (1 << 12) macro
291 COptimal opt[kNumOpts];
1271 UInt32 temp = kNumOpts - 1 - cur; in GetOptimum()
1893 if (processed + kNumOpts + 300 >= maxUnpackSize || in LzmaEnc_CodeOneBlock()
1894 RangeEnc_GetProcessed(&p->rc) + kNumOpts * 2 >= maxPackSize) in LzmaEnc_CodeOneBlock()
1912 UInt32 beforeSize = kNumOpts; in LzmaEnc_Alloc()