Struct std::ops::Range
pub struct Range<Idx> { pub start: Idx, pub end: Idx, }
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
:
assert_eq!((3..5), std::ops::Range { start: 3, end: 5 }); assert_eq!(3 + 4 + 5, (3..6).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 ]); // This is a `Range` assert_eq!(arr[1..=3], [ 1, 2, 3 ]);
Fields
start: Idx
The lower bound of the range (inclusive).
end: Idx
The upper bound of the range (exclusive).
Implementations
impl<Idx> Range<Idx> where
Idx: PartialOrd<Idx>,
pub fn contains<U>(&self, item: &U) -> bool where
Idx: PartialOrd<U>,
U: PartialOrd<Idx> + ?Sized,
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));
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());
Trait Implementations
impl<Idx> Clone for Range<Idx> where
Idx: Clone,
fn clone(&self) -> Range<Idx>
impl<A> Iterator for Range<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
impl<Idx> Debug for Range<Idx> where
Idx: Debug,
fn fmt(&self, fmt: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
impl<Idx> Default for Range<Idx> where
Idx: Default,
fn default() -> Range<Idx>
impl<A> Iterator for Range<A> where A: Step, type Item = A;
Returns the “default value” for a type. Read more
impl<A> DoubleEndedIterator for Range<A> where
A: Step,
fn next_back(&mut self) -> Option<A>
Removes and returns an element from the end of the iterator. Read more
fn nth_back(&mut self, n: usize) -> Option<A>
Returns the n
th element from the end of the iterator. Read more
fn advance_back_by(&mut self, n: usize) -> Result<(), usize>
Advances the iterator from the back by n
elements. Read more
fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R where
F: FnMut(B, Self::Item) -> R,
R: Try<Output = B>,
This is the reverse version of Iterator::try_fold()
: it takes elements starting from the back of the iterator. Read more
fn rfold<B, F>(self, init: B, f: F) -> B where
F: FnMut(B, Self::Item) -> B,
An iterator method that reduces the iterator’s elements to a single, final value, starting from the back. Read more
fn rfind<P>(&mut self, predicate: P) -> Option<Self::Item> where
P: FnMut(&Self::Item) -> bool,
Searches for an element of an iterator from the back that satisfies a predicate. Read more
impl ExactSizeIterator for Range<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 ExactSizeIterator for Range<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 Range<u32>
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 Range<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 Range<i32>
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 Range<isize>
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 Range<usize>
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 Range<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<Idx> Hash for Range<Idx> where
Idx: Hash,
fn hash<__H>(&self, state: &mut __H) where
__H: Hasher,
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
impl Index<Range<usize>> for String
type Output = str
The returned type after indexing.
fn index(&self, index: Range<usize>) -> &str
Performs the indexing (container[index]
) operation. Read more
impl IndexMut<Range<usize>> for String
fn index_mut(&mut self, index: Range<usize>) -> &mut str
Performs the mutable indexing (container[index]
) operation. Read more
impl<A> Iterator for Range<A> where
A: Step,
type Item = A
The type of the elements being iterated over.
fn next(&mut self) -> Option<A>
Advances the iterator and returns the next value. Read more
fn size_hint(&self) -> (usize, Option<usize>)
Returns the bounds on the remaining length of the iterator. Read more
fn nth(&mut self, n: usize) -> Option<A>
Returns the n
th element of the iterator. Read more
fn last(self) -> Option<A>
Consumes the iterator, returning the last element. Read more
fn min(self) -> Option<A>
Returns the minimum element of an iterator. Read more
fn max(self) -> Option<A>
Returns the maximum element of an iterator. Read more
fn is_sorted(self) -> bool
Checks if the elements of this iterator are sorted. Read more
fn advance_by(&mut self, n: usize) -> Result<(), usize>
Advances the iterator by n
elements. Read more
fn count(self) -> usize
Consumes the iterator, counting the number of iterations and returning it. 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 A: Iterator, B: Iterator<Item = <A as Iterator>::Item>, 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 A: Iterator, B: Iterator, type Item = (<A as Iterator>::Item, <B as Iterator>::Item);
‘Zips up’ two iterators into a single iterator of pairs. Read more
fn intersperse(self, separator: Self::Item) -> Intersperse<Self> where
Self::Item: Clone,
impl<I> Iterator for Intersperse<I> where I: Iterator, <I as Iterator>::Item: Clone, type Item = <I as Iterator>::Item;
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;
Creates a new iterator which places an item generated by separator
between adjacent items of the original iterator. Read more
fn map<B, F>(self, f: F) -> Map<Self, F> where
F: FnMut(Self::Item) -> B,
impl<B, I, F> Iterator for Map<I, F> where I: Iterator, F: FnMut(<I as Iterator>::Item) -> B, type Item = B;
Takes a closure and creates an iterator which calls that closure on each element. Read more
fn for_each<F>(self, f: F) where
F: FnMut(Self::Item),
Calls a closure on each element of an iterator. Read more
fn filter<P>(self, predicate: P) -> Filter<Self, P> where
P: FnMut(&Self::Item) -> bool,
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 I: Iterator, F: FnMut(<I as Iterator>::Item) -> Option<B>, 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;
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 I: Iterator, F: FnMut(&mut St, <I as Iterator>::Item) -> Option<B>, 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
U: IntoIterator,
F: FnMut(Self::Item) -> U,
impl<I, U, F> Iterator for FlatMap<I, U, F> where I: Iterator, U: IntoIterator, F: FnMut(<I as Iterator>::Item) -> U, 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;
fn inspect<F>(self, f: F) -> Inspect<Self, F> where
F: FnMut(&Self::Item),
impl<I, F> Iterator for Inspect<I, F> where I: Iterator, F: FnMut(&<I as Iterator>::Item), 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
fn try_collect<B>(
&mut self
) -> <<Self::Item as Try>::Residual as Residual<B>>::TryType where
B: FromIterator<<Self::Item as Try>::Output>,
Self::Item: Try,
<Self::Item as Try>::Residual: Residual<B>,
Fallibly transforms an iterator into a collection, short circuiting if a failure is encountered. Read more
fn collect_into<E>(self, collection: &mut E) -> &mut E where
E: Extend<Self::Item>,
Collects all the items from an iterator into a collection. Read more
fn partition<B, F>(self, f: F) -> (B, B) where
B: Default + Extend<Self::Item>,
F: FnMut(&Self::Item) -> bool,
Consumes an iterator, creating two collections from it. Read more
fn partition_in_place<'a, T, P>(self, predicate: P) -> usize where
T: 'a,
Self: DoubleEndedIterator<Item = &'a mut T>,
P: FnMut(&T) -> bool,
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
fn is_partitioned<P>(self, predicate: P) -> bool where
P: FnMut(Self::Item) -> bool,
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
fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where
F: FnMut(B, Self::Item) -> R,
R: Try<Output = B>,
An iterator method that applies a function as long as it returns successfully, producing a single, final value. Read more
fn try_for_each<F, R>(&mut self, f: F) -> R where
F: FnMut(Self::Item) -> R,
R: Try<Output = ()>,
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
fn fold<B, F>(self, init: B, f: F) -> B where
F: FnMut(B, Self::Item) -> B,
Folds every element into an accumulator by applying an operation, returning the final result. Read more
fn reduce<F>(self, f: F) -> Option<Self::Item> where
F: FnMut(Self::Item, Self::Item) -> Self::Item,
Reduces the elements to a single one, by repeatedly applying a reducing operation. Read more
fn try_reduce<F, R>(
&mut self,
f: F
) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryType where
F: FnMut(Self::Item, Self::Item) -> R,
R: Try<Output = Self::Item>,
<R as Try>::Residual: Residual<Option<Self::Item>>,
Reduces the elements to a single one by repeatedly applying a reducing operation. If the closure returns a failure, the failure is propagated back to the caller immediately. Read more
fn all<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,
Tests if every element of the iterator matches a predicate. Read more
fn any<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,
Tests if any element of the iterator matches a predicate. Read more
fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where
P: FnMut(&Self::Item) -> bool,
Searches for an element of an iterator that satisfies a predicate. Read more
fn find_map<B, F>(&mut self, f: F) -> Option<B> where
F: FnMut(Self::Item) -> Option<B>,
Applies function to the elements of iterator and returns the first non-none result. Read more
fn try_find<F, R>(
&mut self,
f: F
) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryType where
F: FnMut(&Self::Item) -> R,
R: Try<Output = bool>,
<R as Try>::Residual: Residual<Option<Self::Item>>,
Applies function to the elements of iterator and returns the first true result or the first error. Read more
fn position<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
Searches for an element in an iterator, returning its index. Read more
fn rposition<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
Self: ExactSizeIterator + DoubleEndedIterator,
Searches for an element in an iterator from the right, returning its index. Read more
fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where
B: Ord,
F: FnMut(&Self::Item) -> B,
Returns the element that gives the maximum value from the specified function. Read more
fn max_by<F>(self, compare: F) -> Option<Self::Item> where
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Returns the element that gives the maximum value with respect to the specified comparison function. Read more
fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where
B: Ord,
F: FnMut(&Self::Item) -> B,
Returns the element that gives the minimum value from the specified function. Read more
fn min_by<F>(self, compare: F) -> Option<Self::Item> where
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
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
fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Iterator<Item = (A, B)>,
Converts an iterator of pairs into a pair of containers. Read more
fn copied<'a, T>(self) -> Copied<Self> where
T: 'a + Copy,
Self: Iterator<Item = &'a T>,
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
T: 'a + Clone,
Self: Iterator<Item = &'a T>,
impl<'a, I, T> Iterator for Cloned<I> where T: 'a + Clone, I: Iterator<Item = &'a T>, type Item = T;
fn cycle(self) -> Cycle<Self> where
Self: Clone,
impl<I> Iterator for Cycle<I> where I: Clone + Iterator, type Item = <I as Iterator>::Item;
Repeats an iterator endlessly. Read more
fn sum<S>(self) -> S where
S: Sum<Self::Item>,
Sums the elements of an iterator. Read more
fn product<P>(self) -> P where
P: Product<Self::Item>,
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
I: IntoIterator,
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,
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
I: IntoIterator,
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,
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
I: IntoIterator,
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,
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_by<F>(self, compare: F) -> bool where
F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,
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>,
Checks if the elements of this iterator are sorted using the given key extraction function. Read more
impl<Idx> PartialEq<Range<Idx>> for Range<Idx> where
Idx: PartialEq<Idx>,
fn eq(&self, other: &Range<Idx>) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &Range<Idx>) -> bool
This method tests for !=
.
impl<T> RangeBounds<T> for Range<T>
fn start_bound(&self) -> Bound<&T>
Start index bound. Read more
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 Range<&'_ T>
fn start_bound(&self) -> Bound<&T>
Start index bound. Read more
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 Range<usize>
type Output = [T]
The output type returned by methods.
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
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
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
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
fn index(self, slice: &[T]) -> &[T]
impl Read for &[u8] impl Write for &mut [u8]
slice_index_methods
)
Returns a shared reference to the output at this location, panicking if out of bounds. Read more
fn index_mut(self, slice: &mut [T]) -> &mut [T]
impl Read for &[u8] impl Write for &mut [u8]
slice_index_methods
)
Returns a mutable reference to the output at this location, panicking if out of bounds. Read more
impl SliceIndex<str> for Range<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
).
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
let s = "Löwe 老虎 Léopard"; assert_eq!(&s[0 .. 1], "L"); assert_eq!(&s[1 .. 9], "öwe 老"); // these will panic: // byte 2 lies within `ö`: // &s[2 ..3]; // byte 8 lies within `老` // &s[1 .. 8]; // byte 100 is outside the string // &s[3 .. 100];
type Output = str
The output type returned by methods.
fn get(self, slice: &str) -> Option<&<Range<usize> as SliceIndex<str>>::Output>
slice_index_methods
)
Returns a shared reference to the output at this location, if in bounds. Read more
fn get_mut(
self,
slice: &mut str
) -> Option<&mut <Range<usize> as SliceIndex<str>>::Output>
slice_index_methods
)
Returns a mutable reference to the output at this location, if in bounds. Read more
unsafe fn get_unchecked(
self,
slice: *const str
) -> *const <Range<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
unsafe fn get_unchecked_mut(
self,
slice: *mut str
) -> *mut <Range<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
fn index(self, slice: &str) -> &<Range<usize> as SliceIndex<str>>::Output
impl<A> Iterator for Range<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
fn index_mut(
self,
slice: &mut str
) -> &mut <Range<usize> as SliceIndex<str>>::Output
impl<A> Iterator for Range<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> Eq for Range<Idx> where
Idx: Eq,
impl<A> FusedIterator for Range<A> where
A: Step,
impl<Idx> StructuralEq for Range<Idx>
impl<Idx> StructuralPartialEq for Range<Idx>
impl<A> TrustedLen for Range<A> where
A: TrustedStep,
Auto Trait Implementations
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
impl<T> Any for T where
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<T> From<T> for T
impl<T, U> Into<U> for T where
U: From<T>,
fn into(self) -> U
Calls U::from(self)
.
That is, this conversion is whatever the implementation of From<T> for U
chooses to do.
impl<I> IntoIterator for I where
I: Iterator,
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?
fn into_iter(self) -> I
Creates an iterator from a value. Read more
impl<T> ToOwned for T where
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
Creates owned data from borrowed data, usually by cloning. Read more
fn clone_into(&self, target: &mut T)
Uses borrowed data to replace owned data, usually by cloning. Read more
impl<T, U> TryFrom<U> for T where
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
Performs the conversion.
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
© 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.Range.html