Struct TriMatching 

pub struct TriMatching { /* private fields */ }

Matching between a base and two branch trees.

This struct coordinates the matching process for 3-way merge:

1. Matches the right branch against the base tree
2. Swaps left/right matchings in base nodes (so right matchings become “right”)
3. Matches the left branch against the base tree
4. Sets up partner relationships so each branch node knows its partners in the other branch

Implementations

impl TriMatching

pub fn new(left: NodeRef, base: NodeRef, right: NodeRef) -> Self

Creates a new TriMatching using the default HeuristicMatching algorithm.

pub fn with_copy_threshold( left: NodeRef, base: NodeRef, right: NodeRef, copy_threshold: i32, ) -> Self

Creates a new TriMatching with a custom copy threshold.

The copy threshold determines the minimum size (in info bytes) for a subtree to be considered a copy. Smaller subtrees are treated as separate insertions. Use 0 to disable copy detection.

pub fn with_matching<L: Matching + Default, R: Matching + Default>( left: NodeRef, base: NodeRef, right: NodeRef, ) -> Self

Creates a new TriMatching with custom matching algorithms.

This allows using different matching strategies for left and right branches. For example, DiffMatching could be used for one branch if needed.

pub fn left_root(&self) -> &NodeRef

Returns a reference to the left branch root.

pub fn right_root(&self) -> &NodeRef

Returns a reference to the right branch root.

pub fn base_root(&self) -> &NodeRef

Returns a reference to the base tree root.