Struct ProofGraphNode 

pub struct ProofGraphNode {
    pub key: FactKey,
    pub handle: Option<FactHandle>,
    pub justifications: Vec<Justification>,
    pub dependents: HashSet<FactHandle>,
    pub valid: bool,
    pub generation: u64,
    pub bindings: HashMap<String, Value>,
}

A node in the proof graph representing a proven fact

Fields

key: FactKey

Unique key for this fact

handle: Option<FactHandle>

Fact handle from IncrementalEngine (if inserted logically)

justifications: Vec<Justification>

All justifications (ways this fact was proven)

dependents: HashSet<FactHandle>

Dependents (facts that depend on this fact as premise)

valid: bool

Whether this fact is currently valid

generation: u64

Generation when last validated

bindings: HashMap<String, Value>

Variable bindings (if any) associated with this proof

Implementations

impl ProofGraphNode

pub fn new(key: FactKey) -> Self

Create a new proof graph node

pub fn add_justification( &mut self, rule_name: String, premises: Vec<FactHandle>, premise_keys: Vec<String>, generation: u64, )

Add a justification

pub fn has_valid_justifications(&self) -> bool

Check if this node has any valid justifications

pub fn remove_justifications_with_premise( &mut self, premise_handle: &FactHandle, ) -> bool

Remove a justification involving a retracted premise

Trait Implementations

impl Clone for ProofGraphNode

fn clone(&self) -> ProofGraphNode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ProofGraphNode

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

Formats the value using the given formatter.