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 Clone for MatchingType
[src]fn clone(&self) -> MatchingType
[src]
pub fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl Hash for MatchingType
[src]
impl Hash for MatchingType
[src]impl Ord for MatchingType
[src]
impl Ord for MatchingType
[src]impl PartialEq<MatchingType> for MatchingType
[src]
impl PartialEq<MatchingType> for MatchingType
[src]impl PartialOrd<MatchingType> for MatchingType
[src]
impl PartialOrd<MatchingType> for MatchingType
[src]fn partial_cmp(&self, other: &MatchingType) -> Option<Ordering>
[src]
#[must_use]pub fn lt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]
pub fn lt(&self, other: &Rhs) -> bool#[must_use]pub fn le(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]
pub fn le(&self, other: &Rhs) -> bool#[must_use]pub fn gt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]
pub fn gt(&self, other: &Rhs) -> bool#[must_use]pub fn ge(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]
pub fn ge(&self, other: &Rhs) -> bool