Enum Algorithm 

pub enum Algorithm {
    Greedy,
    Onepass,
    Correcting,
}

Differencing algorithm selection.

Variants

Greedy

Optimal under simple cost; O(|V|·|R|) time, O(|R|) space (Section 3).

Onepass

Linear time and near-constant space; concurrent scan of R and V (Section 4).

Correcting

Near-optimal, 1.5-pass; hash table with fingerprint checkpointing (Sections 7–8).

Trait Implementations

impl Clone for Algorithm

fn clone(&self) -> Algorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Algorithm

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

Formats the value using the given formatter.

impl PartialEq for Algorithm

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for Algorithm

impl Eq for Algorithm

impl StructuralPartialEq for Algorithm