Enum Constraint

#[non_exhaustive]
pub enum Constraint {
    Difference(TwoVars, Var),
    Div(TwoVars, Var),
    DivUndefZero(TwoVars, Var),
    Modulo(TwoVars, Var),
    ModuloUndefZero(TwoVars, Var),
    Pow(TwoVars, Var),
    Product(TwoVars, Var),
    WeightedSumGeq(Vec<Constant>, Vec<Var>, Var),
    WeightedSumLeq(Vec<Constant>, Vec<Var>, Var),
    CheckAssign(Box<Constraint>),
    CheckGsa(Box<Constraint>),
    ForwardChecking(Box<Constraint>),
    Reify(Box<Constraint>, Var),
    ReifyImply(Box<Constraint>, Var),
    ReifyImplyQuick(Box<Constraint>, Var),
    WatchedAnd(Vec<Constraint>),
    WatchedOr(Vec<Constraint>),
    GacAllDiff(Vec<Var>),
    AllDiff(Vec<Var>),
    AllDiffMatrix(Vec<Var>, Constant),
    WatchSumGeq(Vec<Var>, Constant),
    WatchSumLeq(Vec<Var>, Constant),
    OccurrenceGeq(Vec<Var>, Constant, Constant),
    OccurrenceLeq(Vec<Var>, Constant, Constant),
    Occurrence(Vec<Var>, Constant, Var),
    LitSumGeq(Vec<Var>, Vec<Constant>, Constant),
    Gcc(Vec<Var>, Vec<Constant>, Vec<Var>),
    GccWeak(Vec<Var>, Vec<Constant>, Vec<Var>),
    LexLeqRv(Vec<Var>, Vec<Var>),
    LexLeq(Vec<Var>, Vec<Var>),
    LexLess(Vec<Var>, Vec<Var>),
    LexLeqQuick(Vec<Var>, Vec<Var>),
    LexLessQuick(Vec<Var>, Vec<Var>),
    WatchVecNeq(Vec<Var>, Vec<Var>),
    WatchVecExistsLess(Vec<Var>, Vec<Var>),
    Hamming(Vec<Var>, Vec<Var>, Constant),
    NotHamming(Vec<Var>, Vec<Var>, Constant),
    FrameUpdate(Vec<Var>, Vec<Var>, Vec<Var>, Vec<Var>, Constant),
    NegativeTable(Vec<Var>, Vec<Tuple>),
    Table(Vec<Var>, Vec<Tuple>),
    GacSchema(Vec<Var>, Vec<Tuple>),
    LightTable(Vec<Var>, Vec<Tuple>),
    Mddc(Vec<Var>, Vec<Tuple>),
    NegativeMddc(Vec<Var>, Vec<Tuple>),
    Str2Plus(Vec<Var>, Var),
    Max(Vec<Var>, Var),
    Min(Vec<Var>, Var),
    NvalueGeq(Vec<Var>, Var),
    NvalueLeq(Vec<Var>, Var),
    SumLeq(Vec<Var>, Var),
    SumGeq(Vec<Var>, Var),
    Element(Vec<Var>, Var, Var),
    ElementOne(Vec<Var>, Var, Var),
    ElementUndefZero(Vec<Var>, Var, Var),
    WatchElement(Vec<Var>, Var, Var),
    WatchElementOne(Vec<Var>, Var, Var),
    WatchElementOneUndefZero(Vec<Var>, Var, Var),
    WatchElementUndefZero(Vec<Var>, Var, Var),
    WLiteral(Var, Constant),
    WNotLiteral(Var, Constant),
    WInIntervalSet(Var, Vec<Constant>),
    WInRange(Var, Vec<Constant>),
    WInset(Var, Vec<Constant>),
    WNotInRange(Var, Vec<Constant>),
    WNotInset(Var, Vec<Constant>),
    Abs(Var, Var),
    DisEq(Var, Var),
    Eq(Var, Var),
    MinusEq(Var, Var),
    GacEq(Var, Var),
    WatchLess(Var, Var),
    WatchNeq(Var, Var),
    Ineq(Var, Var, Constant),
    False,
    True,
}

