Enum Ranking 

#[non_exhaustive]
pub enum Ranking {
    Coarse,
    Exact,
}

How results are ordered.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Coarse

By the weighted cost rounded up to whole units of 16 (whole_units), then higher weight, then lower term id. Terms whose costs round to the same number of units are ordered by weight. This is not a count of edits: the x1.5 factor on the first byte makes an ordinary (non-neighbouring-key) edit there cost 24, i.e. two units, while a neighbouring-key substitution there costs 12 (one unit) and a transposition 18 (two units); two cheap edits (8 + 8) count as one.

Exact

By the exact weighted cost, then higher weight, then lower term id.

Trait Implementations

impl Clone for Ranking

fn clone(&self) -> Ranking

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for Ranking

impl Debug for Ranking

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for Ranking

fn default() -> Ranking

Returns the “default value” for a type.

impl Eq for Ranking

impl PartialEq for Ranking

fn eq(&self, other: &Ranking) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Ranking