Enum CardConstraint

pub enum CardConstraint {
    Ub(CardUbConstr),
    Lb(CardLbConstr),
    Eq(CardEqConstr),
}

Type representing a cardinality constraint.

Variants

Ub(CardUbConstr)

An upper bound cardinality constraint

Lb(CardLbConstr)

A lower bound cardinality constraint

Eq(CardEqConstr)

An equality cardinality constraint

Implementations

impl CardConstraint

pub fn new_unit(lit: Lit) -> Self

Constructs a new unit constraint enforcing a literal

pub fn new_ub<LI: LitIter>(lits: LI, b: usize) -> Self

Constructs a new upper bound cardinality constraint (sum of lits <= b)

pub fn new_lb<LI: LitIter>(lits: LI, b: usize) -> Self

Constructs a new lower bound cardinality constraint (sum of lits >= b)

pub fn new_eq<LI: LitIter>(lits: LI, b: usize) -> Self

Constructs a new equality cardinality constraint (sum of lits = b)

pub fn add<LI: LitIter>(&mut self, lits: LI)

Adds literals to the cardinality constraint

pub fn bound(&self) -> usize

Gets the bound of the constraint

pub fn len(&self) -> usize

Gets the number of literals in the constraint

pub fn is_empty(&self) -> bool

Checks whether the constraint is empty

pub fn n_lits(&self) -> usize

Gets the number of literals in the constraint

pub fn change_bound(&mut self, b: usize)

👎Deprecated since 0.7.0: change_bound has been renamed to set_bound

Changes the bound on the constraint

pub fn set_bound(&mut self, bound: usize)

Sets the bound of the constraint

pub fn is_tautology(&self) -> bool

Checks if the constraint is always satisfied

pub fn is_unsat(&self) -> bool

Checks if the constraint is unsatisfiable

pub fn is_positive_assignment(&self) -> bool

Checks if the constraint assigns all literals to true

pub fn is_negative_assignment(&self) -> bool

Checks if the constraint assigns all literals to false

pub fn is_clause(&self) -> bool

Checks if the constraint is a clause

pub fn normalize(self) -> Self

Normalizes the constraint. This only consists of sorting the literals. Comparing two normalized constraints checks their logical equivalence.

pub fn into_lits(self) -> Vec<Lit>

Gets the literals that are in the constraint

pub fn into_clause(self) -> Result<Clause, RequiresClausal>

Converts the constraint into a clause, if possible

Errors

If the constraint is not a clause, returns RequiresClausal.

pub fn iter(&self) -> Iter<'_, Lit>

Gets an iterator over the literals in the constraint

pub fn iter_mut(&mut self) -> IterMut<'_, Lit>

Gets a mutable iterator over the literals in the constraint

pub fn evaluate(&self, assign: &Assignment) -> TernaryVal

Checks whether the cardinality constraint is satisfied by the given assignment

Trait Implementations

impl Clone for CardConstraint

fn clone(&self) -> CardConstraint

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl ConstraintLike<Var> for CardConstraint

Available on crate feature proof-logging only.

fn rhs(&self) -> isize

Gets the operator and right hand side of the constraint

fn sum_iter(&self) -> impl Iterator<Item = (isize, Axiom<Var>)>

Gets an iterator over the coefficient literal pairs in the constraint

impl Debug for CardConstraint

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for CardConstraint

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Display for CardConstraint

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

Formats the value using the given formatter.

impl From<CardConstraint> for PbConstraint

fn from(value: CardConstraint) -> Self

Converts to this type from the input type.

impl From<Clause> for CardConstraint

fn from(value: Clause) -> Self

Converts to this type from the input type.

impl Hash for CardConstraint

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<'slf> IntoIterator for &'slf CardConstraint

type Item = &'slf Lit

The type of the elements being iterated over.

type IntoIter = Iter<'slf, Lit>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'slf> IntoIterator for &'slf mut CardConstraint

type Item = &'slf mut Lit

The type of the elements being iterated over.

type IntoIter = IterMut<'slf, Lit>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq for CardConstraint

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

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for CardConstraint

impl StructuralPartialEq for CardConstraint