Struct core::slice::Windows 1.0.0[−][src]
pub struct Windows<'a, T: 'a> { /* fields omitted */ }An iterator over overlapping subslices of length size.
Trait Implementations
impl<'a, T: Debug + 'a> Debug for Windows<'a, T>[src]
impl<'a, T: Debug + 'a> Debug for Windows<'a, T>fn fmt(&self, f: &mut Formatter) -> Result[src]
fn fmt(&self, f: &mut Formatter) -> ResultFormats the value using the given formatter. Read more
impl<'a, T> Clone for Windows<'a, T>[src]
impl<'a, T> Clone for Windows<'a, T>ⓘImportant traits for Windows<'a, T>fn clone(&self) -> Windows<'a, T>[src]
fn clone(&self) -> Windows<'a, T>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<'a, T> Iterator for Windows<'a, T>[src]
impl<'a, T> Iterator for Windows<'a, T>type Item = &'a [T]
The type of the elements being iterated over.
fn next(&mut self) -> Option<&'a [T]>[src]
fn next(&mut self) -> Option<&'a [T]>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 count(self) -> usize[src]
fn count(self) -> usizeConsumes the iterator, counting the number of iterations and returning it. Read more
fn nth(&mut self, n: usize) -> Option<Self::Item>[src]
fn nth(&mut self, n: usize) -> Option<Self::Item>Returns the nth element of the iterator. Read more
fn last(self) -> Option<Self::Item>[src]
fn last(self) -> Option<Self::Item>Consumes the iterator, returning the last element. Read more
ⓘImportant traits for StepBy<I>fn step_by(self, step: usize) -> StepBy<Self> where
Self: Sized, 1.28.0[src]
fn step_by(self, step: usize) -> StepBy<Self> where
Self: Sized, 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::IntoIter> where
Self: Sized,
U: IntoIterator<Item = Self::Item>, [src]
fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where
Self: Sized,
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::IntoIter> where
Self: Sized,
U: IntoIterator, [src]
fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where
Self: Sized,
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
Self: Sized,
F: FnMut(Self::Item) -> B, [src]
fn map<B, F>(self, f: F) -> Map<Self, F> where
Self: Sized,
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
Self: Sized,
F: FnMut(Self::Item), 1.21.0[src]
fn for_each<F>(self, f: F) where
Self: Sized,
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
Self: Sized,
P: FnMut(&Self::Item) -> bool, [src]
fn filter<P>(self, predicate: P) -> Filter<Self, P> where
Self: Sized,
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
Self: Sized,
F: FnMut(Self::Item) -> Option<B>, [src]
fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where
Self: Sized,
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> where
Self: Sized, [src]
fn enumerate(self) -> Enumerate<Self> where
Self: Sized, 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> where
Self: Sized, [src]
fn peekable(self) -> Peekable<Self> where
Self: Sized, 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
Self: Sized,
P: FnMut(&Self::Item) -> bool, [src]
fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where
Self: Sized,
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
Self: Sized,
P: FnMut(&Self::Item) -> bool, [src]
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
Self: Sized,
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> where
Self: Sized, [src]
fn skip(self, n: usize) -> Skip<Self> where
Self: Sized, Creates an iterator that skips the first n elements. Read more
ⓘImportant traits for Take<I>fn take(self, n: usize) -> Take<Self> where
Self: Sized, [src]
fn take(self, n: usize) -> Take<Self> where
Self: Sized, 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
Self: Sized,
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
Self: Sized,
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
Self: Sized,
U: IntoIterator,
F: FnMut(Self::Item) -> U, [src]
fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
Self: Sized,
U: IntoIterator,
F: FnMut(Self::Item) -> U, 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: Sized,
Self::Item: IntoIterator, 1.29[src]
fn flatten(self) -> Flatten<Self> where
Self: Sized,
Self::Item: IntoIterator, Creates an iterator that flattens nested structure. Read more
ⓘImportant traits for Fuse<I>fn fuse(self) -> Fuse<Self> where
Self: Sized, [src]
fn fuse(self) -> Fuse<Self> where
Self: Sized, 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
Self: Sized,
F: FnMut(&Self::Item), [src]
fn inspect<F>(self, f: F) -> Inspect<Self, F> where
Self: Sized,
F: FnMut(&Self::Item), Do something with each element of an iterator, passing the value on. Read more
fn by_ref(&mut self) -> &mut Self where
Self: Sized, [src]
fn by_ref(&mut self) -> &mut Self where
Self: Sized, Borrows 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: FromIterator<Self::Item>>(self) -> B where
Self: Sized, [src]
#[must_use = "if you really need to exhaust the iterator, consider `.for_each(drop)` instead"]
fn collect<B: FromIterator<Self::Item>>(self) -> B where
Self: Sized, Transforms an iterator into a collection. Read more
fn partition<B, F>(self, f: F) -> (B, B) where
Self: Sized,
B: Default + Extend<Self::Item>,
F: FnMut(&Self::Item) -> bool, [src]
fn partition<B, F>(self, f: F) -> (B, B) where
Self: Sized,
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
Self: Sized,
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
Self: Sized,
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
Self: Sized,
F: FnMut(Self::Item) -> R,
R: Try<Ok = ()>, 1.27.0[src]
fn try_for_each<F, R>(&mut self, f: F) -> R where
Self: Sized,
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
Self: Sized,
F: FnMut(B, Self::Item) -> B, [src]
fn fold<B, F>(self, init: B, f: F) -> B where
Self: Sized,
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
Self: Sized,
F: FnMut(Self::Item) -> bool, [src]
fn all<F>(&mut self, f: F) -> bool where
Self: Sized,
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
Self: Sized,
F: FnMut(Self::Item) -> bool, [src]
fn any<F>(&mut self, f: F) -> bool where
Self: Sized,
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
Self: Sized,
P: FnMut(&Self::Item) -> bool, [src]
fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where
Self: Sized,
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
Self: Sized,
F: FnMut(Self::Item) -> Option<B>, [src]
fn find_map<B, F>(&mut self, f: F) -> Option<B> where
Self: Sized,
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
Self: Sized,
P: FnMut(Self::Item) -> bool, [src]
fn position<P>(&mut self, predicate: P) -> Option<usize> where
Self: Sized,
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: Sized + ExactSizeIterator + DoubleEndedIterator, [src]
fn rposition<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
Self: Sized + ExactSizeIterator + DoubleEndedIterator, Searches for an element in an iterator from the right, returning its index. Read more
fn max(self) -> Option<Self::Item> where
Self: Sized,
Self::Item: Ord, [src]
fn max(self) -> Option<Self::Item> where
Self: Sized,
Self::Item: Ord, Returns the maximum element of an iterator. Read more
fn min(self) -> Option<Self::Item> where
Self: Sized,
Self::Item: Ord, [src]
fn min(self) -> Option<Self::Item> where
Self: Sized,
Self::Item: Ord, Returns the minimum element of an iterator. Read more
fn max_by_key<B: Ord, F>(self, f: F) -> Option<Self::Item> where
Self: Sized,
F: FnMut(&Self::Item) -> B, 1.6.0[src]
fn max_by_key<B: Ord, F>(self, f: F) -> Option<Self::Item> where
Self: Sized,
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
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Ordering, 1.15.0[src]
fn max_by<F>(self, compare: F) -> Option<Self::Item> where
Self: Sized,
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: Ord, F>(self, f: F) -> Option<Self::Item> where
Self: Sized,
F: FnMut(&Self::Item) -> B, 1.6.0[src]
fn min_by_key<B: Ord, F>(self, f: F) -> Option<Self::Item> where
Self: Sized,
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
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Ordering, 1.15.0[src]
fn min_by<F>(self, compare: F) -> Option<Self::Item> where
Self: Sized,
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: Sized + DoubleEndedIterator, [src]
fn rev(self) -> Rev<Self> where
Self: Sized + 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: Sized + Iterator<Item = (A, B)>, [src]
fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Sized + 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: 'a>(self) -> Cloned<Self> where
Self: Sized + Iterator<Item = &'a T>,
T: Clone, [src]
fn cloned<'a, T: 'a>(self) -> Cloned<Self> where
Self: Sized + Iterator<Item = &'a T>,
T: 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: Sized + Clone, [src]
fn cycle(self) -> Cycle<Self> where
Self: Sized + Clone, Repeats an iterator endlessly. Read more
fn sum<S>(self) -> S where
Self: Sized,
S: Sum<Self::Item>, 1.11.0[src]
fn sum<S>(self) -> S where
Self: Sized,
S: Sum<Self::Item>, Sums the elements of an iterator. Read more
fn product<P>(self) -> P where
Self: Sized,
P: Product<Self::Item>, 1.11.0[src]
fn product<P>(self) -> P where
Self: Sized,
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,
Self: Sized, 1.5.0[src]
fn cmp<I>(self, other: I) -> Ordering where
I: IntoIterator<Item = Self::Item>,
Self::Item: Ord,
Self: Sized, 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::Item>,
Self: Sized, 1.5.0[src]
fn partial_cmp<I>(self, other: I) -> Option<Ordering> where
I: IntoIterator,
Self::Item: PartialOrd<I::Item>,
Self: Sized, 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::Item>,
Self: Sized, 1.5.0[src]
fn eq<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<I::Item>,
Self: Sized, 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::Item>,
Self: Sized, 1.5.0[src]
fn ne<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<I::Item>,
Self: Sized, 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::Item>,
Self: Sized, 1.5.0[src]
fn lt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<I::Item>,
Self: Sized, 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::Item>,
Self: Sized, 1.5.0[src]
fn le<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<I::Item>,
Self: Sized, 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::Item>,
Self: Sized, 1.5.0[src]
fn gt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<I::Item>,
Self: Sized, 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::Item>,
Self: Sized, 1.5.0[src]
fn ge<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<I::Item>,
Self: Sized, Determines if the elements of this Iterator are lexicographically greater than or equal to those of another. Read more
impl<'a, T> DoubleEndedIterator for Windows<'a, T>[src]
impl<'a, T> DoubleEndedIterator for Windows<'a, T>fn next_back(&mut self) -> Option<&'a [T]>[src]
fn next_back(&mut self) -> Option<&'a [T]>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
Self: Sized,
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
Self: Sized,
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
Self: Sized,
F: FnMut(B, Self::Item) -> B, 1.27.0[src]
fn rfold<B, F>(self, accum: B, f: F) -> B where
Self: Sized,
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
Self: Sized,
P: FnMut(&Self::Item) -> bool, 1.27.0[src]
fn rfind<P>(&mut self, predicate: P) -> Option<Self::Item> where
Self: Sized,
P: FnMut(&Self::Item) -> bool, Searches for an element of an iterator from the back that satisfies a predicate. Read more
impl<'a, T> ExactSizeIterator for Windows<'a, T>[src]
impl<'a, T> ExactSizeIterator for Windows<'a, T>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<'a, T> TrustedLen for Windows<'a, T>[src]
impl<'a, T> TrustedLen for Windows<'a, T>impl<'a, T> FusedIterator for Windows<'a, T>1.26.0[src]
impl<'a, T> FusedIterator for Windows<'a, T>