pub struct RangeToInclusive<Idx> {
pub end: Idx,
}
dep_bytemuck
only.Expand description
A range only bounded inclusively above (..=end
).
The RangeToInclusive
..=end
contains all values with x <= end
.
It cannot serve as an Iterator
because it doesn’t have a starting point.
§Examples
The ..=end
syntax is a RangeToInclusive
:
assert_eq!((..=5), std::ops::RangeToInclusive{ end: 5 });
It does not have an IntoIterator
implementation, so you can’t use it in a
for
loop directly. This won’t compile:
// error[E0277]: the trait bound `std::ops::RangeToInclusive<{integer}>:
// std::iter::Iterator` is not satisfied
for i in ..=5 {
// ...
}
When used as a slicing index, RangeToInclusive
produces a slice of all
array elements up to and including the index indicated by end
.
let arr = [0, 1, 2, 3, 4];
assert_eq!(arr[ .. ], [0, 1, 2, 3, 4]);
assert_eq!(arr[ .. 3], [0, 1, 2 ]);
assert_eq!(arr[ ..=3], [0, 1, 2, 3 ]); // This is a `RangeToInclusive`
assert_eq!(arr[1.. ], [ 1, 2, 3, 4]);
assert_eq!(arr[1.. 3], [ 1, 2 ]);
assert_eq!(arr[1..=3], [ 1, 2, 3 ]);
Fields§
§end: Idx
The upper bound of the range (inclusive)
Implementations§
Source§impl<Idx> RangeToInclusive<Idx>where
Idx: PartialOrd,
impl<Idx> RangeToInclusive<Idx>where
Idx: PartialOrd,
1.35.0 · Sourcepub fn contains<U>(&self, item: &U) -> bool
pub fn contains<U>(&self, item: &U) -> bool
Returns true
if item
is contained in the range.
§Examples
assert!( (..=5).contains(&-1_000_000_000));
assert!( (..=5).contains(&5));
assert!(!(..=5).contains(&6));
assert!( (..=1.0).contains(&1.0));
assert!(!(..=1.0).contains(&f32::NAN));
assert!(!(..=f32::NAN).contains(&0.5));
Trait Implementations§
§impl<T> Archive for RangeToInclusive<T>where
T: Archive,
impl<T> Archive for RangeToInclusive<T>where
T: Archive,
§type Archived = ArchivedRangeToInclusive<<T as Archive>::Archived>
type Archived = ArchivedRangeToInclusive<<T as Archive>::Archived>
§type Resolver = RangeToInclusive<<T as Archive>::Resolver>
type Resolver = RangeToInclusive<<T as Archive>::Resolver>
§fn resolve(
&self,
resolver: <RangeToInclusive<T> as Archive>::Resolver,
out: Place<<RangeToInclusive<T> as Archive>::Archived>,
)
fn resolve( &self, resolver: <RangeToInclusive<T> as Archive>::Resolver, out: Place<<RangeToInclusive<T> as Archive>::Archived>, )
§const COPY_OPTIMIZATION: CopyOptimization<Self> = _
const COPY_OPTIMIZATION: CopyOptimization<Self> = _
serialize
. Read more§impl<T, C> CheckBytes<C> for RangeToInclusive<T>
impl<T, C> CheckBytes<C> for RangeToInclusive<T>
1.26.0 · Source§impl<Idx> Clone for RangeToInclusive<Idx>where
Idx: Clone,
impl<Idx> Clone for RangeToInclusive<Idx>where
Idx: Clone,
Source§fn clone(&self) -> RangeToInclusive<Idx>
fn clone(&self) -> RangeToInclusive<Idx>
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moreSource§impl<T: ConstDefault> ConstDefault for RangeToInclusive<T>
impl<T: ConstDefault> ConstDefault for RangeToInclusive<T>
§impl<C1, C2> ContainsToken<C1> for RangeToInclusive<C2>
impl<C1, C2> ContainsToken<C1> for RangeToInclusive<C2>
§fn contains_token(&self, token: C1) -> bool
fn contains_token(&self, token: C1) -> bool
1.26.0 · Source§impl<Idx> Debug for RangeToInclusive<Idx>where
Idx: Debug,
impl<Idx> Debug for RangeToInclusive<Idx>where
Idx: Debug,
§impl<T, D> Deserialize<RangeToInclusive<T>, D> for ArchivedRangeToInclusive<<T as Archive>::Archived>
impl<T, D> Deserialize<RangeToInclusive<T>, D> for ArchivedRangeToInclusive<<T as Archive>::Archived>
§fn deserialize(
&self,
deserializer: &mut D,
) -> Result<RangeToInclusive<T>, <D as Fallible>::Error> ⓘ
fn deserialize( &self, deserializer: &mut D, ) -> Result<RangeToInclusive<T>, <D as Fallible>::Error> ⓘ
Source§impl<T> From<RangeToInclusive<T>> for Interval<T>
impl<T> From<RangeToInclusive<T>> for Interval<T>
Source§fn from(r: RangeToInclusive<T>) -> Self
fn from(r: RangeToInclusive<T>) -> Self
§impl From<RangeToInclusive<usize>> for Range
impl From<RangeToInclusive<usize>> for Range
§fn from(range: RangeToInclusive<usize>) -> Range
fn from(range: RangeToInclusive<usize>) -> Range
1.26.0 · Source§impl<Idx> Hash for RangeToInclusive<Idx>where
Idx: Hash,
impl<Idx> Hash for RangeToInclusive<Idx>where
Idx: Hash,
§impl Index<RangeToInclusive<usize>> for ArchivedString
impl Index<RangeToInclusive<usize>> for ArchivedString
§fn index(
&self,
index: RangeToInclusive<usize>,
) -> &<ArchivedString as Index<RangeToInclusive<usize>>>::Output
fn index( &self, index: RangeToInclusive<usize>, ) -> &<ArchivedString as Index<RangeToInclusive<usize>>>::Output
container[index]
) operation. Read more§impl Index<RangeToInclusive<usize>> for BStr
impl Index<RangeToInclusive<usize>> for BStr
§impl Index<RangeToInclusive<usize>> for Bytes
impl Index<RangeToInclusive<usize>> for Bytes
§impl<'bump> Index<RangeToInclusive<usize>> for String<'bump>
impl<'bump> Index<RangeToInclusive<usize>> for String<'bump>
§impl Index<RangeToInclusive<usize>> for UninitSlice
impl Index<RangeToInclusive<usize>> for UninitSlice
§impl<'bump> IndexMut<RangeToInclusive<usize>> for String<'bump>
impl<'bump> IndexMut<RangeToInclusive<usize>> for String<'bump>
§impl IndexMut<RangeToInclusive<usize>> for UninitSlice
impl IndexMut<RangeToInclusive<usize>> for UninitSlice
§fn index_mut(&mut self, index: RangeToInclusive<usize>) -> &mut UninitSlice
fn index_mut(&mut self, index: RangeToInclusive<usize>) -> &mut UninitSlice
container[index]
) operation. Read more§impl<T, U> PartialEq<RangeToInclusive<T>> for ArchivedRangeToInclusive<U>where
U: PartialEq<T>,
impl<T, U> PartialEq<RangeToInclusive<T>> for ArchivedRangeToInclusive<U>where
U: PartialEq<T>,
1.26.0 · Source§impl<Idx> PartialEq for RangeToInclusive<Idx>where
Idx: PartialEq,
impl<Idx> PartialEq for RangeToInclusive<Idx>where
Idx: PartialEq,
1.28.0 · Source§impl<T> RangeBounds<T> for RangeToInclusive<&T>
impl<T> RangeBounds<T> for RangeToInclusive<&T>
1.28.0 · Source§impl<T> RangeBounds<T> for RangeToInclusive<T>
impl<T> RangeBounds<T> for RangeToInclusive<T>
§impl<T, S> Serialize<S> for RangeToInclusive<T>
impl<T, S> Serialize<S> for RangeToInclusive<T>
1.26.0 · Source§impl<T> SliceIndex<[T]> for RangeToInclusive<usize>
The methods index
and index_mut
panic if the end of the range is out of bounds.
impl<T> SliceIndex<[T]> for RangeToInclusive<usize>
The methods index
and index_mut
panic if the end of the range is out of bounds.
Source§fn get(self, slice: &[T]) -> Option<&[T]> ⓘ
fn get(self, slice: &[T]) -> Option<&[T]> ⓘ
slice_index_methods
)Source§fn get_mut(self, slice: &mut [T]) -> Option<&mut [T]> ⓘ
fn get_mut(self, slice: &mut [T]) -> Option<&mut [T]> ⓘ
slice_index_methods
)Source§unsafe fn get_unchecked(self, slice: *const [T]) -> *const [T]
unsafe fn get_unchecked(self, slice: *const [T]) -> *const [T]
slice_index_methods
)Source§unsafe fn get_unchecked_mut(self, slice: *mut [T]) -> *mut [T]
unsafe fn get_unchecked_mut(self, slice: *mut [T]) -> *mut [T]
slice_index_methods
)1.26.0 · Source§impl SliceIndex<str> for RangeToInclusive<usize>
Implements substring slicing with syntax &self[..= end]
or &mut self[..= end]
.
impl SliceIndex<str> for RangeToInclusive<usize>
Implements substring slicing with syntax &self[..= end]
or &mut self[..= end]
.
Returns a slice of the given string from the byte range [0, end
].
Equivalent to &self [0 .. end + 1]
, except if end
has the maximum
value for usize
.
This operation is O(1).
§Panics
Panics if end
does not point to the ending byte offset of a character
(end + 1
is either a starting byte offset as defined by
is_char_boundary
, or equal to len
), or if end >= len
.
Source§fn get(
self,
slice: &str,
) -> Option<&<RangeToInclusive<usize> as SliceIndex<str>>::Output> ⓘ
fn get( self, slice: &str, ) -> Option<&<RangeToInclusive<usize> as SliceIndex<str>>::Output> ⓘ
slice_index_methods
)Source§fn get_mut(
self,
slice: &mut str,
) -> Option<&mut <RangeToInclusive<usize> as SliceIndex<str>>::Output> ⓘ
fn get_mut( self, slice: &mut str, ) -> Option<&mut <RangeToInclusive<usize> as SliceIndex<str>>::Output> ⓘ
slice_index_methods
)Source§unsafe fn get_unchecked(
self,
slice: *const str,
) -> *const <RangeToInclusive<usize> as SliceIndex<str>>::Output
unsafe fn get_unchecked( self, slice: *const str, ) -> *const <RangeToInclusive<usize> as SliceIndex<str>>::Output
slice_index_methods
)Source§unsafe fn get_unchecked_mut(
self,
slice: *mut str,
) -> *mut <RangeToInclusive<usize> as SliceIndex<str>>::Output
unsafe fn get_unchecked_mut( self, slice: *mut str, ) -> *mut <RangeToInclusive<usize> as SliceIndex<str>>::Output
slice_index_methods
)Source§fn index(
self,
slice: &str,
) -> &<RangeToInclusive<usize> as SliceIndex<str>>::Output
fn index( self, slice: &str, ) -> &<RangeToInclusive<usize> as SliceIndex<str>>::Output
slice_index_methods
)Source§fn index_mut(
self,
slice: &mut str,
) -> &mut <RangeToInclusive<usize> as SliceIndex<str>>::Output
fn index_mut( self, slice: &mut str, ) -> &mut <RangeToInclusive<usize> as SliceIndex<str>>::Output
slice_index_methods
)Source§impl<T> TryFrom<Interval<T>> for RangeToInclusive<T>
§Errors
Returns IncompatibleBounds
if the bounds are not compatible.
impl<T> TryFrom<Interval<T>> for RangeToInclusive<T>
§Errors
Returns IncompatibleBounds
if the bounds are not compatible.
impl<Idx> Copy for RangeToInclusive<Idx>where
Idx: Copy,
impl<Idx> Eq for RangeToInclusive<Idx>where
Idx: Eq,
impl<T> OneSidedRange<T> for RangeToInclusive<T>where
RangeToInclusive<T>: RangeBounds<T>,
impl<Idx> StructuralPartialEq for RangeToInclusive<Idx>
Auto Trait Implementations§
impl<Idx> Freeze for RangeToInclusive<Idx>where
Idx: Freeze,
impl<Idx> RefUnwindSafe for RangeToInclusive<Idx>where
Idx: RefUnwindSafe,
impl<Idx> Send for RangeToInclusive<Idx>where
Idx: Send,
impl<Idx> Sync for RangeToInclusive<Idx>where
Idx: Sync,
impl<Idx> Unpin for RangeToInclusive<Idx>where
Idx: Unpin,
impl<Idx> UnwindSafe for RangeToInclusive<Idx>where
Idx: UnwindSafe,
Blanket Implementations§
§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
§type ArchivedMetadata = ()
type ArchivedMetadata = ()
§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
§impl<T> ArchiveUnsized for Twhere
T: Archive,
impl<T> ArchiveUnsized for Twhere
T: Archive,
§type Archived = <T as Archive>::Archived
type Archived = <T as Archive>::Archived
Archive
, it may be
unsized. Read more§fn archived_metadata(
&self,
) -> <<T as ArchiveUnsized>::Archived as ArchivePointee>::ArchivedMetadata
fn archived_metadata( &self, ) -> <<T as ArchiveUnsized>::Archived as ArchivePointee>::ArchivedMetadata
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> ByteSized for T
impl<T> ByteSized for T
Source§const BYTE_ALIGN: usize = _
const BYTE_ALIGN: usize = _
Source§fn byte_align(&self) -> usize ⓘ
fn byte_align(&self) -> usize ⓘ
Source§fn ptr_size_ratio(&self) -> [usize; 2]
fn ptr_size_ratio(&self) -> [usize; 2]
Source§impl<T, R> Chain<R> for Twhere
T: ?Sized,
impl<T, R> Chain<R> for Twhere
T: ?Sized,
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.Source§impl<T> ExtAny for T
impl<T> ExtAny for T
Source§fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
Source§impl<T> ExtMem for Twhere
T: ?Sized,
impl<T> ExtMem for Twhere
T: ?Sized,
Source§const NEEDS_DROP: bool = _
const NEEDS_DROP: bool = _
Source§fn mem_align_of_val(&self) -> usize ⓘ
fn mem_align_of_val(&self) -> usize ⓘ
Source§fn mem_size_of_val(&self) -> usize ⓘ
fn mem_size_of_val(&self) -> usize ⓘ
Source§fn mem_needs_drop(&self) -> bool
fn mem_needs_drop(&self) -> bool
true
if dropping values of this type matters. Read moreSource§fn mem_forget(self)where
Self: Sized,
fn mem_forget(self)where
Self: Sized,
self
without running its destructor. Read moreSource§fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
Source§unsafe fn mem_zeroed<T>() -> T
unsafe fn mem_zeroed<T>() -> T
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§fn mem_as_bytes(&self) -> &[u8] ⓘ
fn mem_as_bytes(&self) -> &[u8] ⓘ
unsafe_slice
only.§impl<S> FromSample<S> for S
impl<S> FromSample<S> for S
fn from_sample_(s: S) -> S
Source§impl<T> Hook for T
impl<T> Hook for T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more§impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
fn into_sample(self) -> T
§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
out
indicating that a T
is niched.