Struct IntExpr 

pub struct IntExpr {
    pub constant: i64,
    pub coeffs: BTreeMap<i64, i64>,
}

Integer linear expression of the form c + a₁x₁ + a₂x₂ + … + aₙxₙ.

Similar to crate::lia::LinearExpr but uses integer coefficients instead of rationals for exact integer arithmetic.

Fields

constant: i64

The constant term c.

coeffs: BTreeMap<i64, i64>

Maps variable index to its integer coefficient (sparse representation).

Implementations

impl IntExpr

pub fn constant(c: i64) -> Self

Create a constant expression

pub fn var(idx: i64) -> Self

Create a single variable expression: 1*x_idx + 0

pub fn add(&self, other: &Self) -> Self

Add two expressions

pub fn neg(&self) -> Self

Negate an expression

pub fn sub(&self, other: &Self) -> Self

Subtract two expressions

pub fn scale(&self, k: i64) -> Self

Scale by an integer constant

pub fn is_constant(&self) -> bool

Check if this is a constant expression (no variables)

pub fn get_coeff(&self, var: i64) -> i64

Get coefficient of a variable (0 if not present)

Trait Implementations

impl Clone for IntExpr

fn clone(&self) -> IntExpr

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for IntExpr

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

Formats the value using the given formatter.

impl PartialEq for IntExpr

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

impl StructuralPartialEq for IntExpr