pub struct Interval<T>(pub T, pub T);
Expand description
An interval implementing interval arithmetic.
Tuple Fields§
§0: T
§1: T
Implementations§
source§impl<T> Interval<T>
impl<T> Interval<T>
sourcepub fn sort(a: T, b: T) -> Selfwhere
T: PartialOrd,
pub fn sort(a: T, b: T) -> Selfwhere
T: PartialOrd,
Create the interval [min(a, b), max(a, b)]
.
sourcepub fn contains(&self, t: T) -> boolwhere
T: PartialOrd<T>,
pub fn contains(&self, t: T) -> boolwhere
T: PartialOrd<T>,
Does this interval contain the given value?
sourcepub fn enclose(self, t: T) -> Selfwhere
T: PartialOrd,
pub fn enclose(self, t: T) -> Selfwhere
T: PartialOrd,
Computes a new interval that contains both self
and t
.
sourcepub fn intersect(self, rhs: Self) -> Option<Self>where
T: PartialOrd + SimdPartialOrd,
pub fn intersect(self, rhs: Self) -> Option<Self>where
T: PartialOrd + SimdPartialOrd,
Computes the intersection between two intervals.
Returns None
if the intervals are disjoint.
sourcepub fn sin_cos(self) -> (Self, Self)
pub fn sin_cos(self) -> (Self, Self)
Bounds the image of thesin
and cos
functions on this interval.
Trait Implementations§
source§impl<T: Copy + Add<T, Output = T>> AddAssign for Interval<T>
impl<T: Copy + Add<T, Output = T>> AddAssign for Interval<T>
source§fn add_assign(&mut self, rhs: Interval<T>)
fn add_assign(&mut self, rhs: Interval<T>)
Performs the
+=
operation. Read moresource§impl<T> MulAssign for Interval<T>
impl<T> MulAssign for Interval<T>
source§fn mul_assign(&mut self, rhs: Interval<T>)
fn mul_assign(&mut self, rhs: Interval<T>)
Performs the
*=
operation. Read moresource§impl<T: PartialEq> PartialEq for Interval<T>
impl<T: PartialEq> PartialEq for Interval<T>
source§impl<T: Copy + Sub<T, Output = T>> SubAssign for Interval<T>
impl<T: Copy + Sub<T, Output = T>> SubAssign for Interval<T>
source§fn sub_assign(&mut self, rhs: Interval<T>)
fn sub_assign(&mut self, rhs: Interval<T>)
Performs the
-=
operation. Read moreimpl<T: Copy> Copy for Interval<T>
impl<T: Eq> Eq for Interval<T>
impl<T> StructuralPartialEq for Interval<T>
Auto Trait Implementations§
impl<T> Freeze for Interval<T>where
T: Freeze,
impl<T> RefUnwindSafe for Interval<T>where
T: RefUnwindSafe,
impl<T> Send for Interval<T>where
T: Send,
impl<T> Sync for Interval<T>where
T: Sync,
impl<T> Unpin for Interval<T>where
T: Unpin,
impl<T> UnwindSafe for Interval<T>where
T: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Convert
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
.source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read moresource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.