Enum deflate::MatchingType [−][src]
pub enum MatchingType { Greedy, Lazy, }
An enum describing whether we use lazy or greedy matching.
Variants
Use greedy matching: the matching algorithm simply uses a match right away if found.
Use lazy matching: after finding a match, the next input byte is checked, to see if there is a better match starting at that byte.
As a special case, if max_hash_checks is set to 0, compression using only run-length (i.e maximum match distance of 1) is performed instead.
Trait Implementations
impl Clone for MatchingType
[src][+]
impl Copy for MatchingType
[src]
impl Debug for MatchingType
[src][+]
impl Display for MatchingType
[src][+]
impl Eq for MatchingType
[src]
impl Hash for MatchingType
[src][+]
impl Ord for MatchingType
[src][+]
impl PartialEq<MatchingType> for MatchingType
[src][+]
impl PartialOrd<MatchingType> for MatchingType
[src][+]
impl StructuralEq for MatchingType
[src]
impl StructuralPartialEq for MatchingType
[src]
Auto Trait Implementations
impl RefUnwindSafe for MatchingType
impl Send for MatchingType
impl Sync for MatchingType
impl Unpin for MatchingType
impl UnwindSafe for MatchingType
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,
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,
impl<T> ToString for T where
T: Display + ?Sized,
[src][+]
T: Display + ?Sized,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src][+]
U: Into<T>,
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src][+]
U: TryFrom<T>,