Struct LinearCombination 

pub struct LinearCombination {
    pub terms: Vec<(u64, usize)>,
}

A linear combination of variables: sum of (coefficient, variable_index) pairs. The constant term uses index usize::MAX as a sentinel for the “one” variable.

Fields

terms: Vec<(u64, usize)>

Implementations

impl LinearCombination

pub fn zero() -> Self

Create an empty linear combination.

pub fn from_variable(var: Variable) -> Self

Create a linear combination with a single variable.

pub fn constant(value: u64) -> Self

Create a constant linear combination.

pub fn add_term(&mut self, coeff: u64, var_index: usize)

Add a term.

pub fn evaluate(&self, vars: &[u64]) -> Result<u64>

Evaluate the linear combination given variable assignments. vars[i] = value of variable i. The “one” variable (index MAX) = 1.

Trait Implementations

impl Clone for LinearCombination

fn clone(&self) -> LinearCombination

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for LinearCombination

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for LinearCombination

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for LinearCombination

impl PartialEq for LinearCombination

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

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for LinearCombination