Enum xz2::stream::MatchFinder
[−]
[src]
pub enum MatchFinder { HashChain3, HashChain4, BinaryTree2, BinaryTree3, BinaryTree4, }
Match finders
Match finder has major effect on both speed and compression ratio. Usually hash chains are faster than binary trees.
If you will use SyncFlush
often, the hash chains may be a better choice,
because binary trees get much higher compression ratio penalty with
SyncFlush
.
The memory usage formulas are only rough estimates, which are closest to reality when dict_size is a power of two. The formulas are more complex in reality, and can also change a little between liblzma versions.
Variants
HashChain3
Hash Chain with 2- and 3-byte hashing
HashChain4
Hash Chain with 2-, 3-, and 4-byte hashing
BinaryTree2
Binary Tree with 2-byte hashing
BinaryTree3
Binary Tree with 2- and 3-byte hashing
BinaryTree4
Binary Tree with 2-, 3-, and 4-byte hashing
Methods
impl MatchFinder
[src]
fn is_supported(&self) -> bool
Test if this match finder is supported in this build of liblzma.
Trait Implementations
impl Copy for MatchFinder
[src]
impl Clone for MatchFinder
[src]
fn clone(&self) -> MatchFinder
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0
Performs copy-assignment from source
. Read more