Struct gut::interval::ClosedInterval

pub struct ClosedInterval<T> {
    pub a: T,
    pub b: T,
}

Interval from a to b that contains both endponts, where a < b on the floating point line.

Fields

a: T

The lower limit of the interval

b: T

The upper limit of the interval

Implementations

impl<T: PartialOrd + PartialEq + Copy> ClosedInterval<T>

pub fn new(a: T, b: T) -> ClosedInterval<T>

pub fn is_singleton(&self) -> bool

Check if this interval contains just one point

pub fn endpoint(&self, which: EndPoint) -> T

impl<T: Sub<Output = T> + Copy + PartialOrd> ClosedInterval<T>

pub fn length(&self) -> T

Trait Implementations

impl<T: Float> Absorb<ClosedInterval<T>> for ClosedInterval<T>

type Output = Self

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

Absorb another object. For example if a = [-1, 2] and b = [3, 4] is are closed intervals, then a.absorb(b) == [-1 4].

impl<T: Float> Absorb<T> for ClosedInterval<T>

type Output = Self

fn absorb(self, x: T) -> Self

Absorb another object. For example if a = [-1, 2] and b = [3, 4] is are closed intervals, then a.absorb(b) == [-1 4].

impl<T: Float> Centroid<Option<T>> for ClosedInterval<T>

fn centroid(self) -> Option<T>

Compute the centroid of the object.

impl<T: Clone> Clone for ClosedInterval<T>

fn clone(&self) -> ClosedInterval<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: PartialOrd> Contains<T> for ClosedInterval<T>

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

Check if this object contains another.

impl<T: Copy> Copy for ClosedInterval<T>

impl<T: Debug> Debug for ClosedInterval<T>

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

Formats the value using the given formatter.

impl<T: Float> Default for ClosedInterval<T>

fn default() -> Self

Create an empty interval. The choice of enpoints here is arbitrary as long as b < a.

impl<T: Float> Empty for ClosedInterval<T>

fn empty() -> Self

Construct an empty object.

fn is_empty(&self) -> bool

Check if this object is empty.

impl<T: Eq> Eq for ClosedInterval<T>

impl<T: Hash> Hash for ClosedInterval<T>

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

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

impl<T: Float> Intersect<ClosedInterval<T>> for ClosedInterval<T>

type Output = Self

fn intersect(self, interval: Self) -> Self

Intersect on one object with another, producing the resulting intersection. For example if [-1, 2] and [0, 4] are two closed intervals, then their intersection is a closed interval [0, 2]. Note that the intersection object can be of a different type

fn intersects(self, interval: Self) -> bool

Check if this object intersects another.

impl<T: PartialEq> PartialEq<ClosedInterval<T>> for ClosedInterval<T>

fn eq(&self, other: &ClosedInterval<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &ClosedInterval<T>) -> bool

This method tests for !=.

impl<T> StructuralEq for ClosedInterval<T>

impl<T> StructuralPartialEq for ClosedInterval<T>