Struct std::ops::Range 1.0.0[−][src]
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 x >= start and
x < end. It is empty unless start < end.
Examples
assert_eq!((3..5), std::ops::Range { start: 3, end: 5 }); assert_eq!(3 + 4 + 5, (3..6).sum()); let arr = ['a', 'b', 'c', 'd']; assert_eq!(arr[ .. ], ['a', 'b', 'c', 'd']); assert_eq!(arr[ ..3], ['a', 'b', 'c', ]); assert_eq!(arr[1.. ], [ 'b', 'c', 'd']); assert_eq!(arr[1..3], [ 'b', 'c' ]); // RangeRun
Fields
start: Idx
The lower bound of the range (inclusive).
end: Idx
The upper bound of the range (exclusive).
Methods
impl<Idx> Range<Idx> where
Idx: PartialOrd<Idx>, [src]
impl<Idx> Range<Idx> where
Idx: PartialOrd<Idx>, pub fn contains<U>(&self, item: &U) -> bool where
Idx: PartialOrd<U>,
U: PartialOrd<Idx> + ?Sized, [src]
pub fn contains<U>(&self, item: &U) -> bool where
Idx: PartialOrd<U>,
U: PartialOrd<Idx> + ?Sized, 🔬 This is a nightly-only experimental API. (range_contains #32311)
recently added as per RFC
Returns true if item is contained in the range.
Examples
#![feature(range_contains)] use std::f32; 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));Run
pub fn is_empty(&self) -> bool[src]
pub fn is_empty(&self) -> bool🔬 This is a nightly-only experimental API. (range_is_empty #48111)
recently added
Returns true if the range contains no items.
Examples
#![feature(range_is_empty)] assert!(!(3..5).is_empty()); assert!( (3..3).is_empty()); assert!( (3..2).is_empty());Run
The range is empty if either side is incomparable:
#![feature(range_is_empty)] use std::f32::NAN; assert!(!(3.0..5.0).is_empty()); assert!( (3.0..NAN).is_empty()); assert!( (NAN..5.0).is_empty());Run
Trait Implementations
impl<T> RangeBounds<T> for Range<T>1.28.0[src]
impl<T> RangeBounds<T> for Range<T>fn start_bound(&self) -> Bound<&T>[src]
fn start_bound(&self) -> Bound<&T>Start index bound. Read more
fn end_bound(&self) -> Bound<&T>[src]
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, [src]
fn contains<U>(&self, item: &U) -> bool where
T: PartialOrd<U>,
U: PartialOrd<T> + ?Sized, 🔬 This is a nightly-only experimental API. (range_contains #32311)
recently added as per RFC
Returns true if item is contained in the range. Read more
impl<'a, T> RangeBounds<T> for Range<&'a T>1.28.0[src]
impl<'a, T> RangeBounds<T> for Range<&'a T>fn start_bound(&self) -> Bound<&T>[src]
fn start_bound(&self) -> Bound<&T>Start index bound. Read more
fn end_bound(&self) -> Bound<&T>[src]
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, [src]
fn contains<U>(&self, item: &U) -> bool where
T: PartialOrd<U>,
U: PartialOrd<T> + ?Sized, 🔬 This is a nightly-only experimental API. (range_contains #32311)
recently added as per RFC
Returns true if item is contained in the range. Read more
impl<Idx> Hash for Range<Idx> where
Idx: Hash, [src]
impl<Idx> Hash for Range<Idx> where
Idx: Hash, fn hash<__HIdx>(&self, state: &mut __HIdx) where
__HIdx: Hasher, [src]
fn hash<__HIdx>(&self, state: &mut __HIdx) where
__HIdx: Hasher, Feeds this value into the given [Hasher]. Read more
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher, 1.3.0[src]
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher, Feeds a slice of this type into the given [Hasher]. Read more
impl TrustedLen for Range<i8>[src]
impl TrustedLen for Range<i8>impl TrustedLen for Range<i32>[src]
impl TrustedLen for Range<i32>impl TrustedLen for Range<i16>[src]
impl TrustedLen for Range<i16>impl TrustedLen for Range<usize>[src]
impl TrustedLen for Range<usize>impl TrustedLen for Range<isize>[src]
impl TrustedLen for Range<isize>impl TrustedLen for Range<u64>[src]
impl TrustedLen for Range<u64>impl TrustedLen for Range<u16>[src]
impl TrustedLen for Range<u16>impl TrustedLen for Range<u32>[src]
impl TrustedLen for Range<u32>impl TrustedLen for Range<i64>[src]
impl TrustedLen for Range<i64>impl TrustedLen for Range<u8>[src]
impl TrustedLen for Range<u8>impl ExactSizeIterator for Range<u8>[src]
impl ExactSizeIterator for Range<u8>fn len(&self) -> usize[src]
fn len(&self) -> usizeReturns the exact number of times the iterator will iterate. Read more
fn is_empty(&self) -> bool[src]
fn is_empty(&self) -> boolReturns whether the iterator is empty. Read more
impl ExactSizeIterator for Range<i32>[src]
impl ExactSizeIterator for Range<i32>fn len(&self) -> usize[src]
fn len(&self) -> usizeReturns the exact number of times the iterator will iterate. Read more
fn is_empty(&self) -> bool[src]
fn is_empty(&self) -> boolReturns whether the iterator is empty. Read more
impl ExactSizeIterator for Range<usize>[src]
impl ExactSizeIterator for Range<usize>fn len(&self) -> usize[src]
fn len(&self) -> usizeReturns the exact number of times the iterator will iterate. Read more
fn is_empty(&self) -> bool[src]
fn is_empty(&self) -> boolReturns whether the iterator is empty. Read more
impl ExactSizeIterator for Range<i16>[src]
impl ExactSizeIterator for Range<i16>fn len(&self) -> usize[src]
fn len(&self) -> usizeReturns the exact number of times the iterator will iterate. Read more
fn is_empty(&self) -> bool[src]
fn is_empty(&self) -> boolReturns whether the iterator is empty. Read more
impl ExactSizeIterator for Range<isize>[src]
impl ExactSizeIterator for Range<isize>fn len(&self) -> usize[src]
fn len(&self) -> usizeReturns the exact number of times the iterator will iterate. Read more
fn is_empty(&self) -> bool[src]
fn is_empty(&self) -> boolReturns whether the iterator is empty. Read more
impl ExactSizeIterator for Range<u32>[src]
impl ExactSizeIterator for Range<u32>fn len(&self) -> usize[src]
fn len(&self) -> usizeReturns the exact number of times the iterator will iterate. Read more
fn is_empty(&self) -> bool[src]
fn is_empty(&self) -> boolReturns whether the iterator is empty. Read more
impl ExactSizeIterator for Range<u16>[src]
impl ExactSizeIterator for Range<u16>fn len(&self) -> usize[src]
fn len(&self) -> usizeReturns the exact number of times the iterator will iterate. Read more
fn is_empty(&self) -> bool[src]
fn is_empty(&self) -> boolReturns whether the iterator is empty. Read more
impl ExactSizeIterator for Range<i8>[src]
impl ExactSizeIterator for Range<i8>fn len(&self) -> usize[src]
fn len(&self) -> usizeReturns the exact number of times the iterator will iterate. Read more
fn is_empty(&self) -> bool[src]
fn is_empty(&self) -> boolReturns whether the iterator is empty. Read more
impl<Idx> Clone for Range<Idx> where
Idx: Clone, [src]
impl<Idx> Clone for Range<Idx> where
Idx: Clone, ⓘImportant traits for Range<A>fn clone(&self) -> Range<Idx>[src]
fn clone(&self) -> Range<Idx>Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)[src]
fn clone_from(&mut self, source: &Self)Performs copy-assignment from source. Read more
impl<Idx> Debug for Range<Idx> where
Idx: Debug, [src]
impl<Idx> Debug for Range<Idx> where
Idx: Debug, fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>[src]
fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>Formats the value using the given formatter. Read more
impl IndexMut<Range<usize>> for str1.3.0[src]
impl IndexMut<Range<usize>> for strImplements mutable substring slicing with syntax
&mut self[begin .. end].
Returns a mutable slice of the given string from the byte range
[begin..end).
This operation is O(1).
Panics
Panics if begin or end does not point to the starting
byte offset of a character (as defined by is_char_boundary).
Requires that begin <= end and end <= len where len is the
length of the string.
fn index_mut(&mut self, index: Range<usize>) -> &mut str[src]
fn index_mut(&mut self, index: Range<usize>) -> &mut strPerforms the mutable indexing (container[index]) operation.
impl Index<Range<usize>> for str[src]
impl Index<Range<usize>> for strImplements substring slicing with syntax &self[begin .. end].
Returns a slice of the given string from the byte range
[begin..end).
This operation is O(1).
Panics
Panics if begin or end does not point to the starting
byte offset of a character (as defined by is_char_boundary).
Requires that begin <= end and end <= len where len is the
length of the string.
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];Run
type Output = str
The returned type after indexing.
fn index(&self, index: Range<usize>) -> &str[src]
fn index(&self, index: Range<usize>) -> &strPerforms the indexing (container[index]) operation.
impl<Idx> Eq for Range<Idx> where
Idx: Eq, [src]
impl<Idx> Eq for Range<Idx> where
Idx: Eq, impl<T> SliceIndex<[T]> for Range<usize>1.15.0[src]
impl<T> SliceIndex<[T]> for Range<usize>type Output = [T]
The output type returned by methods.
fn get(self, slice: &[T]) -> Option<&[T]>[src]
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]>[src]
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: &[T]) -> &[T][src]
unsafe fn get_unchecked(self, slice: &[T]) -> &[T]slice_index_methods)Returns a shared reference to the output at this location, without performing any bounds checking. Read more
unsafe fn get_unchecked_mut(self, slice: &mut [T]) -> &mut [T][src]
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. Read more
fn index(self, slice: &[T]) -> &[T][src]
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
fn index_mut(self, slice: &mut [T]) -> &mut [T][src]
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 Range<usize>1.20.0[src]
impl SliceIndex<str> for Range<usize>type Output = str
The output type returned by methods.
fn get(self, slice: &str) -> Option<&<Range<usize> as SliceIndex<str>>::Output>[src]
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>[src]
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
ⓘImportant traits for Range<A>unsafe fn get_unchecked(
self,
slice: &str
) -> &<Range<usize> as SliceIndex<str>>::Output[src]
unsafe fn get_unchecked(
self,
slice: &str
) -> &<Range<usize> as SliceIndex<str>>::Outputslice_index_methods)Returns a shared reference to the output at this location, without performing any bounds checking. Read more
ⓘImportant traits for Range<A>unsafe fn get_unchecked_mut(
self,
slice: &mut str
) -> &mut <Range<usize> as SliceIndex<str>>::Output[src]
unsafe fn get_unchecked_mut(
self,
slice: &mut str
) -> &mut <Range<usize> as SliceIndex<str>>::Outputslice_index_methods)Returns a mutable reference to the output at this location, without performing any bounds checking. Read more
ⓘImportant traits for Range<A>fn index(self, slice: &str) -> &<Range<usize> as SliceIndex<str>>::Output[src]
fn index(self, slice: &str) -> &<Range<usize> as SliceIndex<str>>::Outputslice_index_methods)Returns a shared reference to the output at this location, panicking if out of bounds. Read more
ⓘImportant traits for Range<A>fn index_mut(
self,
slice: &mut str
) -> &mut <Range<usize> as SliceIndex<str>>::Output[src]
fn index_mut(
self,
slice: &mut str
) -> &mut <Range<usize> as SliceIndex<str>>::Outputslice_index_methods)Returns a mutable reference to the output at this location, panicking if out of bounds. Read more
impl<Idx> PartialEq<Range<Idx>> for Range<Idx> where
Idx: PartialEq<Idx>, [src]
impl<Idx> PartialEq<Range<Idx>> for Range<Idx> where
Idx: PartialEq<Idx>, fn eq(&self, other: &Range<Idx>) -> bool[src]
fn eq(&self, other: &Range<Idx>) -> boolThis method tests for self and other values to be equal, and is used by ==. Read more
fn ne(&self, other: &Range<Idx>) -> bool[src]
fn ne(&self, other: &Range<Idx>) -> boolThis method tests for !=.
impl<A> FusedIterator for Range<A> where
A: Step, 1.26.0[src]
impl<A> FusedIterator for Range<A> where
A: Step, impl<A> Iterator for Range<A> where
A: Step, [src]
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>[src]
fn next(&mut self) -> Option<A>Advances the iterator and returns the next value. Read more
fn size_hint(&self) -> (usize, Option<usize>)[src]
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>[src]
fn nth(&mut self, n: usize) -> Option<A>Returns the nth element of the iterator. Read more
fn last(self) -> Option<A>[src]
fn last(self) -> Option<A>Consumes the iterator, returning the last element. Read more
fn min(self) -> Option<A>[src]
fn min(self) -> Option<A>Returns the minimum element of an iterator. Read more
fn max(self) -> Option<A>[src]
fn max(self) -> Option<A>Returns the maximum element of an iterator. Read more
fn count(self) -> usize[src]
fn count(self) -> usizeConsumes the iterator, counting the number of iterations and returning it. Read more
ⓘImportant traits for StepBy<I>fn step_by(self, step: usize) -> StepBy<Self>1.28.0[src]
fn step_by(self, step: usize) -> StepBy<Self>Creates an iterator starting at the same point, but stepping by the given amount at each iteration. Read more
ⓘImportant traits for Chain<A, B>fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator<Item = Self::Item>, [src]
fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator<Item = Self::Item>, Takes two iterators and creates a new iterator over both in sequence. Read more
ⓘImportant traits for Zip<A, B>fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator, [src]
fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator, 'Zips up' two iterators into a single iterator of pairs. Read more
ⓘImportant traits for Map<I, F>fn map<B, F>(self, f: F) -> Map<Self, F> where
F: FnMut(Self::Item) -> B, [src]
fn map<B, F>(self, f: F) -> Map<Self, F> where
F: FnMut(Self::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), 1.21.0[src]
fn for_each<F>(self, f: F) where
F: FnMut(Self::Item), Calls a closure on each element of an iterator. Read more
ⓘImportant traits for Filter<I, P>fn filter<P>(self, predicate: P) -> Filter<Self, P> where
P: FnMut(&Self::Item) -> bool, [src]
fn filter<P>(self, predicate: P) -> Filter<Self, P> where
P: FnMut(&Self::Item) -> bool, Creates an iterator which uses a closure to determine if an element should be yielded. Read more
ⓘImportant traits for FilterMap<I, F>fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where
F: FnMut(Self::Item) -> Option<B>, [src]
fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where
F: FnMut(Self::Item) -> Option<B>, Creates an iterator that both filters and maps. Read more
ⓘImportant traits for Enumerate<I>fn enumerate(self) -> Enumerate<Self>[src]
fn enumerate(self) -> Enumerate<Self>Creates an iterator which gives the current iteration count as well as the next value. Read more
ⓘImportant traits for Peekable<I>fn peekable(self) -> Peekable<Self>[src]
fn peekable(self) -> Peekable<Self>Creates an iterator which can use peek to look at the next element of the iterator without consuming it. Read more
ⓘImportant traits for SkipWhile<I, P>fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where
P: FnMut(&Self::Item) -> bool, [src]
fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where
P: FnMut(&Self::Item) -> bool, Creates an iterator that [skip]s elements based on a predicate. Read more
ⓘImportant traits for TakeWhile<I, P>fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
P: FnMut(&Self::Item) -> bool, [src]
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
P: FnMut(&Self::Item) -> bool, Creates an iterator that yields elements based on a predicate. Read more
ⓘImportant traits for Skip<I>fn skip(self, n: usize) -> Skip<Self>[src]
fn skip(self, n: usize) -> Skip<Self>Creates an iterator that skips the first n elements. Read more
ⓘImportant traits for Take<I>fn take(self, n: usize) -> Take<Self>[src]
fn take(self, n: usize) -> Take<Self>Creates an iterator that yields its first n elements. Read more
ⓘImportant traits for Scan<I, St, F>fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where
F: FnMut(&mut St, Self::Item) -> Option<B>, [src]
fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where
F: FnMut(&mut St, Self::Item) -> Option<B>, An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more
ⓘImportant traits for FlatMap<I, U, F>fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
F: FnMut(Self::Item) -> U,
U: IntoIterator, [src]
fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
F: FnMut(Self::Item) -> U,
U: IntoIterator, Creates an iterator that works like map, but flattens nested structure. Read more
ⓘImportant traits for Flatten<I>fn flatten(self) -> Flatten<Self> where
Self::Item: IntoIterator, 1.29[src]
fn flatten(self) -> Flatten<Self> where
Self::Item: IntoIterator, Creates an iterator that flattens nested structure. Read more
ⓘImportant traits for Fuse<I>fn fuse(self) -> Fuse<Self>[src]
fn fuse(self) -> Fuse<Self>Creates an iterator which ends after the first [None]. Read more
ⓘImportant traits for Inspect<I, F>fn inspect<F>(self, f: F) -> Inspect<Self, F> where
F: FnMut(&Self::Item), [src]
fn inspect<F>(self, f: F) -> Inspect<Self, F> where
F: FnMut(&Self::Item), Do something with each element of an iterator, passing the value on. Read more
ⓘImportant traits for &'a mut Ifn by_ref(&mut self) -> &mut Self[src]
fn by_ref(&mut self) -> &mut SelfBorrows an iterator, rather than consuming it. Read more
#[must_use = "if you really need to exhaust the iterator, consider `.for_each(drop)` instead"]
fn collect<B>(self) -> B where
B: FromIterator<Self::Item>, [src]
#[must_use = "if you really need to exhaust the iterator, consider `.for_each(drop)` instead"]
fn collect<B>(self) -> B where
B: FromIterator<Self::Item>, Transforms 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, [src]
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 try_fold<B, F, R>(&mut self, init: B, f: F) -> R where
F: FnMut(B, Self::Item) -> R,
R: Try<Ok = B>, 1.27.0[src]
fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where
F: FnMut(B, Self::Item) -> R,
R: Try<Ok = 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<Ok = ()>, 1.27.0[src]
fn try_for_each<F, R>(&mut self, f: F) -> R where
F: FnMut(Self::Item) -> R,
R: Try<Ok = ()>, 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, [src]
fn fold<B, F>(self, init: B, f: F) -> B where
F: FnMut(B, Self::Item) -> B, An iterator method that applies a function, producing a single, final value. Read more
fn all<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool, [src]
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, [src]
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, [src]
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>, [src]
fn find_map<B, F>(&mut self, f: F) -> Option<B> where
F: FnMut(Self::Item) -> Option<B>, 🔬 This is a nightly-only experimental API. (iterator_find_map #49602)
unstable new API
Applies function to the elements of iterator and returns the first non-none result. Read more
fn position<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool, [src]
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, [src]
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, 1.6.0[src]
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, 1.15.0[src]
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, 1.6.0[src]
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, 1.15.0[src]
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
ⓘImportant traits for Rev<I>fn rev(self) -> Rev<Self> where
Self: DoubleEndedIterator, [src]
fn rev(self) -> Rev<Self> where
Self: DoubleEndedIterator, 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)>, [src]
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
ⓘImportant traits for Cloned<I>fn cloned<'a, T>(self) -> Cloned<Self> where
Self: Iterator<Item = &'a T>,
T: 'a + Clone, [src]
fn cloned<'a, T>(self) -> Cloned<Self> where
Self: Iterator<Item = &'a T>,
T: 'a + Clone, Creates an iterator which [clone]s all of its elements. Read more
ⓘImportant traits for Cycle<I>fn cycle(self) -> Cycle<Self> where
Self: Clone, [src]
fn cycle(self) -> Cycle<Self> where
Self: Clone, Repeats an iterator endlessly. Read more
fn sum<S>(self) -> S where
S: Sum<Self::Item>, 1.11.0[src]
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>, 1.11.0[src]
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, 1.5.0[src]
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 partial_cmp<I>(self, other: I) -> Option<Ordering> where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>, 1.5.0[src]
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 eq<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>, 1.5.0[src]
fn eq<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>, Determines if the elements of this Iterator are equal to those of another. Read more
fn ne<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>, 1.5.0[src]
fn ne<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>, Determines if the elements of this Iterator are unequal to those of another. Read more
fn lt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>, 1.5.0[src]
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>, 1.5.0[src]
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>, 1.5.0[src]
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>, 1.5.0[src]
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
impl<A> DoubleEndedIterator for Range<A> where
A: Step, [src]
impl<A> DoubleEndedIterator for Range<A> where
A: Step, fn next_back(&mut self) -> Option<A>[src]
fn next_back(&mut self) -> Option<A>Removes and returns an element from the end of the iterator. Read more
fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R where
F: FnMut(B, Self::Item) -> R,
R: Try<Ok = B>, 1.27.0[src]
fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R where
F: FnMut(B, Self::Item) -> R,
R: Try<Ok = B>, This is the reverse version of [try_fold()]: it takes elements starting from the back of the iterator. Read more
fn rfold<B, F>(self, accum: B, f: F) -> B where
F: FnMut(B, Self::Item) -> B, 1.27.0[src]
fn rfold<B, F>(self, accum: 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, 1.27.0[src]
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 Index<Range<usize>> for String[src]
impl Index<Range<usize>> for Stringtype Output = str
The returned type after indexing.
fn index(&self, index: Range<usize>) -> &str[src]
fn index(&self, index: Range<usize>) -> &strPerforms the indexing (container[index]) operation.
impl IndexMut<Range<usize>> for String1.3.0[src]
impl IndexMut<Range<usize>> for String