Struct triple_accel::levenshtein::EditCosts

pub struct EditCosts { /* fields omitted */ }

A struct holding the edit costs for mismatches, gaps, and possibly transpositions.

This should be used as a parameter for Levenshtein distance or search routines.

Implementations

impl EditCosts

pub fn new(
    mismatch_cost: u8,
    gap_cost: u8,
    start_gap_cost: u8,
    transpose_cost: Option<u8>
) -> Self

Create a new EditCosts struct, checking for whether the specified costs are valid.

Arguments

• mismatch_cost - cost of a mismatch edit, which must be positive
• gap_cost - cost of a gap, which must be positive
• start_gap_cost - additional cost of starting a gap, for affine gap costs; this can be zero for linear gap costs
• transpose_cost - cost of a transpose, which must be cheaper than doing the equivalent operation with mismatches and gaps

Trait Implementations

impl Clone for EditCosts

fn clone(&self) -> EditCosts

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Copy for EditCosts

impl Debug for EditCosts

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

Formats the value using the given formatter.