Struct libdiffsitter::diff::MyersFrontiers

pub struct MyersFrontiers {
    pub forward: NegIdxVec<i32>,
    pub reverse: NegIdxVec<i32>,
}

The frontiers for the Myers diff algorithm

We define this externally to the recursive method so we can allocate once and reuse between recursive calls.

Fields

forward: NegIdxVec<i32>

Stores the longest path seen from the old input to the new input

reverse: NegIdxVec<i32>

Stores the longest path seen from the new input to the old input