lp-types 0.0.0

Shared types definition for linear programming
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88

use crate::{utils::DisplayWrapper, LinearConstraint};
use std::fmt::{Debug, Display, Formatter};

mod convert;
mod display;

pub struct LinearVariable<T> {
    kind: LinearVariableKind,
    symbol: String,
    bound: LinearConstraint<T>,
}

#[derive(Debug)]
pub enum LinearVariableKind {
    Boolean,
    Decimal,
    Integer,
}

/// Create a new variable with constraints
impl<T> LinearVariable<T> {
    /// Creates a new variable with no constraints.
    pub fn new<S>(symbol: S) -> Self
    where
        S: Into<String>,
    {
        Self { kind: LinearVariableKind::Decimal, symbol: symbol.into(), bound: LinearConstraint::None }
    }
    /// Creates a new variable with the given lower bound.
    pub fn ge<S>(symbol: S, lower: T) -> Self
    where
        S: Into<String>,
    {
        Self { kind: LinearVariableKind::Decimal, symbol: symbol.into(), bound: LinearConstraint::ge(lower) }
    }
    /// Creates a new variable with the given lower bound.
    pub fn geq<S>(symbol: S, lower: T) -> Self
    where
        S: Into<String>,
    {
        Self { kind: LinearVariableKind::Decimal, symbol: symbol.into(), bound: LinearConstraint::geq(lower) }
    }
    /// Creates a new variable with the given upper bound.
    pub fn le<S>(symbol: S, upper: T) -> Self
    where
        S: Into<String>,
    {
        Self { kind: LinearVariableKind::Decimal, symbol: symbol.into(), bound: LinearConstraint::le(upper) }
    }
    /// Creates a new variable with the given upper bound.
    pub fn leq<S>(symbol: S, upper: T) -> Self
    where
        S: Into<String>,
    {
        Self { kind: LinearVariableKind::Decimal, symbol: symbol.into(), bound: LinearConstraint::leq(upper) }
    }
    /// Creates a new variable with the given lower and upper bounds.
    pub fn bounds<S>(symbol: S, bound: LinearConstraint<T>) -> Self
    where
        S: Into<String>,
    {
        Self { kind: LinearVariableKind::Decimal, symbol: symbol.into(), bound }
    }
}

impl<T> LinearVariable<T> {
    pub fn get_symbol(&self) -> &str {
        &self.symbol
    }
    pub fn get_kind(&self) -> &LinearVariableKind {
        &self.kind
    }

    pub fn set_kind(&mut self, kind: LinearVariableKind) {
        self.kind = kind;
    }

    pub fn with_kind(mut self, kind: LinearVariableKind) -> Self {
        self.kind = kind;
        self
    }
}

impl<T: PartialOrd> LinearVariable<T> {
    pub fn contains(&self, other: &T) -> bool {
        self.bound.contains(other)
    }
}