Struct Constraint 

pub struct Constraint {
    pub name: SmolStr,
    pub lhs: ExprId,
    pub lower: f64,
    pub upper: f64,
    pub active: bool,
}

A single algebraic constraint, canonicalized as the interval lower <= lhs <= upper with numeric bounds. RHS expressions are folded into lhs during construction, so backends only ever see this canonical shape.

The single-sided senses map onto the interval as Le(rhs) => [-inf, rhs], Ge(rhs) => [rhs, +inf], Eq(rhs) => [rhs, rhs]. A two-sided range with constant bounds is [lo, hi]. Use Constraint::as_single to recover the single-sided sense (for backends without native two-sided rows) and Constraint::is_range to detect a genuine range.

Fields

name: SmolStr

lhs: ExprId

lower: f64

upper: f64

active: bool

Implementations

impl Constraint

pub fn is_range(&self) -> bool

Whether this is a genuine two-sided range (both bounds finite and not an equality), as opposed to a single-sided Le/Ge/Eq row. An inverted [hi, lo] (lo > hi, an infeasible user range) is also a range, so the solver reports the infeasibility rather than it collapsing to an equality.

pub fn as_single(&self) -> Option<(Sense, f64)>

Recover the single-sided (sense, rhs) view, or None for a genuine range (or an unconstrained [-inf, +inf] row). Backends and writers without native two-sided rows branch on this.

Trait Implementations

impl Clone for Constraint

fn clone(&self) -> Constraint

Returns a duplicate 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.