Struct HeuristicMatching 

pub struct HeuristicMatching { /* private fields */ }

Heuristic matching algorithm for building correspondences between trees.

This implementation follows the algorithm described in the 3DM thesis:

1. Find candidate matches using exact content hash or fuzzy matching
2. Score candidates by counting matching descendants (DFS match)
3. Select best candidate, resolving ambiguities using sibling context
4. Remove small copies below copy_threshold
5. Match similar unmatched nodes to neighbors’ siblings
6. Set match types (FULL/CONTENT/CHILDREN) for copies

Implementations

impl HeuristicMatching

pub fn new() -> Self

Creates a new HeuristicMatching instance with default copy threshold.

pub fn with_copy_threshold(copy_threshold: i32) -> Self

Creates a new HeuristicMatching instance with custom copy threshold.

pub fn with_trees(base: &NodeRef, branch: &NodeRef) -> Self

Creates a new HeuristicMatching and builds the matching.

pub fn set_is_left(&mut self, is_left: bool)

Sets whether this matching is for the left branch.

pub fn copy_threshold(&self) -> i32

Returns the copy threshold.

Trait Implementations

impl Default for HeuristicMatching

fn default() -> Self

Returns the “default value” for a type.

impl Matching for HeuristicMatching

fn build_matching(&mut self, base: &NodeRef, branch: &NodeRef)

Builds a matching between a base tree and a branch tree.

fn get_area_stop_nodes(&self, stop_nodes: &mut Vec<NodeRef>, node: &NodeRef)

Gets the children of leaf nodes in a matching subtree.

fn base_root(&self) -> Option<&NodeRef>

Returns a reference to the base tree root.

fn branch_root(&self) -> Option<&NodeRef>

Returns a reference to the branch tree root.