Struct Interval

pub struct Interval<T: Num, U: Num> { /* private fields */ }

Interval struct that contains a lowerbound, upperbound and value/count of the range within the interval. These can be aggregated together using intervalues::combine_intervals().

Examples

use intervalues::Interval;

let x = Interval::new(0, 1, 2.5);
assert_eq!(x.get_lb(), 0);
assert_eq!(x.get_ub(), 1);
assert_eq!(x.get_value(), 2.5);

Implementations

impl<T, U> Interval<T, U>

where T: Num + PartialOrd + Clone + Display, U: Num + PartialOrd + Display,

pub fn new(lb: T, ub: T, val: U) -> Self

pub fn print(&self) -> String

pub fn to_tuple(self) -> (T, T, U)

pub fn get_bounds(self) -> (T, T)

pub fn get_lb(self) -> T

pub fn get_ub(self) -> T

pub fn get_width(self) -> T

pub fn get_value(self) -> U

pub fn len(self) -> T

pub fn contains(self, num: T) -> bool

pub fn superset(self, other: Interval<T, U>) -> bool

pub fn subset(self, other: Interval<T, U>) -> bool

pub fn left_overlaps(&self, other: &Interval<T, U>) -> bool

pub fn right_overlaps(self, other: &Interval<T, U>) -> bool

pub fn overlaps(self, other: &Interval<T, U>) -> bool

pub fn can_join(self, other: &Interval<T, U>) -> bool

pub fn join(self, other: Interval<T, U>) -> Interval<T, U>

pub fn can_join_as_set(self, other: &Interval<T, U>) -> bool

pub fn join_ign_value(self, other: Interval<T, U>) -> Interval<T, U>

pub fn join_as_set(self, other: Interval<T, U>) -> BaseInterval<T>

pub fn to_base(self) -> BaseInterval<T>

impl<T> Interval<T, T>

where T: Num,

pub fn get_total_value(self) -> T

impl<T, U> Interval<T, U>

where T: Num + Clone + PartialOrd + Display, U: Num + PartialOrd + ToPrimitive,

pub fn val_to_count(self) -> Interval<T, usize>

impl Interval<IntFloat, IntFloat>

pub fn to_f32(self) -> (f32, f32, f32)

impl Interval<Decimal, Decimal>

pub fn to_f32(self) -> (f32, f32, f32)

Trait Implementations

impl<T: Clone + Num, U: Clone + Num> Clone for Interval<T, U>

fn clone(&self) -> Interval<T, U>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T, U> Debug for Interval<T, U>

where T: Num + PartialOrd + Clone + Display, U: Num + PartialOrd + Display,

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

Formats the value using the given formatter.

impl<T, U> Default for Interval<T, U>

where T: Num + PartialOrd + Clone, U: Num,

fn default() -> Self

Returns the “default value” for a type.

impl<T, U> Display for Interval<T, U>

where T: Num + PartialOrd + Clone + Display, U: Num + PartialOrd + Display,

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

Formats the value using the given formatter.

impl<T: Hash + Num, U: Hash + Num> Hash for Interval<T, U>

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<T: PartialEq + Num, U: PartialEq + Num> PartialEq for Interval<T, U>

fn eq(&self, other: &Interval<T, U>) -> 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<T: Copy + Num, U: Copy + Num> Copy for Interval<T, U>

impl<T: Eq + Num, U: Eq + Num> Eq for Interval<T, U>

impl<T: Num, U: Num> StructuralPartialEq for Interval<T, U>