_matchDistances (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:_matchDistances (Results 1 - 2 of 2) sorted by relevance

/third_party/lzma/Java/SevenZip/Compression/LZMA/
H A D	Encoder.java	324 int[] _matchDistances = new int[Base.kMatchMaxLen*2+2]; field in Encoder 434 _numDistancePairs = _matchFinder.GetMatches(_matchDistances); in ReadMatchDistances() 437 lenRes = _matchDistances[_numDistancePairs - 2]; in ReadMatchDistances() 439 lenRes += _matchFinder.GetMatchLen((int)lenRes - 1, _matchDistances[_numDistancePairs - 1], in ReadMatchDistances() 590 backRes = _matchDistances[numDistancePairs - 1] + Base.kNumRepDistances; in GetOptimum() 672 while (len > _matchDistances[offs]) in GetOptimum() 676 int distance = _matchDistances[offs + 1]; in GetOptimum() 686 if (len == _matchDistances[offs]) in GetOptimum() 954 for (numDistancePairs = 0; newLen > _matchDistances[numDistancePairs]; numDistancePairs += 2) ; in GetOptimum() 955 _matchDistances[numDistancePair in GetOptimum() [all...]
/third_party/lzma/CS/7zip/Compress/LZMA/
H A D	LzmaEncoder.cs	324 UInt32[] _matchDistances = new UInt32[Base.kMatchMaxLen * 2 + 2]; field in SevenZip.Compression.LZMA.Encoder 434 numDistancePairs = _matchFinder.GetMatches(_matchDistances); in ReadMatchDistances() 437 lenRes = _matchDistances[numDistancePairs - 2]; in ReadMatchDistances() 439 lenRes += _matchFinder.GetMatchLen((int)lenRes - 1, _matchDistances[numDistancePairs - 1], in ReadMatchDistances() 590 backRes = _matchDistances[numDistancePairs - 1] + Base.kNumRepDistances; in GetOptimum() 672 while (len > _matchDistances[offs]) in GetOptimum() 676 UInt32 distance = _matchDistances[offs + 1]; in GetOptimum() 686 if (len == _matchDistances[offs]) in GetOptimum() 954 for (numDistancePairs = 0; newLen > _matchDistances[numDistancePairs]; numDistancePairs += 2) ; in GetOptimum() 955 _matchDistances[numDistancePair in GetOptimum() [all...]

Completed in 3 milliseconds