Type Alias inter_val::LeftBounded

pub type LeftBounded<T, B> = HalfBounded<T, B, Left>;

Aliased Type

struct LeftBounded<T, B>(/* private fields */);

Implementations

impl<T: PartialOrd, B: BoundaryOf<Left>> LeftBounded<T, B>

pub fn includes(&self, other: &Self) -> bool

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

pub fn intersection<'a>(&'a self, other: &'a Self) -> &'a Self

pub fn union<'a>(&'a self, other: &'a Self) -> &'a Self

pub fn hull(self, t: T) -> Self

pub fn dilate(self, delta: T) -> Self

where T: Sub<Output = T>,

pub fn inf(&self) -> &T

pub fn closure(self) -> LeftBounded<T, Inclusive>

pub fn interior(self) -> LeftBounded<T, Exclusive>

pub fn ceil(&self) -> T

where Bound<T, B>: Ceil<T>,

use inter_val::{LeftBounded, Inclusive, Exclusive};
let a: LeftBounded<_, _> = Inclusive.at(4).into();
let b: LeftBounded<_, _> = Exclusive.at(4).into();
let c: LeftBounded<_, _> = Inclusive.at(1.23).into();
assert_eq!(a.ceil(), 4);
assert_eq!(b.ceil(), 5);
assert_eq!(c.ceil(), 2.0);

Trait Implementations

impl<T: PartialOrd> RangeBounds<T> for LeftBounded<T, Exclusive>

fn start_bound(&self) -> Bound<&T>

Start index bound.

fn end_bound(&self) -> Bound<&T>

End index bound.

fn contains<U>(&self, item: &U) -> bool

where T: PartialOrd<U>, U: PartialOrd<T> + ?Sized,

Returns true if item is contained in the range.

impl<T: PartialOrd> RangeBounds<T> for LeftBounded<T, Inclusive>

fn start_bound(&self) -> Bound<&T>

Start index bound.

fn end_bound(&self) -> Bound<&T>

End index bound.

fn contains<U>(&self, item: &U) -> bool

where T: PartialOrd<U>, U: PartialOrd<T> + ?Sized,

Returns true if item is contained in the range.