Struct GapPolicy 

pub struct GapPolicy<C> {
    pub delete: C,
    pub insert: C,
}

Costs for advancing only one side of an edit alignment.

Fields

delete: C

Cost of consuming a left item without a right item.

insert: C

Cost of consuming a right item without a left item.

Implementations

impl<C> GapPolicy<C>

pub fn new(delete: C, insert: C) -> Self

Builds a gap policy with explicit deletion and insertion costs.

Trait Implementations

impl<C: Clone> Clone for GapPolicy<C>

fn clone(&self) -> GapPolicy<C>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<C: Debug> Debug for GapPolicy<C>

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

Formats the value using the given formatter.

impl<C: Eq> Eq for GapPolicy<C>

impl<C: PartialEq> PartialEq for GapPolicy<C>

fn eq(&self, other: &GapPolicy<C>) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<C: PartialEq> StructuralPartialEq for GapPolicy<C>