pub struct RangeToInclusive<Idx> {
pub end: Idx,
}
new_range_api
)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
new_range_api
)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<'a, A> Arbitrary<'a> for RangeToInclusive<A>where
A: Arbitrary<'a> + Clone + PartialOrd,
impl<'a, A> Arbitrary<'a> for RangeToInclusive<A>where
A: Arbitrary<'a> + Clone + PartialOrd,
§fn arbitrary(u: &mut Unstructured<'a>) -> Result<RangeToInclusive<A>, Error>
fn arbitrary(u: &mut Unstructured<'a>) -> Result<RangeToInclusive<A>, Error>
Self
from the given unstructured data. Read more§fn size_hint(depth: usize) -> (usize, Option<usize>)
fn size_hint(depth: usize) -> (usize, Option<usize>)
Unstructured
this type
needs to construct itself. Read more§fn arbitrary_take_rest(u: Unstructured<'a>) -> Result<Self, Error>
fn arbitrary_take_rest(u: Unstructured<'a>) -> Result<Self, Error>
Self
from the entirety of the given
unstructured data. Read more1.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 more1.26.0 · source§impl<Idx> Debug for RangeToInclusive<Idx>where
Idx: Debug,
impl<Idx> Debug for RangeToInclusive<Idx>where
Idx: Debug,
1.26.0 · source§impl<Idx> Hash for RangeToInclusive<Idx>where
Idx: Hash,
impl<Idx> Hash for RangeToInclusive<Idx>where
Idx: Hash,
§impl<K, V, S> Index<RangeToInclusive<usize>> for IndexMap<K, V, S>
impl<K, V, S> Index<RangeToInclusive<usize>> for IndexMap<K, V, S>
§impl<T, S> Index<RangeToInclusive<usize>> for IndexSet<T, S>
impl<T, S> Index<RangeToInclusive<usize>> for IndexSet<T, S>
§impl<K, V> Index<RangeToInclusive<usize>> for Slice<K, V>
impl<K, V> Index<RangeToInclusive<usize>> for Slice<K, V>
§impl<T> Index<RangeToInclusive<usize>> for Slice<T>
impl<T> Index<RangeToInclusive<usize>> for Slice<T>
§impl<K, V, S> IndexMut<RangeToInclusive<usize>> for IndexMap<K, V, S>
impl<K, V, S> IndexMut<RangeToInclusive<usize>> for IndexMap<K, V, S>
§fn index_mut(
&mut self,
range: RangeToInclusive<usize>,
) -> &mut <IndexMap<K, V, S> as Index<RangeToInclusive<usize>>>::Output
fn index_mut( &mut self, range: RangeToInclusive<usize>, ) -> &mut <IndexMap<K, V, S> as Index<RangeToInclusive<usize>>>::Output
container[index]
) operation. Read more§impl<K, V> IndexMut<RangeToInclusive<usize>> for Slice<K, V>
impl<K, V> IndexMut<RangeToInclusive<usize>> for Slice<K, V>
§fn index_mut(&mut self, range: RangeToInclusive<usize>) -> &mut Slice<K, V>
fn index_mut(&mut self, range: RangeToInclusive<usize>) -> &mut Slice<K, V>
container[index]
) operation. Read more1.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>
1.26.0 · source§impl<T> SliceIndex<[T]> for RangeToInclusive<usize>
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>
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
)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§
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)§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
§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.