Enum Step 

pub enum Step<Identifier, Int, Label> {
    Inference(Inference<Identifier, Int, Label>),
    Deduction(Deduction<Identifier, Int>),
    Conclusion(Conclusion<Identifier, Int>),
}

An individual proof step from the proof.

Variants

Inference(Inference<Identifier, Int, Label>)

Deduction(Deduction<Identifier, Int>)

Conclusion(Conclusion<Identifier, Int>)

Trait Implementations

impl<Identifier: Clone, Int: Clone, Label: Clone> Clone for Step<Identifier, Int, Label>

fn clone(&self) -> Step<Identifier, Int, Label>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<Identifier: Debug, Int: Debug, Label: Debug> Debug for Step<Identifier, Int, Label>

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

Formats the value using the given formatter.

impl<Identifier: Hash, Int: Hash, Label: Hash> Hash for Step<Identifier, Int, Label>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<Identifier: PartialEq, Int: PartialEq, Label: PartialEq> PartialEq for Step<Identifier, Int, Label>

fn eq(&self, other: &Step<Identifier, Int, Label>) -> 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<Identifier: Eq, Int: Eq, Label: Eq> Eq for Step<Identifier, Int, Label>

impl<Identifier, Int, Label> StructuralPartialEq for Step<Identifier, Int, Label>