Type Alias inter_val::RightBounded

pub type RightBounded<T, B> = HalfBounded<T, B, Right>;

Aliased Type

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

Implementations

impl<T: PartialOrd, B: BoundaryOf<Right>> RightBounded<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: Add<Output = T>,

pub fn sup(&self) -> &T

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

pub fn floor(&self) -> T

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

use inter_val::{RightBounded, Inclusive, Exclusive};
let a : RightBounded<_, _> = Inclusive.at(7).into();
let b : RightBounded<_, _> = Exclusive.at(7).into();
let c : RightBounded<_, _> = Inclusive.at(4.56).into();
assert_eq!(a.floor(), 7);
assert_eq!(b.floor(), 6);
assert_eq!(c.floor(), 4.0);

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

Trait Implementations

impl<T: PartialOrd> RangeBounds<T> for RightBounded<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 RightBounded<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.