[][src]Enum xz::stream::MatchFinder

pub enum MatchFinder {

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.



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


impl MatchFinder[src]

pub fn is_supported(&self) -> bool[src]

Test if this match finder is supported in this build of liblzma.

Trait Implementations

impl Clone for MatchFinder[src]

impl Copy for MatchFinder[src]

Auto Trait Implementations

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized

impl<T> Borrow<T> for T where
    T: ?Sized

impl<T> BorrowMut<T> for T where
    T: ?Sized

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, 

impl<T> ToOwned for T where
    T: Clone

type Owned = T

The resulting type after obtaining ownership.

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.