pub struct RangeTo<Idx> {
pub end: Idx,
}
Expand description
core
A range only bounded exclusively above (..end
).
Re-exported from core
::ops::
.
A range only bounded exclusively above (..end
).
The RangeTo
..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 RangeTo
:
assert_eq!((..5), std::ops::RangeTo { 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::RangeTo<{integer}>:
// std::iter::Iterator` is not satisfied
for i in ..5 {
// ...
}
When used as a slicing index, RangeTo
produces a slice of all array
elements before 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 ]); // This is a `RangeTo`
assert_eq!(arr[ ..=3], [0, 1, 2, 3 ]);
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 (exclusive).
Implementations§
Source§impl<Idx> RangeTo<Idx>where
Idx: PartialOrd,
impl<Idx> RangeTo<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(&4));
assert!(!(..5).contains(&5));
assert!( (..1.0).contains(&0.5));
assert!(!(..1.0).contains(&f32::NAN));
assert!(!(..f32::NAN).contains(&0.5));
Trait Implementations§
§impl<T> Archive for RangeTo<T>where
T: Archive,
impl<T> Archive for RangeTo<T>where
T: Archive,
§type Archived = ArchivedRangeTo<<T as Archive>::Archived>
type Archived = ArchivedRangeTo<<T as Archive>::Archived>
§type Resolver = RangeTo<<T as Archive>::Resolver>
type Resolver = RangeTo<<T as Archive>::Resolver>
§fn resolve(
&self,
resolver: <RangeTo<T> as Archive>::Resolver,
out: Place<<RangeTo<T> as Archive>::Archived>,
)
fn resolve( &self, resolver: <RangeTo<T> as Archive>::Resolver, out: Place<<RangeTo<T> as Archive>::Archived>, )
§const COPY_OPTIMIZATION: CopyOptimization<Self> = _
const COPY_OPTIMIZATION: CopyOptimization<Self> = _
serialize
. Read more§impl<T, C> CheckBytes<C> for RangeTo<T>
impl<T, C> CheckBytes<C> for RangeTo<T>
Source§impl<T: ConstDefault> ConstDefault for RangeTo<T>
impl<T: ConstDefault> ConstDefault for RangeTo<T>
§impl<C1, C2> ContainsToken<C1> for RangeTo<C2>
impl<C1, C2> ContainsToken<C1> for RangeTo<C2>
§fn contains_token(&self, token: C1) -> bool
fn contains_token(&self, token: C1) -> bool
Source§impl<'de, Idx> Deserialize<'de> for RangeTo<Idx>where
Idx: Deserialize<'de>,
impl<'de, Idx> Deserialize<'de> for RangeTo<Idx>where
Idx: Deserialize<'de>,
Source§fn deserialize<D>(
deserializer: D,
) -> Result<RangeTo<Idx>, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
fn deserialize<D>(
deserializer: D,
) -> Result<RangeTo<Idx>, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
§impl<T, D> Deserialize<RangeTo<T>, D> for ArchivedRangeTo<<T as Archive>::Archived>
impl<T, D> Deserialize<RangeTo<T>, D> for ArchivedRangeTo<<T as Archive>::Archived>
§impl Index<RangeTo<usize>> for ArchivedString
impl Index<RangeTo<usize>> for ArchivedString
§impl<T, U> PartialEq<RangeTo<T>> for ArchivedRangeTo<U>where
U: PartialEq<T>,
impl<T, U> PartialEq<RangeTo<T>> for ArchivedRangeTo<U>where
U: PartialEq<T>,
1.28.0 · Source§impl<T> RangeBounds<T> for RangeTo<&T>
impl<T> RangeBounds<T> for RangeTo<&T>
1.28.0 · Source§impl<T> RangeBounds<T> for RangeTo<T>
impl<T> RangeBounds<T> for RangeTo<T>
Source§impl<Idx> Serialize for RangeTo<Idx>where
Idx: Serialize,
impl<Idx> Serialize for RangeTo<Idx>where
Idx: Serialize,
Source§fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
1.15.0 · Source§impl<T> SliceIndex<[T]> for RangeTo<usize>
The methods index
and index_mut
panic if the end of the range is out of bounds.
impl<T> SliceIndex<[T]> for RangeTo<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.20.0 · Source§impl SliceIndex<str> for RangeTo<usize>
Implements substring slicing with syntax &self[.. end]
or &mut self[.. end]
.
impl SliceIndex<str> for RangeTo<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]
or &mut self[0 .. end]
.
This operation is O(1).
Prior to 1.20.0, these indexing operations were still supported by
direct implementation of Index
and IndexMut
.
§Panics
Panics if end
does not point to the starting byte offset of a
character (as defined by is_char_boundary
), or if end > len
.
Source§fn get(
self,
slice: &str,
) -> Option<&<RangeTo<usize> as SliceIndex<str>>::Output> ⓘ
fn get( self, slice: &str, ) -> Option<&<RangeTo<usize> as SliceIndex<str>>::Output> ⓘ
slice_index_methods
)Source§fn get_mut(
self,
slice: &mut str,
) -> Option<&mut <RangeTo<usize> as SliceIndex<str>>::Output> ⓘ
fn get_mut( self, slice: &mut str, ) -> Option<&mut <RangeTo<usize> as SliceIndex<str>>::Output> ⓘ
slice_index_methods
)Source§unsafe fn get_unchecked(
self,
slice: *const str,
) -> *const <RangeTo<usize> as SliceIndex<str>>::Output
unsafe fn get_unchecked( self, slice: *const str, ) -> *const <RangeTo<usize> as SliceIndex<str>>::Output
slice_index_methods
)Source§unsafe fn get_unchecked_mut(
self,
slice: *mut str,
) -> *mut <RangeTo<usize> as SliceIndex<str>>::Output
unsafe fn get_unchecked_mut( self, slice: *mut str, ) -> *mut <RangeTo<usize> as SliceIndex<str>>::Output
slice_index_methods
)Source§impl<T> TryFrom<Interval<T>> for RangeTo<T>
§Errors
Returns IncompatibleBounds
if the bounds are not compatible.
impl<T> TryFrom<Interval<T>> for RangeTo<T>
§Errors
Returns IncompatibleBounds
if the bounds are not compatible.
impl<Idx> Copy for RangeTo<Idx>where
Idx: Copy,
impl<Idx> Eq for RangeTo<Idx>where
Idx: Eq,
impl<T> OneSidedRange<T> for RangeTo<T>where
RangeTo<T>: RangeBounds<T>,
impl<Idx> StructuralPartialEq for RangeTo<Idx>
Auto Trait Implementations§
impl<Idx> Freeze for RangeTo<Idx>where
Idx: Freeze,
impl<Idx> RefUnwindSafe for RangeTo<Idx>where
Idx: RefUnwindSafe,
impl<Idx> Send for RangeTo<Idx>where
Idx: Send,
impl<Idx> Sync for RangeTo<Idx>where
Idx: Sync,
impl<Idx> Unpin for RangeTo<Idx>where
Idx: Unpin,
impl<Idx> UnwindSafe for RangeTo<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<T> IntoOptionalRegion for T
impl<T> IntoOptionalRegion for T
§fn into_optional_region(self) -> Option<Region> ⓘ
fn into_optional_region(self) -> Option<Region> ⓘ
Option<Region>
.§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.