Struct SequenceMatcher 

pub struct SequenceMatcher {
    a: Vec<char>,
    b: Vec<char>,
    b2j: HashMap<char, Vec<usize>>,
}

difflib.SequenceMatcher(None, a, b) over character sequences.

Fields

a: Vec<char>

b: Vec<char>

b2j: HashMap<char, Vec<usize>>

Each char of b to the indices where it occurs, in order.

Implementations

impl SequenceMatcher

pub fn new(a: &str, b: &str) -> SequenceMatcher

fn find_longest_match( &self, alo: usize, ahi: usize, blo: usize, bhi: usize, ) -> (usize, usize, usize)

find_longest_match(alo, ahi, blo, bhi). With no isjunk the junk set is empty, so only CPython’s first pair of extension passes can move — and they do, over popular elements autojunk dropped.

fn total_matches(&self) -> usize

Total size of all matching blocks — everything ratio needs.

pub fn ratio(&self) -> f64

ratio() — 2 * matches / (len(a) + len(b)), or 1.0 for two empties.