Struct AtLeast

pub struct AtLeast {
    pub ids: Vec<u32>,
    pub bias: i64,
    pub sign: Sign,
}

Data structure for representing an at least constraint on form $$ c * v_0 + c * v_1 + … + c * v_n + bias \ge 0 $$ where $c=1$ if sign == Sign::Positive, or, $c=-1$ if sign == Sign::Negative. ids vector property holds what variables are connected to this constraint.

Fields

ids: Vec<u32>

bias: i64

sign: Sign

Implementations

impl AtLeast

pub fn to_lineq( &self, id: Option<u32>, variable_hm: &HashMap<u32, Variable>, ) -> GeLineq

Transform into a linear inequality constraint. variable_hm is a hash map of id’s and variables.

Example:

use puanrs::AtLeast;
use puanrs::Sign;
use puanrs::polyopt::GeLineq;
use puanrs::polyopt::Variable;
use std::{collections::HashMap};
let at_least: AtLeast = AtLeast {
    ids     : vec![0,1,2],
    bias    : -1,
    sign    : Sign::Positive,
};
let mut variable_hm: HashMap<u32, Variable> = HashMap::default();
variable_hm.insert(0, Variable {id: 0, bounds: (0,1)});
variable_hm.insert(1, Variable {id: 1, bounds: (0,1)});
variable_hm.insert(2, Variable {id: 2, bounds: (0,1)});
let actual: GeLineq = at_least.to_lineq(None, &variable_hm);
assert_eq!(actual.coeffs, vec![1,1,1]);
assert_eq!(actual.bias, -1);
assert_eq!(actual.bounds, vec![(0,1),(0,1),(0,1)]);
assert_eq!(actual.indices, vec![0,1,2]);

Trait Implementations

impl Clone for AtLeast

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Display for AtLeast

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

Formats the value using the given formatter.