Struct dumbmath::range::InclusiveRange

pub struct InclusiveRange<T: Copy + PartialOrd + Sub> {
    pub min: T,
    pub max: T,
}

Inclusive range from min to max

Fields

min: T

max: T

Implementations

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

pub fn new(min: T, max: T) -> InclusiveRange<T>

Create an InclusiveRange from min to max. Asserts that min is less than max.

pub fn from_sorting(a: T, b: T) -> InclusiveRange<T>

Create an InclusiveRange by sorting the inputs.

pub fn empty(self) -> bool

True if min == max, false otherwise.

pub fn length(self) -> T

Distance between self.min and self.max

pub fn expand(&mut self, other: InclusiveRange<T>)

Expand self as needed to include another range.

Trait Implementations

impl<T: Clone + Copy + PartialOrd + Sub> Clone for InclusiveRange<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug + Copy + PartialOrd + Sub> Debug for InclusiveRange<T>

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

Formats the value using the given formatter.

impl<T: PartialEq + Copy + PartialOrd + Sub> PartialEq for InclusiveRange<T>

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

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

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: Copy + Copy + PartialOrd + Sub> Copy for InclusiveRange<T>

impl<T: Copy + PartialOrd + Sub> StructuralPartialEq for InclusiveRange<T>