Home
Sort by
last modified time
|
relevance
|
path
Repository(s)
applications
arkcompiler
base
build
commonlibrary
developtools
device
docs
domains
drivers
foundation
ide
interface
kernel
napi_generator
productdefine
test
third_party
vendor
select all
invert selection
clear
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
Any
Bzip(2)
C
Clojure
C#
C++
ELF
Erlang
Image file
Fortran
Golang
GZIP
Haskell
Jar
Java
Java class
JavaScript
Lisp
Lua
Pascal
Perl
PHP
Plain Text
PL/SQL
Python
Rust
Scala
Shell script
SQL
Tar
Tcl
Troff
UUEncoded
Visual Basic
XML
Zip
Type of analyzer used to filter file types include with selected(e.g. just C sources).
Help
Searched
refs:numDistancePairs
(Results
1 - 2
of
2
) sorted by relevance
/third_party/lzma/CS/7zip/Compress/LZMA/
H
A
D
LzmaEncoder.cs
431
void ReadMatchDistances(out UInt32 lenRes, out UInt32
numDistancePairs
)
in ReadMatchDistances()
argument
434
numDistancePairs
= _matchFinder.GetMatches(_matchDistances);
in ReadMatchDistances()
435
if (
numDistancePairs
> 0)
in ReadMatchDistances()
437
lenRes = _matchDistances[
numDistancePairs
- 2];
in ReadMatchDistances()
439
lenRes += _matchFinder.GetMatchLen((int)lenRes - 1, _matchDistances[
numDistancePairs
- 1],
in ReadMatchDistances()
550
UInt32 lenMain,
numDistancePairs
;
in GetOptimum()
553
ReadMatchDistances(out lenMain, out
numDistancePairs
);
in GetOptimum()
558
numDistancePairs
= _numDistancePairs;
in GetOptimum()
590
backRes = _matchDistances[
numDistancePairs
- 1] + Base.kNumRepDistances;
in GetOptimum()
689
if (offs ==
numDistancePairs
)
in GetOptimum()
[all...]
/third_party/lzma/Java/SevenZip/Compression/LZMA/
H
A
D
Encoder.java
550
int lenMain,
numDistancePairs
;
in GetOptimum()
560
numDistancePairs
= _numDistancePairs;
in GetOptimum()
590
backRes = _matchDistances[
numDistancePairs
- 1] + Base.kNumRepDistances;
in GetOptimum()
689
if (offs ==
numDistancePairs
)
in GetOptimum()
703
numDistancePairs
= _numDistancePairs;
in GetOptimum()
954
for (
numDistancePairs
= 0; newLen > _matchDistances[
numDistancePairs
];
numDistancePairs
+= 2) ;
in GetOptimum()
955
_matchDistances[
numDistancePairs
] = newLen;
in GetOptimum()
956
numDistancePairs
in GetOptimum()
[all...]
Completed in 3 milliseconds