Function diff

atomic-core/src/diff/patience.rs:80–98

Compute the diff between two sequences using the Patience algorithm. This algorithm often produces more intuitive diffs for source code by using unique lines as anchor points. # Arguments `old` - The original sequence `new` - The modified sequence # Returns A [`DiffResult`] containing the operations to transform old → new. # Algorithm 1. Find lines that appear exactly once in both sequences

(old: &[Line<'a>], new: &[Line<'a>])

/// 3. Use LIS as anchors and recursively diff regions between them
/// 4. Fall back to Myers diff for regions with no unique matches
pub fn diff<'a>(old: &[Line<'a>], new: &[Line<'a>]) -> DiffResult {
    // Special cases
    if old.is_empty() && new.is_empty() {
        return DiffResult::new();
    }
    if old.is_empty() {
        let mut result = DiffResult::new();
        result.push(DiffOp::insert(0, 0, new.len()));
        return result;
    }
    if new.is_empty() {
        let mut result = DiffResult::new();
        result.push(DiffOp::delete(0, 0, old.len()));
        return result;
    }

    // Run the patience algorithm
    patience_diff_recursive(old, new, 0, 0)
}

/// Recursively apply patience diff to a region.
///