Struct collections::str::CharSplits[src]
pub struct CharSplits<'a, Sep> {
// some fields omitted
}An iterator over the substrings of a string, separated by sep.
pub struct CharSplits<'a, Sep> {
// some fields omitted
}An iterator over the substrings of a string, separated by sep.
impl<'a, Sep: CharEq> Iterator<&'a str> for CharSplits<'a, Sep>fn next<'a, Sep: CharEq>(&mut self) -> Option<&'a str>fn size_hint<'a, Sep: CharEq>(&self) -> (uint, Option<uint>)fn chain<U: Iterator<&'a str>>(self, U) -> Chain<CharSplits<'a, Sep>, U>fn zip<B, U: Iterator<B>>(self, U) -> Zip<CharSplits<'a, Sep>, U>fn map<B>(self, |&'a str|: 'r -> B) -> Map<'r, &'a str, B, CharSplits<'a, Sep>>fn filter<'a, Sep: CharEq>(self, |&&'a str|: 'r -> bool) -> Filter<'r, &'a str, CharSplits<'a, Sep>>fn filter_map<B>(self, |&'a str|: 'r -> Option<B>) -> FilterMap<'r, &'a str, B, CharSplits<'a, Sep>>fn enumerate<'a, Sep: CharEq>(self) -> Enumerate<CharSplits<'a, Sep>>fn peekable<'a, Sep: CharEq>(self) -> Peekable<&'a str, CharSplits<'a, Sep>>fn skip_while<'a, Sep: CharEq>(self, |&&'a str|: 'r -> bool) -> SkipWhile<'r, &'a str, CharSplits<'a, Sep>>fn take_while<'a, Sep: CharEq>(self, |&&'a str|: 'r -> bool) -> TakeWhile<'r, &'a str, CharSplits<'a, Sep>>fn skip<'a, Sep: CharEq>(self, uint) -> Skip<CharSplits<'a, Sep>>fn take<'a, Sep: CharEq>(self, uint) -> Take<CharSplits<'a, Sep>>fn scan<St, B>(self, St, |&mut St, &'a str|: 'r -> Option<B>) -> Scan<'r, &'a str, B, CharSplits<'a, Sep>, St>fn flat_map<B, U: Iterator<B>>(self, |&'a str|: 'r -> U) -> FlatMap<'r, &'a str, CharSplits<'a, Sep>, U>fn fuse<'a, Sep: CharEq>(self) -> Fuse<CharSplits<'a, Sep>>fn inspect<'a, Sep: CharEq>(self, |&&'a str|: 'r) -> Inspect<'r, &'a str, CharSplits<'a, Sep>>fn by_ref<'a, Sep: CharEq>(&'r mut self) -> ByRef<'r, CharSplits<'a, Sep>>fn advance<'a, Sep: CharEq>(&mut self, |&'a str| -> bool) -> boolfn collect<B: FromIterator<&'a str>>(&mut self) -> Bfn nth<'a, Sep: CharEq>(&mut self, uint) -> Option<&'a str>fn last<'a, Sep: CharEq>(&mut self) -> Option<&'a str>fn fold<B>(&mut self, B, |B, &'a str| -> B) -> Bfn count<'a, Sep: CharEq>(&mut self) -> uintfn all<'a, Sep: CharEq>(&mut self, |&'a str| -> bool) -> boolfn any<'a, Sep: CharEq>(&mut self, |&'a str| -> bool) -> boolfn find<'a, Sep: CharEq>(&mut self, |&&'a str| -> bool) -> Option<&'a str>fn position<'a, Sep: CharEq>(&mut self, |&'a str| -> bool) -> Option<uint>fn max_by<B: Ord>(&mut self, |&&'a str| -> B) -> Option<&'a str>fn min_by<B: Ord>(&mut self, |&&'a str| -> B) -> Option<&'a str>impl<'a, Sep: CharEq> DoubleEndedIterator<&'a str> for CharSplits<'a, Sep>fn next_back<'a, Sep: CharEq>(&mut self) -> Option<&'a str>fn rev<'a, Sep: CharEq>(self) -> Rev<CharSplits<'a, Sep>>impl<'a, Sep: Clone> Clone for CharSplits<'a, Sep>fn clone<'a, Sep: Clone>(&self) -> CharSplits<'a, Sep>fn clone_from<'a, Sep: Clone>(&mut self, &CharSplits<'a, Sep>)
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 (or str), enum,
trait, typedef (or
tdef).