Struct satoxid::constraints::If

pub struct If<C, T> {
    pub cond: C,
    pub then: T,
}

Implication constraint. If cond is satisfied true then the then constraint has to be true.

Fields

cond: C

then: T

Trait Implementations

impl<C: Clone, T: Clone> Clone for If<C, T>

fn clone(&self) -> If<C, T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<V, C, T> Constraint<V> for If<C, T> where
    V: SatVar,
    C: ConstraintRepr<V>,
    T: Constraint<V>, 

fn encode<B: Backend>(self, backend: &mut B, varmap: &mut VarMap<V>)

Encode Self as an constraint using solver.

impl<V, C, T> ConstraintRepr<V> for If<C, T> where
    V: SatVar,
    C: ConstraintRepr<V>,
    T: ConstraintRepr<V>, 

fn encode_constraint_implies_repr<B: Backend>(
    self,
    repr: Option<i32>,
    backend: &mut B,
    varmap: &mut VarMap<V>
) -> i32

Encode if Self is satisified, that repr is true. Otherwise repr is not constrained and can be true or false.

fn encode_constraint_equals_repr<B: Backend>(
    self,
    repr: Option<i32>,
    backend: &mut B,
    varmap: &mut VarMap<V>
) -> i32

Encode if and only if Self is satisified, that repr is true.

fn encode_constraint_repr_cheap<B: Backend>(
    self,
    repr: Option<i32>,
    backend: &mut B,
    varmap: &mut VarMap<V>
) -> i32

Encode that repr is true if the constraint is satisfied. The implementation can decide if it has the semantics of encode_constraint_implies_repr or encode_constraint_equals_repr, depending on what is cheaper to encode.

impl<C: Debug, T: Debug> Debug for If<C, T>

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

Formats the value using the given formatter.