[−][src]Enum xz::stream::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.
Variants
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
Implementations
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]
fn clone(&self) -> MatchFinder
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl Copy for MatchFinder
[src]
Auto Trait Implementations
impl RefUnwindSafe for MatchFinder
impl Send for MatchFinder
impl Sync for MatchFinder
impl Unpin for MatchFinder
impl UnwindSafe for MatchFinder
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,