Struct Tree

pub struct Tree { /* private fields */ }

An SLD tree consists of

• a goal with its dependencies (at which level and from which part of body each literal was introduced)
• a level, which is incremented as tree grows
• a mapping from (selected literal in goal, applied rule) to (mgu after rule renaming, rule renaming, resolvent subtree)

Implementations

impl Tree

pub fn to_graph(&self, rules: &[Clause]) -> Graph

Converts this tree to a directed graph.

pub fn explain(&self, rules: &[Clause]) -> StringItem

Returns a string explaining the SLD tree, using indentation, etc.

Trait Implementations

impl Clone for Tree

fn clone(&self) -> Tree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Tree

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

Formats the value using the given formatter.

impl PartialEq for Tree

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