Struct ProofStep 

pub struct ProofStep(/* private fields */);

A clause introduction or deletion

This is essentially this enum, but we pack everything into 32 bits.

enum ProofStep {
    Lemma(Clause),
    Deletion(Clause),
}

Implementations

impl ProofStep

pub fn lemma(clause: Clause) -> ProofStep

Create a proof step that introduces the given clause.

pub fn deletion(clause: Clause) -> ProofStep

Create a proof step that deletes the given clause.

pub fn is_deletion(self) -> bool

Return true if this proof step is a clause deletion.

pub fn clause(self) -> Clause

Return the clause that this proof step introduces or deletes.

Trait Implementations

impl Clone for ProofStep

fn clone(&self) -> ProofStep

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for ProofStep

impl Debug for ProofStep

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

Formats the value using the given formatter.

impl Default for ProofStep

fn default() -> ProofStep

Returns the “default value” for a type.

impl Eq for ProofStep

impl PartialEq for ProofStep

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