All supported Minion constraints.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Difference(TwoVars, Var)

Div(TwoVars, Var)

DivUndefZero(TwoVars, Var)

Modulo(TwoVars, Var)

ModuloUndefZero(TwoVars, Var)

Pow(TwoVars, Var)

Product(TwoVars, Var)

WeightedSumGeq(Vec<Constant>, Vec<Var>, Var)

WeightedSumLeq(Vec<Constant>, Vec<Var>, Var)

CheckAssign(Box<Constraint>)

CheckGsa(Box<Constraint>)

ForwardChecking(Box<Constraint>)

Reify(Box<Constraint>, Var)

ReifyImply(Box<Constraint>, Var)

ReifyImplyQuick(Box<Constraint>, Var)

WatchedAnd(Vec<Constraint>)

WatchedOr(Vec<Constraint>)

GacAllDiff(Vec<Var>)

AllDiff(Vec<Var>)

AllDiffMatrix(Vec<Var>, Constant)

WatchSumGeq(Vec<Var>, Constant)

WatchSumLeq(Vec<Var>, Constant)

OccurrenceGeq(Vec<Var>, Constant, Constant)

OccurrenceLeq(Vec<Var>, Constant, Constant)

Occurrence(Vec<Var>, Constant, Var)

LitSumGeq(Vec<Var>, Vec<Constant>, Constant)

Gcc(Vec<Var>, Vec<Constant>, Vec<Var>)

GccWeak(Vec<Var>, Vec<Constant>, Vec<Var>)

LexLeqRv(Vec<Var>, Vec<Var>)

LexLeq(Vec<Var>, Vec<Var>)

LexLess(Vec<Var>, Vec<Var>)

LexLeqQuick(Vec<Var>, Vec<Var>)

LexLessQuick(Vec<Var>, Vec<Var>)

WatchVecNeq(Vec<Var>, Vec<Var>)

WatchVecExistsLess(Vec<Var>, Vec<Var>)

Hamming(Vec<Var>, Vec<Var>, Constant)

NotHamming(Vec<Var>, Vec<Var>, Constant)

FrameUpdate(Vec<Var>, Vec<Var>, Vec<Var>, Vec<Var>, Constant)

NegativeTable(Vec<Var>, Vec<Tuple>)

Table(Vec<Var>, Vec<Tuple>)

GacSchema(Vec<Var>, Vec<Tuple>)

LightTable(Vec<Var>, Vec<Tuple>)

Mddc(Vec<Var>, Vec<Tuple>)

NegativeMddc(Vec<Var>, Vec<Tuple>)

Str2Plus(Vec<Var>, Var)

Max(Vec<Var>, Var)

Min(Vec<Var>, Var)

NvalueGeq(Vec<Var>, Var)

NvalueLeq(Vec<Var>, Var)

SumLeq(Vec<Var>, Var)

SumGeq(Vec<Var>, Var)

Element(Vec<Var>, Var, Var)

ElementOne(Vec<Var>, Var, Var)

ElementUndefZero(Vec<Var>, Var, Var)

WatchElement(Vec<Var>, Var, Var)

WatchElementOne(Vec<Var>, Var, Var)

WatchElementOneUndefZero(Vec<Var>, Var, Var)

WatchElementUndefZero(Vec<Var>, Var, Var)

WLiteral(Var, Constant)

WNotLiteral(Var, Constant)

WInIntervalSet(Var, Vec<Constant>)

WInRange(Var, Vec<Constant>)

WInset(Var, Vec<Constant>)

WNotInRange(Var, Vec<Constant>)

WNotInset(Var, Vec<Constant>)

Abs(Var, Var)

DisEq(Var, Var)

Eq(Var, Var)

MinusEq(Var, Var)

GacEq(Var, Var)

WatchLess(Var, Var)

WatchNeq(Var, Var)

Ineq(Var, Var, Constant)

False

True

Trait Implementations

impl Clone for Constraint

fn clone(&self) -> Constraint

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Constraint

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

Formats the value using the given formatter.

impl PartialEq for Constraint

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

impl StructuralPartialEq for Constraint