tree-edit-distance 0.4.0

Find the lowest cost sequence of edits between two trees
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25

use crate::Fold;

/// A single operation between two [Node][crate::Node]s.
#[derive(Debug, Clone, Eq, PartialEq, Hash)]
pub enum Edit {
    /// Swap the [Node][crate::Node]s and edit their children.
    Replace(Box<[Edit]>),

    /// Insert the incoming [Node][crate::Node] along with its children in place.
    Insert,

    /// Remove the existing [Node][crate::Node] along with its children.
    Remove,
}

impl Fold for Edit {
    #[inline]
    fn fold<R, Fn: FnMut(R, &Self) -> R>(&self, init: R, f: &mut Fn) -> R {
        if let Edit::Replace(c) = self {
            c.fold(f(init, self), f)
        } else {
            f(init, self)
        }
    }
}