Struct Interval 

pub struct Interval {
    lb: IntervalBoundary,
    lb_open: bool,
    ub: IntervalBoundary,
    ub_open: bool,
}

Interval

Fields

lb: IntervalBoundary

Lower / left boundary of the interval

lb_open: bool

Lower / left boundary of the interval is open / closed

ub: IntervalBoundary

Upper / right boundary of the interval

ub_open: bool

Upper / right boundary of the interval is open / closed

Implementations

impl Interval

pub fn new( lb: IntervalBoundary, lb_open: bool, ub: IntervalBoundary, ub_open: bool, ) -> Self

Create a new interval

pub fn is_left_open(&self) -> bool

Check if the interval is left open, i.e., the lower boundary is not included

pub fn is_right_open(&self) -> bool

Check if the interval is right open, i.e., the upper boundary is not included

pub fn lb(&self) -> &IntervalBoundary

Returns the left IntervalBoundary

pub fn ub(&self) -> &IntervalBoundary

Returns the right IntervalBoundary

pub fn zero() -> Self

Return the interval [0, 1[

pub fn new_constant<T: Into<Fraction>, U: Into<Fraction>>( c_lower_bound: T, c_upper_bound: U, ) -> Self

Create a new interval of the form [ c_lower_bound, c_upper_bound [ where c_lower_bound and c_upper_bound are constants

pub fn check_is_contained(&self, ib: &IntervalBoundary) -> bool

Check if the given interval boundary is contained in the interval

This method does not do any mathematical / symbolical checks to determine if the interval boundary is contained in the interval. It only checks if the one of the boundaries of the interval is equal to the given interval boundary and that this boundary is not open.

pub fn check_add_always_out_of_interval(&self, c: u32) -> bool

Checks whether an addition of c to the interval must always leave the interval

This function will first check whether both intervals are constants, if this is not the case, it returns false, as we cannot statically determine the size of the interval. If both are constant, it will check whether adding c to the lower bound will be sufficient to move past the upper bound.

pub fn check_sub_always_out_of_interval(&self, c: u32) -> bool

Checks whether an addition of c from the interval must always leave the interval

This function will first check whether both intervals are constants, if this is not the case, it returns false, as we cannot statically determine the size of the interval. If both are constant, it will check whether subtracting c from the upper bound will be sufficient to move below the lower bound.

pub fn encode_into_boolean_expr<S, T>(&self, var: &S) -> BooleanExpression<T>

where S: IntoNoDivBooleanExpr<T> + Clone, T: Atomic,

Encode the interval as a boolean expression on a variable

This method encodes the interval as a boolean expression on a variable var. The boolean expression is true if the variable is in the interval and false otherwise.

Trait Implementations

impl Clone for Interval

fn clone(&self) -> Interval

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Interval

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

Formats the value using the given formatter.

impl Display for Interval

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

Formats the value using the given formatter.

impl Hash for Interval

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for Interval

fn cmp(&self, other: &Interval) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for Interval

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

fn partial_cmp(&self, other: &Interval) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Eq for Interval

impl StructuralPartialEq for Interval