pub struct Range<Idx> {
pub start: Idx,
pub end: Idx,
}Expand description
A (half-open) range bounded inclusively below and exclusively above
(start..end).
The range start..end contains all values with start <= x < end.
It is empty if start >= end.
§Examples
The start..end syntax is a Range:
Fields§
§start: IdxThe lower bound of the range (inclusive).
end: IdxThe upper bound of the range (exclusive).
Implementations§
Source§impl<Idx: PartialOrd<Idx>> Range<Idx>
impl<Idx: PartialOrd<Idx>> Range<Idx>
1.35.0 (const: unstable) · Sourcepub fn contains<U>(&self, item: &U) -> bool
Available on non-crate feature ferrocene_certified only.
pub fn contains<U>(&self, item: &U) -> bool
ferrocene_certified only.Returns true if item is contained in the range.
§Examples
assert!(!(3..5).contains(&2));
assert!( (3..5).contains(&3));
assert!( (3..5).contains(&4));
assert!(!(3..5).contains(&5));
assert!(!(3..3).contains(&3));
assert!(!(3..2).contains(&3));
assert!( (0.0..1.0).contains(&0.5));
assert!(!(0.0..1.0).contains(&f32::NAN));
assert!(!(0.0..f32::NAN).contains(&0.5));
assert!(!(f32::NAN..1.0).contains(&0.5));1.47.0 (const: unstable) · Sourcepub fn is_empty(&self) -> boolwhere
Idx: PartialOrd<Idx>,
Available on non-crate feature ferrocene_certified only.
pub fn is_empty(&self) -> boolwhere
Idx: PartialOrd<Idx>,
ferrocene_certified only.Returns true if the range contains no items.
§Examples
The range is empty if either side is incomparable:
Trait Implementations§
1.0.0 · Source§impl<Idx: Debug> Debug for Range<Idx>
Available on non-crate feature ferrocene_certified only.
impl<Idx: Debug> Debug for Range<Idx>
ferrocene_certified only.1.0.0 · Source§impl<A: Step> DoubleEndedIterator for Range<A>
Available on non-crate feature ferrocene_certified only.
impl<A: Step> DoubleEndedIterator for Range<A>
ferrocene_certified only.Source§fn next_back(&mut self) -> Option<A>
fn next_back(&mut self) -> Option<A>
Source§fn nth_back(&mut self, n: usize) -> Option<A>
fn nth_back(&mut self, n: usize) -> Option<A>
nth element from the end of the iterator. Read moreSource§fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>
fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>
iter_advance_by #77404)n elements. Read more1.27.0 · Source§fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R
fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R
Iterator::try_fold(): it takes
elements starting from the back of the iterator. Read more1.0.0 · Source§impl ExactSizeIterator for Range<i16>
impl ExactSizeIterator for Range<i16>
1.0.0 · Source§impl ExactSizeIterator for Range<i32>
impl ExactSizeIterator for Range<i32>
1.0.0 · Source§impl ExactSizeIterator for Range<i8>
impl ExactSizeIterator for Range<i8>
1.0.0 · Source§impl ExactSizeIterator for Range<isize>
impl ExactSizeIterator for Range<isize>
1.0.0 · Source§impl ExactSizeIterator for Range<u16>
impl ExactSizeIterator for Range<u16>
1.0.0 · Source§impl ExactSizeIterator for Range<u32>
impl ExactSizeIterator for Range<u32>
1.0.0 · Source§impl ExactSizeIterator for Range<u8>
impl ExactSizeIterator for Range<u8>
1.0.0 · Source§impl ExactSizeIterator for Range<usize>
impl ExactSizeIterator for Range<usize>
Source§impl GetDisjointMutIndex for Range<usize>
Available on non-crate feature ferrocene_certified only.
impl GetDisjointMutIndex for Range<usize>
ferrocene_certified only.Source§fn is_in_bounds(&self, len: usize) -> bool
fn is_in_bounds(&self, len: usize) -> bool
get_disjoint_mut_helpers)true if self is in bounds for len slice elements.Source§fn is_overlapping(&self, other: &Self) -> bool
fn is_overlapping(&self, other: &Self) -> bool
get_disjoint_mut_helpers)1.0.0 · Source§impl<Idx: Hash> Hash for Range<Idx>
impl<Idx: Hash> Hash for Range<Idx>
Source§impl<T> IntoBounds<T> for Range<T>
impl<T> IntoBounds<T> for Range<T>
1.0.0 · Source§impl<A: Step> Iterator for Range<A>
impl<A: Step> Iterator for Range<A>
Source§fn size_hint(&self) -> (usize, Option<usize>)
fn size_hint(&self) -> (usize, Option<usize>)
Source§fn count(self) -> usize
fn count(self) -> usize
ferrocene_certified only.Source§fn nth(&mut self, n: usize) -> Option<A>
fn nth(&mut self, n: usize) -> Option<A>
ferrocene_certified only.nth element of the iterator. Read moreSource§fn last(self) -> Option<A>
fn last(self) -> Option<A>
ferrocene_certified only.Source§fn min(self) -> Option<A>where
A: Ord,
fn min(self) -> Option<A>where
A: Ord,
ferrocene_certified only.Source§fn max(self) -> Option<A>where
A: Ord,
fn max(self) -> Option<A>where
A: Ord,
ferrocene_certified only.Source§fn is_sorted(self) -> bool
fn is_sorted(self) -> bool
ferrocene_certified only.Source§fn advance_by(&mut self, n: usize) -> Result<(), NonZero<usize>>
fn advance_by(&mut self, n: usize) -> Result<(), NonZero<usize>>
iter_advance_by #77404)ferrocene_certified only.n elements. Read moreSource§fn next_chunk<const N: usize>(
&mut self,
) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>where
Self: Sized,
fn next_chunk<const N: usize>(
&mut self,
) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>where
Self: Sized,
iter_next_chunk #98326)ferrocene_certified only.N values. Read more1.28.0 · Source§fn step_by(self, step: usize) -> StepBy<Self> ⓘwhere
Self: Sized,
fn step_by(self, step: usize) -> StepBy<Self> ⓘwhere
Self: Sized,
ferrocene_certified only.1.0.0 · Source§fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> ⓘ
fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> ⓘ
ferrocene_certified only.1.0.0 · Source§fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> ⓘwhere
Self: Sized,
U: IntoIterator,
fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> ⓘwhere
Self: Sized,
U: IntoIterator,
ferrocene_certified only.Source§fn intersperse(self, separator: Self::Item) -> Intersperse<Self> ⓘ
fn intersperse(self, separator: Self::Item) -> Intersperse<Self> ⓘ
iter_intersperse #79524)ferrocene_certified only.separator between adjacent
items of the original iterator. Read moreSource§fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G> ⓘ
fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G> ⓘ
iter_intersperse #79524)ferrocene_certified only.separator
between adjacent items of the original iterator. Read more1.0.0 · Source§fn map<B, F>(self, f: F) -> Map<Self, F> ⓘ
fn map<B, F>(self, f: F) -> Map<Self, F> ⓘ
1.21.0 · Source§fn for_each<F>(self, f: F)
fn for_each<F>(self, f: F)
ferrocene_certified only.1.0.0 · Source§fn filter<P>(self, predicate: P) -> Filter<Self, P> ⓘ
fn filter<P>(self, predicate: P) -> Filter<Self, P> ⓘ
ferrocene_certified only.1.0.0 · Source§fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> ⓘ
fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> ⓘ
ferrocene_certified only.1.0.0 · Source§fn enumerate(self) -> Enumerate<Self> ⓘwhere
Self: Sized,
fn enumerate(self) -> Enumerate<Self> ⓘwhere
Self: Sized,
ferrocene_certified only.1.0.0 · Source§fn peekable(self) -> Peekable<Self> ⓘwhere
Self: Sized,
fn peekable(self) -> Peekable<Self> ⓘwhere
Self: Sized,
ferrocene_certified only.1.0.0 · Source§fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> ⓘ
fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> ⓘ
ferrocene_certified only.1.0.0 · Source§fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> ⓘ
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> ⓘ
ferrocene_certified only.1.57.0 · Source§fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P> ⓘ
fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P> ⓘ
ferrocene_certified only.1.0.0 · Source§fn skip(self, n: usize) -> Skip<Self> ⓘwhere
Self: Sized,
fn skip(self, n: usize) -> Skip<Self> ⓘwhere
Self: Sized,
ferrocene_certified only.n elements. Read more1.0.0 · Source§fn take(self, n: usize) -> Take<Self> ⓘwhere
Self: Sized,
fn take(self, n: usize) -> Take<Self> ⓘwhere
Self: Sized,
ferrocene_certified only.n elements, or fewer
if the underlying iterator ends sooner. Read more1.0.0 · Source§fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> ⓘ
fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> ⓘ
ferrocene_certified only.1.0.0 · Source§fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> ⓘ
fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> ⓘ
ferrocene_certified only.1.29.0 · Source§fn flatten(self) -> Flatten<Self> ⓘ
fn flatten(self) -> Flatten<Self> ⓘ
ferrocene_certified only.Source§fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N> ⓘ
fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N> ⓘ
iter_map_windows #87155)ferrocene_certified only.f for each contiguous window of size N over
self and returns an iterator over the outputs of f. Like slice::windows(),
the windows during mapping overlap as well. Read more1.0.0 · Source§fn fuse(self) -> Fuse<Self> ⓘwhere
Self: Sized,
fn fuse(self) -> Fuse<Self> ⓘwhere
Self: Sized,
ferrocene_certified only.1.0.0 · Source§fn inspect<F>(self, f: F) -> Inspect<Self, F> ⓘ
fn inspect<F>(self, f: F) -> Inspect<Self, F> ⓘ
ferrocene_certified only.1.0.0 · Source§fn by_ref(&mut self) -> &mut Selfwhere
Self: Sized,
fn by_ref(&mut self) -> &mut Selfwhere
Self: Sized,
ferrocene_certified only.Iterator. Read more1.0.0 · Source§fn collect<B: FromIterator<Self::Item>>(self) -> Bwhere
Self: Sized,
fn collect<B: FromIterator<Self::Item>>(self) -> Bwhere
Self: Sized,
ferrocene_certified only.Source§fn try_collect<B>(&mut self) -> <Self::Item::Residual as Residual<B>>::TryType
fn try_collect<B>(&mut self) -> <Self::Item::Residual as Residual<B>>::TryType
iterator_try_collect #94047)ferrocene_certified only.Source§fn collect_into<E: Extend<Self::Item>>(self, collection: &mut E) -> &mut Ewhere
Self: Sized,
fn collect_into<E: Extend<Self::Item>>(self, collection: &mut E) -> &mut Ewhere
Self: Sized,
iter_collect_into #94780)ferrocene_certified only.1.0.0 · Source§fn partition<B, F>(self, f: F) -> (B, B)
fn partition<B, F>(self, f: F) -> (B, B)
ferrocene_certified only.Source§fn partition_in_place<'a, T: 'a, P>(self, predicate: P) -> usize
fn partition_in_place<'a, T: 'a, P>(self, predicate: P) -> usize
iter_partition_in_place #62543)ferrocene_certified only.true precede all those that return false.
Returns the number of true elements found. Read moreSource§fn is_partitioned<P>(self, predicate: P) -> bool
fn is_partitioned<P>(self, predicate: P) -> bool
iter_is_partitioned #62544)ferrocene_certified only.true precede all those that return false. Read more1.27.0 · Source§fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R
fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R
ferrocene_certified only.1.27.0 · Source§fn try_for_each<F, R>(&mut self, f: F) -> R
fn try_for_each<F, R>(&mut self, f: F) -> R
ferrocene_certified only.1.0.0 · Source§fn fold<B, F>(self, init: B, f: F) -> B
fn fold<B, F>(self, init: B, f: F) -> B
ferrocene_certified only.1.51.0 · Source§fn reduce<F>(self, f: F) -> Option<Self::Item>
fn reduce<F>(self, f: F) -> Option<Self::Item>
ferrocene_certified only.Source§fn try_reduce<R>(
&mut self,
f: impl FnMut(Self::Item, Self::Item) -> R,
) -> <R::Residual as Residual<Option<R::Output>>>::TryType
fn try_reduce<R>( &mut self, f: impl FnMut(Self::Item, Self::Item) -> R, ) -> <R::Residual as Residual<Option<R::Output>>>::TryType
iterator_try_reduce #87053)ferrocene_certified only.1.0.0 · Source§fn all<F>(&mut self, f: F) -> bool
fn all<F>(&mut self, f: F) -> bool
ferrocene_certified only.1.0.0 · Source§fn any<F>(&mut self, f: F) -> bool
fn any<F>(&mut self, f: F) -> bool
ferrocene_certified only.1.0.0 · Source§fn find<P>(&mut self, predicate: P) -> Option<Self::Item>
fn find<P>(&mut self, predicate: P) -> Option<Self::Item>
ferrocene_certified only.1.30.0 · Source§fn find_map<B, F>(&mut self, f: F) -> Option<B>
fn find_map<B, F>(&mut self, f: F) -> Option<B>
ferrocene_certified only.Source§fn try_find<R>(
&mut self,
f: impl FnMut(&Self::Item) -> R,
) -> <R::Residual as Residual<Option<Self::Item>>>::TryType
fn try_find<R>( &mut self, f: impl FnMut(&Self::Item) -> R, ) -> <R::Residual as Residual<Option<Self::Item>>>::TryType
try_find #63178)ferrocene_certified only.1.0.0 · Source§fn position<P>(&mut self, predicate: P) -> Option<usize>
fn position<P>(&mut self, predicate: P) -> Option<usize>
ferrocene_certified only.1.0.0 · Source§fn rposition<P>(&mut self, predicate: P) -> Option<usize>
fn rposition<P>(&mut self, predicate: P) -> Option<usize>
ferrocene_certified only.1.6.0 · Source§fn max_by_key<B: Ord, F>(self, f: F) -> Option<Self::Item>
fn max_by_key<B: Ord, F>(self, f: F) -> Option<Self::Item>
ferrocene_certified only.1.15.0 · Source§fn max_by<F>(self, compare: F) -> Option<Self::Item>
fn max_by<F>(self, compare: F) -> Option<Self::Item>
ferrocene_certified only.1.6.0 · Source§fn min_by_key<B: Ord, F>(self, f: F) -> Option<Self::Item>
fn min_by_key<B: Ord, F>(self, f: F) -> Option<Self::Item>
ferrocene_certified only.1.15.0 · Source§fn min_by<F>(self, compare: F) -> Option<Self::Item>
fn min_by<F>(self, compare: F) -> Option<Self::Item>
ferrocene_certified only.1.0.0 · Source§fn rev(self) -> Rev<Self> ⓘwhere
Self: Sized + DoubleEndedIterator,
fn rev(self) -> Rev<Self> ⓘwhere
Self: Sized + DoubleEndedIterator,
ferrocene_certified only.1.0.0 · Source§fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)
fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)
ferrocene_certified only.1.36.0 · Source§fn copied<'a, T>(self) -> Copied<Self> ⓘ
fn copied<'a, T>(self) -> Copied<Self> ⓘ
ferrocene_certified only.1.0.0 · Source§fn cycle(self) -> Cycle<Self> ⓘ
fn cycle(self) -> Cycle<Self> ⓘ
ferrocene_certified only.Source§fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N> ⓘwhere
Self: Sized,
fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N> ⓘwhere
Self: Sized,
iter_array_chunks #100450)ferrocene_certified only.N elements of the iterator at a time. Read more1.11.0 · Source§fn product<P>(self) -> P
fn product<P>(self) -> P
ferrocene_certified only.1.5.0 · Source§fn cmp<I>(self, other: I) -> Ordering
fn cmp<I>(self, other: I) -> Ordering
ferrocene_certified only.Source§fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering
fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering
iter_order_by #64295)ferrocene_certified only.Iterator with those
of another with respect to the specified comparison function. Read more1.5.0 · Source§fn partial_cmp<I>(self, other: I) -> Option<Ordering>
fn partial_cmp<I>(self, other: I) -> Option<Ordering>
ferrocene_certified only.PartialOrd elements of
this Iterator with those of another. The comparison works like short-circuit
evaluation, returning a result without comparing the remaining elements.
As soon as an order can be determined, the evaluation stops and a result is returned. Read moreSource§fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>
fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>
iter_order_by #64295)ferrocene_certified only.Iterator with those
of another with respect to the specified comparison function. Read more1.5.0 · Source§fn eq<I>(self, other: I) -> bool
fn eq<I>(self, other: I) -> bool
ferrocene_certified only.Source§fn eq_by<I, F>(self, other: I, eq: F) -> bool
fn eq_by<I, F>(self, other: I, eq: F) -> bool
iter_order_by #64295)ferrocene_certified only.1.5.0 · Source§fn ne<I>(self, other: I) -> bool
fn ne<I>(self, other: I) -> bool
ferrocene_certified only.1.5.0 · Source§fn lt<I>(self, other: I) -> bool
fn lt<I>(self, other: I) -> bool
ferrocene_certified only.Iterator are lexicographically
less than those of another. Read more1.5.0 · Source§fn le<I>(self, other: I) -> bool
fn le<I>(self, other: I) -> bool
ferrocene_certified only.Iterator are lexicographically
less or equal to those of another. Read more1.5.0 · Source§fn gt<I>(self, other: I) -> bool
fn gt<I>(self, other: I) -> bool
ferrocene_certified only.Iterator are lexicographically
greater than those of another. Read more1.5.0 · Source§fn ge<I>(self, other: I) -> bool
fn ge<I>(self, other: I) -> bool
ferrocene_certified only.Iterator are lexicographically
greater than or equal to those of another. Read more1.82.0 · Source§fn is_sorted_by<F>(self, compare: F) -> bool
fn is_sorted_by<F>(self, compare: F) -> bool
ferrocene_certified only.1.82.0 · Source§fn is_sorted_by_key<F, K>(self, f: F) -> bool
fn is_sorted_by_key<F, K>(self, f: F) -> bool
ferrocene_certified only.1.28.0 (const: unstable) · Source§impl<T> RangeBounds<T> for Range<&T>
If you need to use this implementation where T is unsized,
consider using the RangeBounds impl for a 2-tuple of Bound<&T>,
i.e. replace start..end with (Bound::Included(start), Bound::Excluded(end)).
impl<T> RangeBounds<T> for Range<&T>
If you need to use this implementation where T is unsized,
consider using the RangeBounds impl for a 2-tuple of Bound<&T>,
i.e. replace start..end with (Bound::Included(start), Bound::Excluded(end)).
1.28.0 (const: unstable) · Source§impl<T> RangeBounds<T> for Range<T>
impl<T> RangeBounds<T> for Range<T>
1.15.0 (const: unstable) · Source§impl<T> SliceIndex<[T]> for Range<usize>
The methods index and index_mut panic if:
impl<T> SliceIndex<[T]> for Range<usize>
The methods index and index_mut panic if:
- the start of the range is greater than the end of the range or
- 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)Source§impl SliceIndex<ByteStr> for Range<usize>
Available on non-crate feature ferrocene_certified only.
impl SliceIndex<ByteStr> for Range<usize>
ferrocene_certified only.Source§fn get(self, slice: &ByteStr) -> Option<&Self::Output>
fn get(self, slice: &ByteStr) -> Option<&Self::Output>
slice_index_methods)Source§fn get_mut(self, slice: &mut ByteStr) -> Option<&mut Self::Output>
fn get_mut(self, slice: &mut ByteStr) -> Option<&mut Self::Output>
slice_index_methods)Source§unsafe fn get_unchecked(self, slice: *const ByteStr) -> *const Self::Output
unsafe fn get_unchecked(self, slice: *const ByteStr) -> *const Self::Output
slice_index_methods)Source§unsafe fn get_unchecked_mut(self, slice: *mut ByteStr) -> *mut Self::Output
unsafe fn get_unchecked_mut(self, slice: *mut ByteStr) -> *mut Self::Output
slice_index_methods)1.20.0 (const: unstable) · Source§impl SliceIndex<str> for Range<usize>
Available on non-crate feature ferrocene_certified only.Implements substring slicing with syntax &self[begin .. end] or &mut self[begin .. end].
impl SliceIndex<str> for Range<usize>
ferrocene_certified only.Implements substring slicing with syntax &self[begin .. end] or &mut self[begin .. end].
Returns a slice of the given string from the byte range
[begin, 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 begin or end does not point to the starting byte offset of
a character (as defined by is_char_boundary), if begin > end, or if
end > len.
§Examples
Source§fn get(self, slice: &str) -> Option<&Self::Output>
fn get(self, slice: &str) -> Option<&Self::Output>
slice_index_methods)Source§fn get_mut(self, slice: &mut str) -> Option<&mut Self::Output>
fn get_mut(self, slice: &mut str) -> Option<&mut Self::Output>
slice_index_methods)Source§unsafe fn get_unchecked(self, slice: *const str) -> *const Self::Output
unsafe fn get_unchecked(self, slice: *const str) -> *const Self::Output
slice_index_methods)Source§unsafe fn get_unchecked_mut(self, slice: *mut str) -> *mut Self::Output
unsafe fn get_unchecked_mut(self, slice: *mut str) -> *mut Self::Output
slice_index_methods)impl<T: CloneFromCell> CloneFromCell for Range<T>
ferrocene_certified only.impl<Idx: Eq> Eq for Range<Idx>
impl<A: Step> FusedIterator for Range<A>
ferrocene_certified only.impl<Idx> StructuralPartialEq for Range<Idx>
impl<A: TrustedStep> TrustedLen for Range<A>
ferrocene_certified only.Auto Trait Implementations§
impl<Idx> Freeze for Range<Idx>where
Idx: Freeze,
impl<Idx> RefUnwindSafe for Range<Idx>where
Idx: RefUnwindSafe,
impl<Idx> Send for Range<Idx>where
Idx: Send,
impl<Idx> Sync for Range<Idx>where
Idx: Sync,
impl<Idx> Unpin for Range<Idx>where
Idx: Unpin,
impl<Idx> UnwindSafe for Range<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
ferrocene_certified only.