Struct ConclusionIndex 

pub struct ConclusionIndex { /* private fields */ }

Index for fast lookup of rules by their conclusions

This is similar to RETE’s beta memory but specialized for backward chaining. Instead of matching conditions, we match rule conclusions (actions) to goals.

Implementations

impl ConclusionIndex

pub fn new() -> Self

Create a new empty conclusion index

pub fn from_rules(rules: &[Rule]) -> Self

Build index from a collection of rules

pub fn add_rule(&mut self, rule: &Rule)

Add a rule to the index

pub fn remove_rule(&mut self, rule_name: &str)

Remove a rule from the index

pub fn find_candidates(&self, goal_pattern: &str) -> HashSet<String>

Find candidate rules that could prove a goal

This is the O(1) lookup that replaces O(n) iteration.

Arguments

• goal_pattern - The goal pattern to prove (e.g., “User.IsVIP == true”)

Returns

Set of rule names that might be able to derive this goal

pub fn stats(&self) -> IndexStats

Get statistics about the index

pub fn clear(&mut self)

Clear the index

pub fn is_empty(&self) -> bool

Check if index is empty

Trait Implementations

impl Clone for ConclusionIndex

fn clone(&self) -> ConclusionIndex

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for ConclusionIndex

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for ConclusionIndex

fn default() -> Self

Returns the “default value” for a type.