Struct LinearInequality 

pub struct LinearInequality { /* private fields */ }

The linear inequality part of a hypercube linear constraint.

Implementations

impl LinearInequality

pub fn trivially_false() -> LinearInequality

Create a linear inequality that is trivially false.

pub fn new( terms: impl IntoIterator<Item = (NonZero<i32>, DomainId)>, bound: i32, ) -> Option<LinearInequality>

Construct a new linear inequality.

If the terms simplify to 0 and the bound is at least 0, then None is returned.

pub fn terms(&self) -> impl Iterator<Item = AffineView<DomainId>>

Iterate over the terms in the linear inequality.

pub fn bound(&self) -> i32

The bound of the linear inequality.

pub fn is_trivially_false(&self) -> bool

Tests whether the left-hand side simplifies to 0 and the right-hand side is less than 0.

pub fn term_for_domain(&self, domain: DomainId) -> Option<AffineView<DomainId>>

Get the term for the given domain.

Trait Implementations

impl Clone for LinearInequality

fn clone(&self) -> LinearInequality

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for LinearInequality

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

Formats the value using the given formatter.