Struct itertools::Stride

pub struct Stride<'a, A: 'a> {
    // some fields omitted
}

An iterator similar to the slice iterator, but with a certain number of steps (the stride) skipped per iteration.

Stride does not support zero-sized types for A.

Iterator element type is &'a A.

Methods

impl<'a, A> Stride<'a, A>

unsafe fn from_ptr_len(begin: *const A, nelem: usize, stride: isize) -> Stride<'a, A>

Create a Stride iterator from a raw pointer.

impl<'a, A> Stride<'a, A>

fn from_slice(xs: &'a [A], step: isize) -> Stride<'a, A>

Create Stride iterator from a slice and the element step count.

If step is negative, start from the back.

use itertools::Stride;

let xs = [0, 1, 2, 3, 4, 5];

let front = Stride::from_slice(&xs, 2);
assert_eq!(front[0], 0);
assert_eq!(front[1], 2);

let back = Stride::from_slice(&xs, -2);
assert_eq!(back[0], 5);
assert_eq!(back[1], 3);

Panics if values of type A are zero-sized.
Panics if step is 0.

fn from_stride(it: Stride<'a, A>, step: isize) -> Stride<'a, A>

Create Stride iterator from an existing Stride iterator

Panics if step is 0.

fn swap_ends(&mut self)

Swap the begin and end and reverse the stride, in effect reversing the iterator.

fn len(&self) -> usize

Return the number of elements in the iterator.

Trait Implementations

impl<'a, A> Copy for Stride<'a, A>

impl<'a, A> Send for Stride<'a, A> where A: Sync

impl<'a, A> Sync for Stride<'a, A> where A: Sync

impl<'a, A> Iterator for Stride<'a, A>

type Item = &'a A

fn next(&mut self) -> Option<&'a A>

fn size_hint(&self) -> (usize, Option<usize>)

fn count(self) -> usize

fn last(self) -> Option<Self::Item>

fn nth(&mut self, n: usize) -> Option<Self::Item>

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

fn enumerate(self) -> Enumerate<Self>

fn peekable(self) -> Peekable<Self>

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

fn skip(self, n: usize) -> Skip<Self>

fn take(self, n: usize) -> Take<Self>

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where U: IntoIterator, F: FnMut(Self::Item) -> U

fn fuse(self) -> Fuse<Self>

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

fn by_ref(&mut self) -> &mut Self

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

fn max(self) -> Option<Self::Item> where Self::Item: Ord

fn min(self) -> Option<Self::Item> where Self::Item: Ord

fn min_max(self) -> MinMaxResult<Self::Item> where Self::Item: Ord

fn max_by<B, F>(self, f: F) -> Option<Self::Item> where F: FnMut(&Self::Item) -> B, B: Ord

fn min_by<B, F>(self, f: F) -> Option<Self::Item> where F: FnMut(&Self::Item) -> B, B: Ord

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromA: Default + Extend<A>, FromB: Default + Extend<B>, Self: Iterator<Item=(A, B)>

fn cloned<'a, T>(self) -> Cloned<Self> where T: 'a + Clone, Self: Iterator<Item=&'a T>

fn cycle(self) -> Cycle<Self> where Self: Clone

fn reverse_in_place<'a, T>(&mut self) where T: 'a, Self: Iterator<Item=&'a mut T> + DoubleEndedIterator

fn sum<S = Self::Item>(self) -> S where S: Add<Self::Item, Output=S> + Zero

fn product<P = Self::Item>(self) -> P where P: Mul<Self::Item, Output=P> + One

impl<'a, A> DoubleEndedIterator for Stride<'a, A>

fn next_back(&mut self) -> Option<&'a A>

impl<'a, A> ExactSizeIterator for Stride<'a, A>

fn len(&self) -> usize

impl<'a, A> Index<usize> for Stride<'a, A>

type Output = A

fn index<'b>(&'b self, i: usize) -> &'b A

impl<'a, A> Debug for Stride<'a, A> where A: Debug

fn fmt(&self, f: &mut Formatter) -> Result

impl<'a, A> Slice for Stride<'a, A>

type Item = &'a A

fn len(&self) -> usize

unsafe fn get_unchecked(&mut self, i: usize) -> &'a A

impl<'a, A> Clone for Stride<'a, A>

fn clone(&self) -> Stride<'a, A>

fn clone_from(&mut self, source: &Self)