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]

Returns a copy of the value. Read more

Performs copy-assignment from source. Read more

impl Copy for MatchingType
[src]

impl Debug for MatchingType
[src]

Formats the value using the given formatter.

impl Eq for MatchingType
[src]

impl PartialEq for MatchingType
[src]

This method tests for self and other values to be equal, and is used by ==. Read more

This method tests for !=.

impl Ord for MatchingType
[src]

This method returns an Ordering between self and other. Read more

🔬 This is a nightly-only experimental API. (ord_max_min)

Compares and returns the maximum of two values. Read more

🔬 This is a nightly-only experimental API. (ord_max_min)

Compares and returns the minimum of two values. Read more

impl PartialOrd for MatchingType
[src]

This method returns an ordering between self and other values if one exists. Read more

This method tests less than (for self and other) and is used by the < operator. Read more

This method tests less than or equal to (for self and other) and is used by the <= operator. Read more

This method tests greater than (for self and other) and is used by the > operator. Read more

This method tests greater than or equal to (for self and other) and is used by the >= operator. Read more

impl Hash for MatchingType
[src]

Feeds this value into the given [Hasher]. Read more

Feeds a slice of this type into the given [Hasher]. Read more

impl Display for MatchingType
[src]

Formats the value using the given formatter. Read more