Struct ProofTreeInput 

pub struct ProofTreeInput {
    pub root_goal: String,
    pub nodes: HashMap<String, ProofNodeInput>,
    pub proved: bool,
}

Full proof tree as produced by the distributed backward chainer.

Fields

root_goal: String

Node ID of the root goal.

nodes: HashMap<String, ProofNodeInput>

All nodes in the tree, keyed by their node ID.

proved: bool

Whether the root goal was successfully proved.

Trait Implementations

impl Clone for ProofTreeInput

fn clone(&self) -> ProofTreeInput

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ProofTreeInput

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for ProofTreeInput

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for ProofTreeInput

impl PartialEq for ProofTreeInput

fn eq(&self, other: &ProofTreeInput) -> 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 ProofTreeInput

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 ProofTreeInput