Struct ProofNodeRecord 

pub struct ProofNodeRecord {
    pub node_id: String,
    pub rule_id: Option<String>,
    pub bindings: HashMap<String, String>,
    pub children_ids: Vec<String>,
    pub is_leaf: bool,
    pub peer_id: Option<String>,
}

A flattened representation of one node, suitable for storage and transmission.

Fields

node_id: String

Unique identifier of this node within the proof.

rule_id: Option<String>

Rule applied at this node, if any.

bindings: HashMap<String, String>

Variable bindings at this node.

children_ids: Vec<String>

IDs of direct child nodes (in original order).

is_leaf: bool

true when the node has no children (base-fact or axiom leaf).

peer_id: Option<String>

Remote peer that resolved this node’s goal, if any.

Trait Implementations

impl Clone for ProofNodeRecord

fn clone(&self) -> ProofNodeRecord

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ProofNodeRecord

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for ProofNodeRecord

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for ProofNodeRecord

impl PartialEq for ProofNodeRecord

fn eq(&self, other: &ProofNodeRecord) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for ProofNodeRecord

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for ProofNodeRecord