Struct IntVar 

pub struct IntVar<'model> { /* private fields */ }

An integer decision variable belonging to a Model.

IntVar represents a domain of possible integer values and provides accessors, views, arithmetic constraints, and reification helpers. Instances are tied to the lifetime of their owning model.

Implementations

impl<'model> IntVar<'model>

pub fn lb(&self) -> i32

pub fn ub(&self) -> i32

pub fn value(&self) -> Option<i32>

pub fn has_enumerated_domain(&self) -> bool

pub fn get_domain_values(&self) -> Option<Vec<i32>>

pub fn eq_view(&self, value: i32) -> BoolVar<'model>

Creates a boolean view representing the equality of the integer variable to a given value.

pub fn ge_view(&self, value: i32) -> BoolVar<'model>

Creates a boolean view representing the “greater than or equal to” relation of the integer variable to a given value.

pub fn le_view(&self, value: i32) -> BoolVar<'model>

Creates a boolean view representing the “less than or equal to” relation of the integer variable to a given value.

pub fn ne_view(&self, value: i32) -> BoolVar<'model>

Creates a boolean view representing the “not equal to” relation of the integer variable to a given value.

pub fn arithm<'a, 'b, OP, Y>(&'b self, op: OP, y: Y) -> Constraint<'model>

where (&'a IntVar<'model>, OP, Y): ConstraintArithmT<'model>, Y: 'b, 'model: 'a + 'b, 'b: 'a,

pub fn arithm2<OP, Y, OP2, Z>( &self, op: OP, y: Y, op2: OP2, z: Z, ) -> Constraint<'model>

where for<'a> (&'a IntVar<'model>, OP, Y, OP2, Z): ConstraintArithmT<'model>,

Creates a two-operator arithmetic constraint associated with this model.

pub fn reify_eq_y<'a>( &self, y: impl Into<IntOrIntVar<'a, 'model>>, b: &BoolVar<'model>, )

where 'model: 'a,

Posts a constraint that expresses: (self = y) <=> (b = true) This bypass reification system.

pub fn reify_ne_y<'a>( &self, y: impl Into<IntOrIntVar<'a, 'model>>, b: &BoolVar<'model>, )

where 'model: 'a,

Posts a constraint that expresses: (self != y) <=> (b = true) This bypass reification system.

pub fn reify_lt_y<'a>( &self, y: impl Into<IntOrIntVar<'a, 'model>>, b: &BoolVar<'model>, )

where 'model: 'a,

Posts a constraint that expresses: (self < y) <=> (b = true) This bypass reification system.

pub fn reify_gt_y<'a>( &self, y: impl Into<IntOrIntVar<'a, 'model>>, b: &BoolVar<'model>, )

where 'model: 'a,

Posts a constraint that expresses: (self > y) <=> (b = true) This bypass reification system.

pub fn reify_le_y<'a>( &self, y: impl Into<IntOrIntVar<'a, 'model>>, b: &BoolVar<'model>, )

where 'model: 'a,

Posts a constraint that expresses: (self <= y) <=> (b = true) This bypass reification system.

pub fn reify_ge_y<'a>( &self, y: impl Into<IntOrIntVar<'a, 'model>>, b: &BoolVar<'model>, )

where 'model: 'a,

Posts a constraint that expresses: (self >= y) <=> (b = true) This bypass reification system.

pub fn reify_eq_yc(&self, y: &IntVar<'model>, c: i32, b: &BoolVar<'model>)

Posts a constraint that expresses : (self = y + c) <=> (b is true). This bypass reification system.

pub fn reify_ne_yc(&self, y: &IntVar<'model>, c: i32, b: &BoolVar<'model>)

Posts a constraint that expresses : (self != y + c) <=> (b is true). This bypass reification system.

pub fn reify_lt_yc(&self, y: &IntVar<'model>, c: i32, b: &BoolVar<'model>)

Posts a constraint that expresses : (self < y + c) <=> b. This bypass reification system.

pub fn reify_gt_yc(&self, y: &IntVar<'model>, c: i32, b: &BoolVar<'model>)

Posts a constraint that expresses : (self > y + c) <=> b. This bypass reification system.

pub fn member_table(&self, table: &[i32]) -> Constraint<'model>

Creates a member constraint. Ensures self takes its values in table.

pub fn member_bounds(&self, lb: i32, ub: i32) -> Constraint<'model>

Creates a member constraint. Ensures self takes its values in [lb, ub].

pub fn not_member_table(&self, table: &[i32]) -> Constraint<'model>

Create not a member constraint. Ensures self does not take its values in table.

pub fn not_member_bounds(&self, lb: i32, ub: i32) -> Constraint<'model>

Create not a member constraint. Ensures self does not take its values in [lb, ub].

