Struct ReteUlEngine 

pub struct ReteUlEngine { /* private fields */ }

RETE-UL Engine with cached nodes (Performance optimized!) This engine builds RETE nodes once and reuses them, avoiding expensive rebuilds

Implementations

impl ReteUlEngine

pub fn new() -> Self

Create new engine from Rule definitions (nodes are built and cached once)

pub fn add_rule_with_action<F>( &mut self, name: String, node: ReteUlNode, priority: i32, no_loop: bool, action: F, )

where F: FnMut(&mut HashMap<String, String>) + 'static,

Add a rule with custom action closure

pub fn add_rule_from_definition( &mut self, rule: &Rule, priority: i32, no_loop: bool, )

Add a rule from Rule definition (auto-build node once and cache)

pub fn set_fact(&mut self, key: String, value: String)

Set a fact

pub fn get_fact(&self, key: &str) -> Option<&String>

Get a fact

pub fn remove_fact(&mut self, key: &str) -> Option<String>

Remove a fact

pub fn get_all_facts(&self) -> &HashMap<String, String>

Get all facts

pub fn clear_facts(&mut self)

Clear all facts

pub fn fire_all(&mut self) -> Vec<String>

Fire all rules with agenda (using cached nodes - NO rebuild!)

pub fn matches(&self, rule_name: &str) -> bool

Check if a specific rule matches current facts (without firing)

pub fn get_matching_rules(&self) -> Vec<&str>

Get all matching rules (without firing)

pub fn reset_fired_flags(&mut self)

Reset fired flags (allow rules to fire again)