Struct ArchivedRangeInclusive

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

An archived RangeInclusive.

Fields

start: T

The lower bound of the range (inclusive).

end: T

The upper bound of the range (inclusive).

Implementations

impl<T: PartialOrd<T>> ArchivedRangeInclusive<T>

pub fn contains<U>(&self, item: &U) -> bool

where T: PartialOrd<U>, U: PartialOrd<T> + ?Sized,

Returns true if item is contained in the range.

pub fn is_empty(&self) -> bool

Returns true if the range contains no items.

Trait Implementations

impl<T: Clone> Clone for ArchivedRangeInclusive<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for ArchivedRangeInclusive<T>

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

Formats the value using the given formatter.

impl<T: Default> Default for ArchivedRangeInclusive<T>

fn default() -> ArchivedRangeInclusive<T>

Returns the “default value” for a type.

impl<T: Hash> Hash for ArchivedRangeInclusive<T>

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

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, U: PartialEq<T>> PartialEq<RangeInclusive<T>> for ArchivedRangeInclusive<U>

fn eq(&self, other: &RangeInclusive<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: PartialEq> PartialEq for ArchivedRangeInclusive<T>

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

fn start_bound(&self) -> Bound<&T>

Start index bound.

fn end_bound(&self) -> Bound<&T>

End index bound.

fn contains<U>(&self, item: &U) -> bool

where T: PartialOrd<U>, U: PartialOrd<T> + ?Sized,

Returns true if item is contained in the range.

impl<T: Eq> Eq for ArchivedRangeInclusive<T>

impl<T> StructuralPartialEq for ArchivedRangeInclusive<T>