Struct ArchivedRangeTo

pub struct ArchivedRangeTo<T> {
    pub end: T,
}

An archived RangeTo.

Fields

end: T

The upper bound of the range (exclusive).

Implementations

impl<T: PartialOrd<T>> ArchivedRangeTo<T>

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

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

Returns true if item is contained in the range.

Trait Implementations

impl<__C: ?Sized, T> CheckBytes<__C> for ArchivedRangeTo<T>

where T: CheckBytes<__C>,

type Error = StructCheckError

The error that may result from checking the type.

unsafe fn check_bytes<'__bytecheck>( value: *const Self, context: &mut __C, ) -> Result<&'__bytecheck Self, StructCheckError>

Checks whether the given pointer points to a valid value within the given context.

impl<T: Clone> Clone for ArchivedRangeTo<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for ArchivedRangeTo<T>

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

Formats the value using the given formatter.

impl<T: Default> Default for ArchivedRangeTo<T>

fn default() -> ArchivedRangeTo<T>

Returns the “default value” for a type.

impl<T: Hash> Hash for ArchivedRangeTo<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<RangeTo<T>> for ArchivedRangeTo<U>

fn eq(&self, other: &RangeTo<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 ArchivedRangeTo<T>

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

impl<T> StructuralPartialEq for ArchivedRangeTo<T>