collections​::slice

Modules

bytesraw

Structs

ChunksElementSwapsItemsMutChunksMutItemsMutSplitsPermutationsSplitsWindows

Traits

CloneableVectorImmutableCloneableVectorImmutableEqVectorImmutableOrdVectorImmutableVectorMutableCloneableVectorMutableOrdVectorMutableVectorMutableVectorAllocatingVectorVectorVector

Functions

mut_ref_sliceref_slice

Struct collections::slice::Splits[src]

pub struct Splits<'a, T> {
    // some fields omitted
}

An iterator over the slices of a vector separated by elements that match a predicate function.

Trait Implementations

impl<'a, T> Iterator<&'a [T]> for Splits<'a, T>

fn next<'a, T>(&mut self) -> Option<&'a [T]>

fn size_hint<'a, T>(&self) -> (uint, Option<uint>)

fn size_hint<'a, T>(&self) -> (uint, Option<uint>)

fn chain<U: Iterator<&'a [T]>>(self, U) -> Chain<Splits<'a, T>, U>

fn zip<B, U: Iterator<B>>(self, U) -> Zip<Splits<'a, T>, U>

fn map<B>(self, |&'a [T]|: 'r -> B) -> Map<'r, &'a [T], B, Splits<'a, T>>

fn filter<'a, T>(self, |&&'a [T]|: 'r -> bool) -> Filter<'r, &'a [T], Splits<'a, T>>

fn filter_map<B>(self, |&'a [T]|: 'r -> Option<B>) -> FilterMap<'r, &'a [T], B, Splits<'a, T>>

fn enumerate<'a, T>(self) -> Enumerate<Splits<'a, T>>

fn peekable<'a, T>(self) -> Peekable<&'a [T], Splits<'a, T>>

fn skip_while<'a, T>(self, |&&'a [T]|: 'r -> bool) -> SkipWhile<'r, &'a [T], Splits<'a, T>>

fn take_while<'a, T>(self, |&&'a [T]|: 'r -> bool) -> TakeWhile<'r, &'a [T], Splits<'a, T>>

fn skip<'a, T>(self, uint) -> Skip<Splits<'a, T>>

fn take<'a, T>(self, uint) -> Take<Splits<'a, T>>

fn scan<St, B>(self, St, |&mut St, &'a [T]|: 'r -> Option<B>) -> Scan<'r, &'a [T], B, Splits<'a, T>, St>

fn flat_map<B, U: Iterator<B>>(self, |&'a [T]|: 'r -> U) -> FlatMap<'r, &'a [T], Splits<'a, T>, U>

fn fuse<'a, T>(self) -> Fuse<Splits<'a, T>>

fn inspect<'a, T>(self, |&&'a [T]|: 'r) -> Inspect<'r, &'a [T], Splits<'a, T>>

fn by_ref<'a, T>(&'r mut self) -> ByRef<'r, Splits<'a, T>>

fn advance<'a, T>(&mut self, |&'a [T]| -> bool) -> bool

fn collect<B: FromIterator<&'a [T]>>(&mut self) -> B

fn nth<'a, T>(&mut self, uint) -> Option<&'a [T]>

fn last<'a, T>(&mut self) -> Option<&'a [T]>

fn fold<B>(&mut self, B, |B, &'a [T]| -> B) -> B

fn count<'a, T>(&mut self) -> uint

fn all<'a, T>(&mut self, |&'a [T]| -> bool) -> bool

fn any<'a, T>(&mut self, |&'a [T]| -> bool) -> bool

fn find<'a, T>(&mut self, |&&'a [T]| -> bool) -> Option<&'a [T]>

fn position<'a, T>(&mut self, |&'a [T]| -> bool) -> Option<uint>

fn max_by<B: Ord>(&mut self, |&&'a [T]| -> B) -> Option<&'a [T]>

fn min_by<B: Ord>(&mut self, |&&'a [T]| -> B) -> Option<&'a [T]>

impl<'a, T> DoubleEndedIterator<&'a [T]> for Splits<'a, T>

fn next_back<'a, T>(&mut self) -> Option<&'a [T]>

fn rev<'a, T>(self) -> Rev<Splits<'a, T>>