Struct std::collections::bitv_set::BitPositionsExperimental [-]  [+] [src]

pub struct BitPositions<'a> {
    // some fields omitted
}

An iterator for BitvSet.

Trait Implementations

impl<'a> Iterator<uint> for BitPositions<'a>

fn next(&mut self) -> Option<uint>

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

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

fn chain<U: Iterator<uint>>(self, U) -> Chain<BitPositions<'a>, U>

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

fn map<B>(self, |uint| -> B) -> Map<'r, uint, B, BitPositions<'a>>

fn filter(self, |&uint| -> bool) -> Filter<'r, uint, BitPositions<'a>>

fn filter_map<B>(self, |uint| -> Option<B>) -> FilterMap<'r, uint, B, BitPositions<'a>>

fn enumerate(self) -> Enumerate<BitPositions<'a>>

fn peekable(self) -> Peekable<uint, BitPositions<'a>>

fn skip_while(self, |&uint| -> bool) -> SkipWhile<'r, uint, BitPositions<'a>>

fn take_while(self, |&uint| -> bool) -> TakeWhile<'r, uint, BitPositions<'a>>

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

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

fn scan<St, B>(self, St, |&mut St, uint| -> Option<B>) -> Scan<'r, uint, B, BitPositions<'a>, St>

fn flat_map<B, U: Iterator<B>>(self, |uint| -> U) -> FlatMap<'r, uint, BitPositions<'a>, U>

fn fuse(self) -> Fuse<BitPositions<'a>>

fn inspect(self, |&uint|) -> Inspect<'r, uint, BitPositions<'a>>

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

fn collect<B: FromIterator<uint>>(&mut self) -> B

fn nth(&mut self, uint) -> Option<uint>

fn last(&mut self) -> Option<uint>

fn fold<B>(&mut self, B, |B, uint| -> B) -> B

fn count(&mut self) -> uint

fn all(&mut self, |uint| -> bool) -> bool

fn any(&mut self, |uint| -> bool) -> bool

fn find(&mut self, |&uint| -> bool) -> Option<uint>

fn position(&mut self, |uint| -> bool) -> Option<uint>

fn max_by<B: Ord>(&mut self, |&uint| -> B) -> Option<uint>

fn min_by<B: Ord>(&mut self, |&uint| -> B) -> Option<uint>