pub fn abs(&self, y: &IntVar<'model>) -> Constraint<'model>

Creates an absolute value constraint: self = | y |

pub fn square(&self, y: &IntVar<'model>) -> Constraint<'model>

Creates a square constraint: self = y^2.

pub fn pow(&self, c: i32, y: &IntVar<'model>) -> Constraint<'model>

Creates a power constraint: self^c = y

pub fn max(&self, intvars: &[&IntVar<'model>]) -> Constraint<'model>

Creates a maximum constraint, self is the maximum value among IntVars in intvars.

pub fn min(&self, intvars: &[&IntVar<'model>]) -> Constraint<'model>

Creates a minimum constraint, self is the minimum value among IntVars in intvars.

pub fn among( &self, intvars: &[&IntVar<'model>], values: &[i32], ) -> Constraint<'model>

Creates an among constraint. self is the number of variables of the collection intvars that take their value in values.

Propagator :

C. Bessiere, E. Hebrard, B. Hnich, Z. Kiziltan, T. Walsh, Among, common and disjoint Constraints CP-2005

Trait Implementations

impl<'model> Add<&IntVar<'model>> for &IntVar<'model>

type Output = IntVar<'model>

The resulting type after applying the + operator.

fn add(self, rhs: &IntVar<'model>) -> IntVar<'model>

Performs the + operation.

impl<'model> Add<i32> for &IntVar<'model>

type Output = IntVar<'model>

The resulting type after applying the + operator.

fn add(self, rhs: i32) -> IntVar<'model>

Performs the + operation.

impl<'model> ArithmConstraint<'model, &IntVar<'model>, &IntVar<'model>> for IntVar<'model>

fn modulo( &'model self, modulo: &IntVar<'model>, res: &IntVar<'model>, ) -> Constraint<'model>

Creates a modulo constraint: self % modulo = res.

impl<'model> ArithmConstraint<'model, i32, &IntVar<'model>> for IntVar<'model>

fn modulo(&'model self, modulo: i32, res: &IntVar<'model>) -> Constraint<'model>

Creates a modulo constraint: self % modulo = res.

impl<'model> ArithmConstraint<'model, i32, i32> for IntVar<'model>

fn modulo(&'model self, modulo: i32, res: i32) -> Constraint<'model>

Creates a modulo constraint: self % modulo = res.

impl<'model> Borrow<IntVar<'model>> for BoolVar<'model>

fn borrow(&self) -> &IntVar<'model>

Immutably borrows from an owned value.

impl Debug for IntVar<'_>

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

Formats the value using the given formatter.

impl Display for IntVar<'_>

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

Formats the value using the given formatter.

impl<'model> Div<&IntVar<'model>> for &IntVar<'model>

type Output = IntVar<'model>

The resulting type after applying the / operator.

fn div(self, rhs: &IntVar<'model>) -> IntVar<'model>

Performs the / operation.

impl<'model> Div<i32> for &IntVar<'model>

type Output = IntVar<'model>

The resulting type after applying the / operator.

fn div(self, rhs: i32) -> IntVar<'model>

Performs the / operation.

impl<'model> From<BoolVar<'model>> for IntVar<'model>

fn from(bool_var: BoolVar<'model>) -> Self

Converts to this type from the input type.

impl<'model> Mul<&IntVar<'model>> for &IntVar<'model>

type Output = IntVar<'model>

The resulting type after applying the * operator.

fn mul(self, rhs: &IntVar<'model>) -> IntVar<'model>

Performs the * operation.

impl<'model> Mul<i32> for &IntVar<'model>

type Output = IntVar<'model>

The resulting type after applying the * operator.

fn mul(self, rhs: i32) -> IntVar<'model>

Performs the * operation.

impl<'model> Neg for &IntVar<'model>

type Output = IntVar<'model>

The resulting type after applying the - operator.

fn neg(self) -> IntVar<'model>

Performs the unary - operation.

impl<'model> Rem<&IntVar<'model>> for &IntVar<'model>

type Output = IntVar<'model>

The resulting type after applying the % operator.

fn rem(self, rhs: &IntVar<'model>) -> IntVar<'model>

Performs the % operation.

impl<'model> Rem<i32> for &IntVar<'model>

type Output = IntVar<'model>

The resulting type after applying the % operator.

fn rem(self, rhs: i32) -> IntVar<'model>

Performs the % operation.

impl<'model> Sub<&IntVar<'model>> for &IntVar<'model>

type Output = IntVar<'model>

The resulting type after applying the - operator.

fn sub(self, rhs: &IntVar<'model>) -> IntVar<'model>

Performs the - operation.

impl<'model> Sub<i32> for &IntVar<'model>

type Output = IntVar<'model>

The resulting type after applying the - operator.

fn sub(self, rhs: i32) -> IntVar<'model>

Performs the - operation.

impl<'model> TryFrom<IntVar<'model>> for BoolVar<'model>

type Error = SolverError

The type returned in the event of a conversion error.

fn try_from(int_var: IntVar<'model>) -> Result<Self, Self::Error>

Performs the conversion.