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
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.
Hash Chain with 2- and 3-byte hashing
Hash Chain with 2-, 3-, and 4-byte hashing
Binary Tree with 2-byte hashing
Binary Tree with 2- and 3-byte hashing
Binary Tree with 2-, 3-, and 4-byte hashing
pub fn is_supported(&self) -> bool[src]
Test if this match finder is supported in this build of liblzma.
impl Clone for MatchFinder[src]
impl Copy for MatchFinder[src]
impl RefUnwindSafe for MatchFinder
impl Send for MatchFinder
impl Sync for MatchFinder
impl Unpin for MatchFinder
impl UnwindSafe for MatchFinder
type Owned = T
The resulting type after obtaining ownership.
fn clone_into(&self, target: &mut T)[src]
type Error = Infallible
The type returned in the event of a conversion error.