Struct std::collections::bitv::BitsExperimental
[-]
[+]
[src]
pub struct Bits<'a> {
// some fields omitted
}An iterator for Bitv.
pub struct Bits<'a> {
// some fields omitted
}An iterator for Bitv.
impl<'a> Iterator<bool> for Bits<'a>fn next(&mut self) -> Option<bool>fn size_hint(&self) -> (uint, Option<uint>)fn size_hint(&self) -> (uint, Option<uint>)fn chain<U: Iterator<bool>>(self, U) -> Chain<Bits<'a>, U>fn zip<B, U: Iterator<B>>(self, U) -> Zip<Bits<'a>, U>fn map<B>(self, |bool| -> B) -> Map<'r, bool, B, Bits<'a>>fn filter(self, |&bool| -> bool) -> Filter<'r, bool, Bits<'a>>fn filter_map<B>(self, |bool| -> Option<B>) -> FilterMap<'r, bool, B, Bits<'a>>fn enumerate(self) -> Enumerate<Bits<'a>>fn peekable(self) -> Peekable<bool, Bits<'a>>fn skip_while(self, |&bool| -> bool) -> SkipWhile<'r, bool, Bits<'a>>fn take_while(self, |&bool| -> bool) -> TakeWhile<'r, bool, Bits<'a>>fn skip(self, uint) -> Skip<Bits<'a>>fn take(self, uint) -> Take<Bits<'a>>fn scan<St, B>(self, St, |&mut St, bool| -> Option<B>) -> Scan<'r, bool, B, Bits<'a>, St>fn flat_map<B, U: Iterator<B>>(self, |bool| -> U) -> FlatMap<'r, bool, Bits<'a>, U>fn fuse(self) -> Fuse<Bits<'a>>fn inspect(self, |&bool|) -> Inspect<'r, bool, Bits<'a>>fn by_ref(&'r mut self) -> ByRef<'r, Bits<'a>>fn collect<B: FromIterator<bool>>(&mut self) -> Bfn nth(&mut self, uint) -> Option<bool>fn last(&mut self) -> Option<bool>fn fold<B>(&mut self, B, |B, bool| -> B) -> Bfn count(&mut self) -> uintfn all(&mut self, |bool| -> bool) -> boolfn any(&mut self, |bool| -> bool) -> boolfn find(&mut self, |&bool| -> bool) -> Option<bool>fn position(&mut self, |bool| -> bool) -> Option<uint>fn max_by<B: Ord>(&mut self, |&bool| -> B) -> Option<bool>fn min_by<B: Ord>(&mut self, |&bool| -> B) -> Option<bool>impl<'a> DoubleEndedIterator<bool> for Bits<'a>impl<'a> ExactSize<bool> for Bits<'a>impl<'a> RandomAccessIterator<bool> for Bits<'a>
Prefix searches with a type followed by a colon (e.g.
fn:) to restrict the search to a given type.
Accepted types are: fn, mod,
struct, enum,
trait, typedef (or
tdef).