Struct CountRange 

pub struct CountRange<T> { /* private fields */ }

Inclusive count range with optional upper bound.

Implementations

impl<T: Copy + Ord> CountRange<T>

pub const fn unbounded_from(min: T) -> Self

Return an inclusive range with no upper bound.

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

Build a validated inclusive range.

Returns None when max is present and min > max.

pub const fn min(self) -> T

Return the inclusive lower endpoint.

pub const fn max(self) -> Option<T>

Return the inclusive upper endpoint, if present.

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

Return true when value is inside this range.

pub fn contains_range(self, sub: Self) -> bool

Return true when sub is wholly contained by this range.

Trait Implementations

impl<T: Clone> Clone for CountRange<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for CountRange<T>

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

Formats the value using the given formatter.

impl<T: PartialEq> PartialEq for CountRange<T>

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

impl<T: Eq> Eq for CountRange<T>

impl<T> StructuralPartialEq for CountRange<T>