Struct Range 

pub struct Range<T> {
    pub start: T,
    pub end: T,
}

A 1D range. Internally represented as start and end. (as opposed to a start and length) If range A contains value x and range B contains value x, then A intersects B. There is no protection against “degenerate” Ranges where start>end.

A point is consindered inside of a range if the point is in [start,end].

Fields

start: T

end: T

Implementations

impl<T> Range<T>

pub fn new(start: T, end: T) -> Range<T>

impl<T> Range<T>

where T: Copy + Ord + Sub<Output = T> + Signed,

pub fn distance_to_point(&self, pos: T) -> Option<T>

pub fn difference_to_point(&self, pos: T) -> Option<T>

Positive if point is to the right of the range. Negative if point is to the left of range.

impl<T> Range<T>

where T: Copy + PartialOrd,

pub fn contains_ext(&self, pos: T) -> Ordering

Like contains() but returns Ord. If the pos is strictly less than the range.start, return less. If the pos is greater of equal to the range.end, return greater. else, return equal.

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

Returns true if the point is inside of the range or on top of.

pub fn subdivide(&self, divider: T) -> (Range<T>, Range<T>)

Subdivides the range. No floating point calculations are done.

pub fn is_valid(&self) -> bool

pub fn grow_to_fit(&mut self, b: &Range<T>)

pub fn contains_range(&self, val: &Range<T>) -> bool

Returns true if self contains the specified range.

pub fn intersects(&self, val: &Range<T>) -> bool

Returns true if two ranges intersect.

impl<T> Range<T>

where T: Copy + Sub<Output = T>,

pub fn distance(&self) -> T

impl<T> Range<T>

where T: Sub<Output = T> + Add<Output = T> + Copy,

pub fn grow(self, radius: T) -> Range<T>

impl<S> Range<S>

pub fn inner_as<B>(self) -> Range<B>

where B: 'static + Copy, S: AsPrimitive<B>,

pub fn inner_into<A>(self) -> Range<A>

where S: Into<A>,

pub fn inner_try_into<A>(self) -> Result<Range<A>, <S as TryInto<A>>::Error>

where S: TryInto<A>,

impl<T> Range<T>

where T: Sub<Output = T> + Add<Output = T> + Copy,

pub fn from_point(point: T, radius: T) -> Range<T>

Create a range from a point and radius.

impl<T> Range<T>

where T: Copy + Ord,

pub fn get_intersection(&self, val: &Range<T>) -> Option<Range<T>>

Creates a range that represents the intersection range.

Trait Implementations

impl<T> Clone for Range<T>

where T: Clone,

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T> Debug for Range<T>

where T: Debug,

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

Formats the value using the given formatter.

impl<T> Default for Range<T>

where T: Default,

fn default() -> Range<T>

Returns the “default value” for a type.

impl<B> From<[B; 2]> for Range<B>

fn from(a: [B; 2]) -> Range<B>

Converts to this type from the input type.

impl<T> Hash for Range<T>

where T: Hash,

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

where __H: Hasher,

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 for Range<T>

where T: PartialEq,

fn eq(&self, other: &Range<T>) -> 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 for Range<T>

where T: Copy,

impl<T> Eq for Range<T>

where T: Eq,

impl<T> StructuralPartialEq for Range<T>