Struct MyersDiffer 

pub struct MyersDiffer<'a> { /* private fields */ }

The Myers differ implementation that uses Myers algorithm for diffing

This implementation uses the Longest Common Subsequence (LCS) approach, which is a dynamic programming solution that provides the foundation of Myers’ algorithm. While the full Myers O(ND) optimization uses a greedy approach with diagonal paths, this implementation prioritizes correctness and readability based on LCS.

Implementations

impl<'a> MyersDiffer<'a>

pub fn new(differ: &'a Differ) -> Self

Create a new MyersDiffer from a base Differ instance

Trait Implementations

impl DiffAlgorithm for MyersDiffer<'_>

fn generate(&self) -> Patch

Generate a patch between the old and new content using the Myers diffing algorithm (LCS based)