Struct Deduction 

pub struct Deduction<Identifier, Int> {
    pub constraint_id: ConstraintId,
    pub premises: Vec<IntAtomic<Identifier, Int>>,
    pub sequence: Vec<ConstraintId>,
}

An deduction step.

Fields

constraint_id: ConstraintId

The ID of the step.

premises: Vec<IntAtomic<Identifier, Int>>

The premises of the proof.

sequence: Vec<ConstraintId>

The constraints to apply to derive the deduction. These should point to Inferences, but the parser does not verify that.

Trait Implementations

impl<Identifier: Clone, Int: Clone> Clone for Deduction<Identifier, Int>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<Identifier: Debug, Int: Debug> Debug for Deduction<Identifier, Int>

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

Formats the value using the given formatter.

impl<Identifier: Hash, Int: Hash> Hash for Deduction<Identifier, Int>

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> PartialEq for Deduction<Identifier, Int>

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

impl<Identifier, Int> StructuralPartialEq for Deduction<Identifier, Int>