Struct std::ops::RangeInclusive
pub struct RangeInclusive<Idx> { /* fields omitted */ }
A range bounded inclusively below and above (start..=end).
The RangeInclusive start..=end contains all values with x >= start and x <= end. It is empty unless start <= end.
This iterator is fused, but the specific values of start and end after iteration has finished are unspecified other than that .is_empty() will return true once no more values will be produced.
Examples
The start..=end syntax is a RangeInclusive:
assert_eq!((3..=5), std::ops::RangeInclusive::new(3, 5)); assert_eq!(3 + 4 + 5, (3..=5).sum());
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 ]); assert_eq!(arr[1.. ], [ 1, 2, 3, 4]); assert_eq!(arr[1.. 3], [ 1, 2 ]); assert_eq!(arr[1..=3], [ 1, 2, 3 ]); // This is a `RangeInclusive`
Implementations
impl<Idx> RangeInclusive<Idx>
pub const fn new(start: Idx, end: Idx) -> RangeInclusive<Idx>
impl<A> Iterator for RangeInclusive<A> where
A: Step,
type Item = A;
Creates a new inclusive range. Equivalent to writing start..=end.
Examples
use std::ops::RangeInclusive; assert_eq!(3..=5, RangeInclusive::new(3, 5));
pub const fn start(&self) -> &Idx
Returns the lower bound of the range (inclusive).
When using an inclusive range for iteration, the values of start() and end() are unspecified after the iteration ended. To determine whether the inclusive range is empty, use the is_empty() method instead of comparing start() > end().
Note: the value returned by this method is unspecified after the range has been iterated to exhaustion.
Examples
assert_eq!((3..=5).start(), &3);
pub const fn end(&self) -> &Idx
Returns the upper bound of the range (inclusive).
When using an inclusive range for iteration, the values of start() and end() are unspecified after the iteration ended. To determine whether the inclusive range is empty, use the is_empty() method instead of comparing start() > end().
Note: the value returned by this method is unspecified after the range has been iterated to exhaustion.
Examples
assert_eq!((3..=5).end(), &5);
pub fn into_inner(self) -> (Idx, Idx)
Destructures the RangeInclusive into (lower bound, upper (inclusive) bound).
Note: the value returned by this method is unspecified after the range has been iterated to exhaustion.
Examples
assert_eq!((3..=5).into_inner(), (3, 5));
impl<Idx> RangeInclusive<Idx> where
Idx: PartialOrd<Idx>,
pub fn contains<U>(&self, item: &U) -> bool where
U: PartialOrd<Idx> + ?Sized,
Idx: PartialOrd<U>,
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..=5).contains(&6)); assert!( (3..=3).contains(&3)); assert!(!(3..=2).contains(&3)); assert!( (0.0..=1.0).contains(&1.0)); assert!(!(0.0..=1.0).contains(&f32::NAN)); assert!(!(0.0..=f32::NAN).contains(&0.0)); assert!(!(f32::NAN..=1.0).contains(&1.0));
This method always returns false after iteration has finished:
let mut r = 3..=5;
assert!(r.contains(&3) && r.contains(&5));
for _ in r.by_ref() {}
// Precise field values are unspecified here
assert!(!r.contains(&3) && !r.contains(&5));pub fn is_empty(&self) -> bool
Returns true if the range contains no items.
Examples
assert!(!(3..=5).is_empty()); assert!(!(3..=3).is_empty()); assert!( (3..=2).is_empty());
The range is empty if either side is incomparable:
assert!(!(3.0..=5.0).is_empty()); assert!( (3.0..=f32::NAN).is_empty()); assert!( (f32::NAN..=5.0).is_empty());
This method returns true after iteration has finished:
let mut r = 3..=5;
for _ in r.by_ref() {}
// Precise field values are unspecified here
assert!(r.is_empty());Trait Implementations
pub fn clone(&self) -> RangeInclusive<Idx>
impl<A> Iterator for RangeInclusive<A> where
A: Step,
type Item = A;
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read more
pub fn fmt(&self, fmt: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
pub fn next_back(&mut self) -> Option<A>
Removes and returns an element from the end of the iterator. Read more
pub fn nth_back(&mut self, n: usize) -> Option<A>
Returns the nth element from the end of the iterator. Read more
pub fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R where
F: FnMut(B, <RangeInclusive<A> as Iterator>::Item) -> R,
R: Try<Output = B>,
RangeInclusive<A>: Sized,
This is the reverse version of Iterator::try_fold(): it takes elements starting from the back of the iterator. Read more
pub fn rfold<B, F>(self, init: B, f: F) -> B where
F: FnMut(B, <RangeInclusive<A> as Iterator>::Item) -> B,
RangeInclusive<A>: Sized,
An iterator method that reduces the iterator’s elements to a single, final value, starting from the back. Read more
fn advance_back_by(&mut self, n: usize) -> Result<(), usize>
iter_advance_by #77404)recently added
Advances the iterator from the back by n elements. Read more
Searches for an element of an iterator from the back that satisfies a predicate. Read more
impl ExactSizeIterator for RangeInclusive<u16>
fn len(&self) -> usize
Returns the exact length of the iterator. Read more
fn is_empty(&self) -> bool
Returns true if the iterator is empty. Read more
impl ExactSizeIterator for RangeInclusive<i8>
fn len(&self) -> usize
Returns the exact length of the iterator. Read more
fn is_empty(&self) -> bool
Returns true if the iterator is empty. Read more
impl ExactSizeIterator for RangeInclusive<i16>
fn len(&self) -> usize
Returns the exact length of the iterator. Read more
fn is_empty(&self) -> bool
Returns true if the iterator is empty. Read more
impl ExactSizeIterator for RangeInclusive<u8>
fn len(&self) -> usize
Returns the exact length of the iterator. Read more
fn is_empty(&self) -> bool
Returns true if the iterator is empty. Read more
impl Index<RangeInclusive<usize>> for String
type Output = str
The returned type after indexing.
pub fn index(&self, index: RangeInclusive<usize>) -> &str
Performs the indexing (container[index]) operation. Read more
impl IndexMut<RangeInclusive<usize>> for String
pub fn index_mut(&mut self, index: RangeInclusive<usize>) -> &mut str
Performs the mutable indexing (container[index]) operation. Read more
type Item = A
The type of the elements being iterated over.
pub fn next(&mut self) -> Option<A>
Advances the iterator and returns the next value. Read more
pub fn size_hint(&self) -> (usize, Option<usize>)
Returns the bounds on the remaining length of the iterator. Read more
pub fn nth(&mut self, n: usize) -> Option<A>
Returns the nth element of the iterator. Read more
pub fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where
F: FnMut(B, <RangeInclusive<A> as Iterator>::Item) -> R,
R: Try<Output = B>,
RangeInclusive<A>: Sized,
An iterator method that applies a function as long as it returns successfully, producing a single, final value. Read more
pub fn fold<B, F>(self, init: B, f: F) -> B where
F: FnMut(B, <RangeInclusive<A> as Iterator>::Item) -> B,
RangeInclusive<A>: Sized,
Folds every element into an accumulator by applying an operation, returning the final result. Read more
pub fn last(self) -> Option<A>
Consumes the iterator, returning the last element. Read more
pub fn min(self) -> Option<A>
Returns the minimum element of an iterator. Read more
pub fn max(self) -> Option<A>
Returns the maximum element of an iterator. Read more
fn count(self) -> usize
Consumes the iterator, counting the number of iterations and returning it. Read more
fn advance_by(&mut self, n: usize) -> Result<(), usize>
iter_advance_by #77404)recently added
Advances the iterator by n elements. Read more
fn step_by(self, step: usize) -> StepBy<Self>
impl<I> Iterator for StepBy<I> where
I: Iterator,
type Item = <I as Iterator>::Item;
Creates an iterator starting at the same point, but stepping by the given amount at each iteration. Read more
fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator<Item = Self::Item>,
impl<A, B> Iterator for Chain<A, B> where
B: Iterator<Item = <A as Iterator>::Item>,
A: Iterator,
type Item = <A as Iterator>::Item;
Takes two iterators and creates a new iterator over both in sequence. Read more
fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator,
impl<A, B> Iterator for Zip<A, B> where
B: Iterator,
A: Iterator,
type Item = (<A as Iterator>::Item, <B as Iterator>::Item);
‘Zips up’ two iterators into a single iterator of pairs. Read more
impl<I> Iterator for Intersperse<I> where
I: Iterator,
<I as Iterator>::Item: Clone,
type Item = <I as Iterator>::Item;
iter_intersperse #79524)recently added
Creates a new iterator which places a copy of separator between adjacent items of the original iterator. Read more
fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G> where
G: FnMut() -> Self::Item,
impl<I, G> Iterator for IntersperseWith<I, G> where
I: Iterator,
G: FnMut() -> <I as Iterator>::Item,
type Item = <I as Iterator>::Item;
iter_intersperse #79524)recently added
Creates a new iterator which places an item generated by separator between adjacent items of the original iterator. Read more
impl<B, I, F> Iterator for Map<I, F> where
F: FnMut(<I as Iterator>::Item) -> B,
I: Iterator,
type Item = B;
Takes a closure and creates an iterator which calls that closure on each element. Read more
Calls a closure on each element of an iterator. Read more
impl<I, P> Iterator for Filter<I, P> where
I: Iterator,
P: FnMut(&<I as Iterator>::Item) -> bool,
type Item = <I as Iterator>::Item;
Creates an iterator which uses a closure to determine if an element should be yielded. Read more
fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where
F: FnMut(Self::Item) -> Option<B>,
impl<B, I, F> Iterator for FilterMap<I, F> where
F: FnMut(<I as Iterator>::Item) -> Option<B>,
I: Iterator,
type Item = B;
Creates an iterator that both filters and maps. Read more
fn enumerate(self) -> Enumerate<Self>
impl<I> Iterator for Enumerate<I> where
I: Iterator,
type Item = (usize, <I as Iterator>::Item);
Creates an iterator which gives the current iteration count as well as the next value. Read more
fn peekable(self) -> Peekable<Self>
impl<I> Iterator for Peekable<I> where
I: Iterator,
type Item = <I as Iterator>::Item;
Creates an iterator which can use the peek and peek_mut methods to look at the next element of the iterator without consuming it. See their documentation for more information. Read more
fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where
P: FnMut(&Self::Item) -> bool,
impl<I, P> Iterator for SkipWhile<I, P> where
I: Iterator,
P: FnMut(&<I as Iterator>::Item) -> bool,
type Item = <I as Iterator>::Item;
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
P: FnMut(&Self::Item) -> bool,
impl<I, P> Iterator for TakeWhile<I, P> where
I: Iterator,
P: FnMut(&<I as Iterator>::Item) -> bool,
type Item = <I as Iterator>::Item;
Creates an iterator that yields elements based on a predicate. Read more
fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P> where
P: FnMut(Self::Item) -> Option<B>,
impl<B, I, P> Iterator for MapWhile<I, P> where
I: Iterator,
P: FnMut(<I as Iterator>::Item) -> Option<B>,
type Item = B;
iter_map_while #68537)recently added
Creates an iterator that both yields elements based on a predicate and maps. Read more
fn skip(self, n: usize) -> Skip<Self>
impl<I> Iterator for Skip<I> where
I: Iterator,
type Item = <I as Iterator>::Item;
Creates an iterator that skips the first n elements. Read more
fn take(self, n: usize) -> Take<Self>
impl<I> Iterator for Take<I> where
I: Iterator,
type Item = <I as Iterator>::Item;
Creates an iterator that yields the first n elements, or fewer if the underlying iterator ends sooner. Read more
fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where
F: FnMut(&mut St, Self::Item) -> Option<B>,
impl<B, I, St, F> Iterator for Scan<I, St, F> where
F: FnMut(&mut St, <I as Iterator>::Item) -> Option<B>,
I: Iterator,
type Item = B;
An iterator adapter similar to fold that holds internal state and produces a new iterator. Read more
fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
F: FnMut(Self::Item) -> U,
U: IntoIterator,
impl<I, U, F> Iterator for FlatMap<I, U, F> where
F: FnMut(<I as Iterator>::Item) -> U,
I: Iterator,
U: IntoIterator,
type Item = <U as IntoIterator>::Item;
Creates an iterator that works like map, but flattens nested structure. Read more
fn flatten(self) -> Flatten<Self> where
Self::Item: IntoIterator,
impl<I, U> Iterator for Flatten<I> where
I: Iterator,
U: Iterator,
<I as Iterator>::Item: IntoIterator,
<<I as Iterator>::Item as IntoIterator>::IntoIter == U,
<<I as Iterator>::Item as IntoIterator>::Item == <U as Iterator>::Item,
type Item = <U as Iterator>::Item;
Creates an iterator that flattens nested structure. Read more
fn fuse(self) -> Fuse<Self>
impl<I> Iterator for Fuse<I> where
I: Iterator,
type Item = <I as Iterator>::Item;
impl<I, F> Iterator for Inspect<I, F> where
F: FnMut(&<I as Iterator>::Item),
I: Iterator,
type Item = <I as Iterator>::Item;
Does something with each element of an iterator, passing the value on. Read more
fn by_ref(&mut self) -> &mut Self
Borrows an iterator, rather than consuming it. Read more
fn collect<B>(self) -> B where
B: FromIterator<Self::Item>,
Transforms an iterator into a collection. Read more
Consumes an iterator, creating two collections from it. Read more
iter_partition_in_place #62543)new API
Reorders the elements of this iterator in-place according to the given predicate, such that all those that return true precede all those that return false. Returns the number of true elements found. Read more
iter_is_partitioned #62544)new API
Checks if the elements of this iterator are partitioned according to the given predicate, such that all those that return true precede all those that return false. Read more
An iterator method that applies a fallible function to each item in the iterator, stopping at the first error and returning that error. Read more
Reduces the elements to a single one, by repeatedly applying a reducing operation. Read more
Tests if every element of the iterator matches a predicate. Read more
Tests if any element of the iterator matches a predicate. Read more
Searches for an element of an iterator that satisfies a predicate. Read more
Applies function to the elements of iterator and returns the first non-none result. Read more
try_find #63178)new API
Applies function to the elements of iterator and returns the first true result or the first error. Read more
Searches for an element in an iterator, returning its index. Read more
fn rposition<P>(&mut self, predicate: P) -> Option<usize> where
Self: ExactSizeIterator + DoubleEndedIterator,
P: FnMut(Self::Item) -> bool,
Searches for an element in an iterator from the right, returning its index. Read more
Returns the element that gives the maximum value from the specified function. Read more
Returns the element that gives the maximum value with respect to the specified comparison function. Read more
Returns the element that gives the minimum value from the specified function. Read more
Returns the element that gives the minimum value with respect to the specified comparison function. Read more
fn rev(self) -> Rev<Self> where
Self: DoubleEndedIterator,
impl<I> Iterator for Rev<I> where
I: DoubleEndedIterator,
type Item = <I as Iterator>::Item;
Reverses an iterator’s direction. Read more
Converts an iterator of pairs into a pair of containers. Read more
fn copied<'a, T>(self) -> Copied<Self> where
Self: Iterator<Item = &'a T>,
T: 'a + Copy,
impl<'a, I, T> Iterator for Copied<I> where
T: 'a + Copy,
I: Iterator<Item = &'a T>,
type Item = T;
Creates an iterator which copies all of its elements. Read more
fn cloned<'a, T>(self) -> Cloned<Self> where
Self: Iterator<Item = &'a T>,
T: 'a + Clone,
impl<'a, I, T> Iterator for Cloned<I> where
T: 'a + Clone,
I: Iterator<Item = &'a T>,
type Item = T;
impl<I> Iterator for Cycle<I> where
I: Clone + Iterator,
type Item = <I as Iterator>::Item;
Repeats an iterator endlessly. Read more
Sums the elements of an iterator. Read more
Iterates over the entire iterator, multiplying all the elements Read more
fn cmp<I>(self, other: I) -> Ordering where
I: IntoIterator<Item = Self::Item>,
Self::Item: Ord,
Lexicographically compares the elements of this Iterator with those of another. Read more
fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering where
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,
I: IntoIterator,
Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function. Read more
fn partial_cmp<I>(self, other: I) -> Option<Ordering> where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Lexicographically compares the elements of this Iterator with those of another. Read more
fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering> where
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,
I: IntoIterator,
Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function. Read more
fn eq<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
fn eq_by<I, F>(self, other: I, eq: F) -> bool where
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,
I: IntoIterator,
Determines if the elements of this Iterator are equal to those of another with respect to the specified equality function. Read more
fn ne<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
fn lt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator are lexicographically less than those of another. Read more
fn le<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator are lexicographically less or equal to those of another. Read more
fn gt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator are lexicographically greater than those of another. Read more
fn ge<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator are lexicographically greater than or equal to those of another. Read more
fn is_sorted(self) -> bool where
Self::Item: PartialOrd<Self::Item>,
is_sorted #53485)new API
Checks if the elements of this iterator are sorted. Read more
is_sorted #53485)new API
Checks if the elements of this iterator are sorted using the given comparator function. Read more
fn is_sorted_by_key<F, K>(self, f: F) -> bool where
F: FnMut(Self::Item) -> K,
K: PartialOrd<K>,
is_sorted #53485)new API
Checks if the elements of this iterator are sorted using the given key extraction function. Read more
pub fn eq(&self, other: &RangeInclusive<Idx>) -> bool
This method tests for self and other values to be equal, and is used by ==. Read more
pub fn ne(&self, other: &RangeInclusive<Idx>) -> bool
This method tests for !=.
impl<'_, T> RangeBounds<T> for RangeInclusive<&'_ T>
pub fn start_bound(&self) -> Bound<&T>
Start index bound. Read more
pub fn end_bound(&self) -> Bound<&T>
End index bound. Read more
fn contains<U>(&self, item: &U) -> bool where
T: PartialOrd<U>,
U: PartialOrd<T> + ?Sized,
Returns true if item is contained in the range. Read more
impl<T> RangeBounds<T> for RangeInclusive<T>
pub fn start_bound(&self) -> Bound<&T>
Start index bound. Read more
pub fn end_bound(&self) -> Bound<&T>
End index bound. Read more
fn contains<U>(&self, item: &U) -> bool where
T: PartialOrd<U>,
U: PartialOrd<T> + ?Sized,
Returns true if item is contained in the range. Read more
impl<T> SliceIndex<[T]> for RangeInclusive<usize>
type Output = [T]
The output type returned by methods.
pub fn get(self, slice: &[T]) -> Option<&[T]>
slice_index_methods)Returns a shared reference to the output at this location, if in bounds. Read more
pub fn get_mut(self, slice: &mut [T]) -> Option<&mut [T]>
slice_index_methods)Returns a mutable reference to the output at this location, if in bounds. Read more
pub unsafe fn get_unchecked(self, slice: *const [T]) -> *const [T]
slice_index_methods)Returns a shared reference to the output at this location, without performing any bounds checking. Calling this method with an out-of-bounds index or a dangling slice pointer is undefined behavior even if the resulting reference is not used. Read more
pub unsafe fn get_unchecked_mut(self, slice: *mut [T]) -> *mut [T]
slice_index_methods)Returns a mutable reference to the output at this location, without performing any bounds checking. Calling this method with an out-of-bounds index or a dangling slice pointer is undefined behavior even if the resulting reference is not used. Read more
pub fn index(self, slice: &[T]) -> &[T]
slice_index_methods)Returns a shared reference to the output at this location, panicking if out of bounds. Read more
pub fn index_mut(self, slice: &mut [T]) -> &mut [T]
slice_index_methods)Returns a mutable reference to the output at this location, panicking if out of bounds. Read more
impl SliceIndex<str> for RangeInclusive<usize>
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]. Equivalent to &self [begin .. end + 1] or &mut self[begin .. end + 1], except if end has the maximum value for usize.
This operation is O(1).
Panics
Panics if begin does not point to the starting byte offset of a character (as defined by is_char_boundary), if end does not point to the ending byte offset of a character (end + 1 is either a starting byte offset or equal to len), if begin > end, or if end >= len.
type Output = str
The output type returned by methods.
pub fn get(
self,
slice: &str
) -> Option<&<RangeInclusive<usize> as SliceIndex<str>>::Output>
slice_index_methods)Returns a shared reference to the output at this location, if in bounds. Read more
pub fn get_mut(
self,
slice: &mut str
) -> Option<&mut <RangeInclusive<usize> as SliceIndex<str>>::Output>
slice_index_methods)Returns a mutable reference to the output at this location, if in bounds. Read more
pub unsafe fn get_unchecked(
self,
slice: *const str
) -> *const <RangeInclusive<usize> as SliceIndex<str>>::Output
slice_index_methods)Returns a shared reference to the output at this location, without performing any bounds checking. Calling this method with an out-of-bounds index or a dangling slice pointer is undefined behavior even if the resulting reference is not used. Read more
pub unsafe fn get_unchecked_mut(
self,
slice: *mut str
) -> *mut <RangeInclusive<usize> as SliceIndex<str>>::Output
slice_index_methods)Returns a mutable reference to the output at this location, without performing any bounds checking. Calling this method with an out-of-bounds index or a dangling slice pointer is undefined behavior even if the resulting reference is not used. Read more
pub fn index(
self,
slice: &str
) -> &<RangeInclusive<usize> as SliceIndex<str>>::Output
impl<A> Iterator for RangeInclusive<A> where
A: Step,
type Item = A;
slice_index_methods)Returns a shared reference to the output at this location, panicking if out of bounds. Read more
pub fn index_mut(
self,
slice: &mut str
) -> &mut <RangeInclusive<usize> as SliceIndex<str>>::Output
impl<A> Iterator for RangeInclusive<A> where
A: Step,
type Item = A;
slice_index_methods)Returns a mutable reference to the output at this location, panicking if out of bounds. Read more
impl<Idx> StructuralEq for RangeInclusive<Idx>
impl<Idx> StructuralPartialEq for RangeInclusive<Idx>
impl<A> TrustedLen for RangeInclusive<A> where
A: TrustedStep,
Auto Trait Implementations
impl<Idx> RefUnwindSafe for RangeInclusive<Idx> where
Idx: RefUnwindSafe,
impl<Idx> Send for RangeInclusive<Idx> where
Idx: Send,
impl<Idx> Sync for RangeInclusive<Idx> where
Idx: Sync,
impl<Idx> Unpin for RangeInclusive<Idx> where
Idx: Unpin,
impl<Idx> UnwindSafe for RangeInclusive<Idx> where
Idx: UnwindSafe,
Blanket Implementations
impl<T> From<T> for T
pub fn from(t: T) -> T
Performs the conversion.
pub fn into(self) -> U
Performs the conversion.
type Item = <I as Iterator>::Item
The type of the elements being iterated over.
type IntoIter = I
Which kind of iterator are we turning this into?
pub fn into_iter(self) -> I
Creates an iterator from a value. Read more
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)
toowned_clone_into #41263)recently added
Uses borrowed data to replace owned data, usually by cloning. Read more
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
Performs the conversion.
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
Performs the conversion.
© 2010 The Rust Project Developers
Licensed under the Apache License, Version 2.0 or the MIT license, at your option.
https://doc.rust-lang.org/std/ops/struct.RangeInclusive.html