Struct wasmtime_environ::__core::ops::RangeToInclusive
1.26.0 · source · pub struct RangeToInclusive<Idx> {
pub end: Idx,
}
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<Idx>,
impl<Idx> RangeToInclusive<Idx>where Idx: PartialOrd<Idx>,
1.35.0 · sourcepub fn contains<U>(&self, item: &U) -> boolwhere
Idx: PartialOrd<U>,
U: PartialOrd<Idx> + ?Sized,
pub fn contains<U>(&self, item: &U) -> boolwhere Idx: PartialOrd<U>, U: PartialOrd<Idx> + ?Sized,
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§
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<Idx> Debug for RangeToInclusive<Idx>where
Idx: Debug,
impl<Idx> Debug for RangeToInclusive<Idx>where Idx: Debug,
source§impl<Idx> Hash for RangeToInclusive<Idx>where
Idx: Hash,
impl<Idx> Hash for RangeToInclusive<Idx>where Idx: Hash,
source§impl<Idx> PartialEq<RangeToInclusive<Idx>> for RangeToInclusive<Idx>where
Idx: PartialEq<Idx>,
impl<Idx> PartialEq<RangeToInclusive<Idx>> for RangeToInclusive<Idx>where Idx: PartialEq<Idx>,
source§fn eq(&self, other: &RangeToInclusive<Idx>) -> bool
fn eq(&self, other: &RangeToInclusive<Idx>) -> bool
self
and other
values to be equal, and is used
by ==
.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>
const: unstable · source§impl<T> SliceIndex<[T]> for RangeToInclusive<usize>
impl<T> SliceIndex<[T]> for RangeToInclusive<usize>
const: unstable · source§fn get(self, slice: &[T]) -> Option<&[T]>
fn get(self, slice: &[T]) -> Option<&[T]>
slice_index_methods
)const: unstable · source§fn get_mut(self, slice: &mut [T]) -> Option<&mut [T]>
fn get_mut(self, slice: &mut [T]) -> Option<&mut [T]>
slice_index_methods
)const: unstable · source§unsafe fn get_unchecked(self, slice: *const [T]) -> *const [T]
unsafe fn get_unchecked(self, slice: *const [T]) -> *const [T]
slice_index_methods
)slice
pointer
is undefined behavior even if the resulting reference is not used.const: unstable · 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
)slice
pointer
is undefined behavior even if the resulting reference is not used.const: unstable · 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
.
const: unstable · 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
)const: unstable · 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
)const: unstable · 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
)slice
pointer
is undefined behavior even if the resulting reference is not used.const: unstable · 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
)slice
pointer
is undefined behavior even if the resulting reference is not used.const: unstable · 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
)const: unstable · 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> StructuralEq for RangeToInclusive<Idx>
impl<Idx> StructuralPartialEq for RangeToInclusive<Idx>
Auto Trait Implementations§
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<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.