kNumOpts (reference) in projects: third_party - OpenGrok search results

Repository(s)

Full Search		Search through all text tokens(words,strings,identifiers,numbers) in index.
Definition		Only finds symbol definitions(where e.g a variable(function,...) is defined).
Symbol		Only finds symbol(e.g. methods classes,function,variables).
File Path		Path of the source file(use "/").If you want just exact path,enclose it in "".Source files end with: .jar/.bz2/.a/.h/.java...
History		History log comments.
Type		Type of analyzer used to filter file types include with selected(e.g. just C sources).

Help

Searched refs:kNumOpts (Results 1 - 3 of 3) sorted by relevance

/third_party/lzma/Java/SevenZip/Compression/LZMA/
H A D	Encoder.java	`279 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()`
/third_party/lzma/CS/7zip/Compress/LZMA/
H A D	LzmaEncoder.cs	`279 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()`
/third_party/lzma/C/
H A D	LzmaEnc.c	`277 #define kNumOpts (1 << 11) macro 278 #define kPackReserve (kNumOpts * 8) 279 // #define kNumOpts (1 << 12) 280 // #define kPackReserve (1 + kNumOpts * 2) 478 COptimal opt[kNumOpts]; 1457 if (cur >= kNumOpts - 64) in GetOptimum() 1631 unsigned temp = kNumOpts - 1 - cur; in GetOptimum() 2666 if (processed + kNumOpts + 300 >= maxUnpackSize in LzmaEnc_CodeOneBlock() 2688 UInt32 beforeSize = kNumOpts; in LzmaEnc_Alloc() 2820 for (i = 0; i < kNumOpts; in LzmaEnc_Init() [all...]`

Completed in 8 milliseconds