Struct Unifier 

pub struct Unifier;

Unification algorithm for pattern matching

The Unifier provides algorithms for:

• Unifying two expressions with variable bindings
• Matching expressions against facts
• Evaluating expressions with variable substitution

Implementations

impl Unifier

pub fn unify( left: &Expression, right: &Expression, bindings: &mut Bindings, ) -> Result<bool>

Unify two expressions with variable bindings

This is the core unification algorithm. It attempts to make two expressions equal by binding variables to values.

Returns

• Ok(true) if unification succeeded
• Ok(false) if expressions cannot be unified
• Err(_) if there’s a binding conflict

pub fn match_expression( expr: &Expression, facts: &Facts, bindings: &mut Bindings, ) -> Result<bool>

Match expression against facts and extract bindings

This evaluates an expression against the current facts, binding any variables to their matched values.

pub fn evaluate_with_bindings( expr: &Expression, facts: &Facts, bindings: &Bindings, ) -> Result<Value>

Evaluate expression with variable bindings

This evaluates an expression to a value, substituting any bound variables.