+
+ pub struct RegexSplitsN<'r, 't> {
+ // some fields omitted
+}Yields at most N substrings delimited by a regular expression match.
The last substring will be whatever remains after splitting.
+ +'r is the lifetime of the compiled expression and 't is the lifetime
+of the string being split.
impl<'r, 't> Iterator for RegexSplitsN<'r, 't>type Item = &'t strfn next(&mut self) -> Option<&'t str>fn size_hint(&self) -> (usize, Option<usize>)fn count(self) -> usizefn 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: IntoIteratorfn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> Bfn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> boolfn 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) -> boolfn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> boolfn 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) -> Ufn fuse(self) -> Fuse<Self>fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()fn by_ref(&mut self) -> &mut Selffn collect<B>(self) -> B where B: FromIterator<Self::Item>fn partition<B, F>(self, f: F) -> (B, B) where B: Default + Extend<Self::Item>, F: FnMut(&Self::Item) -> boolfn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> Bfn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> boolfn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> boolfn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> boolfn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> boolfn rposition<P>(&mut self, predicate: P) -> Option<usize> where Self: ExactSizeIterator + DoubleEndedIterator, P: FnMut(Self::Item) -> boolfn max(self) -> Option<Self::Item> where Self::Item: Ordfn min(self) -> Option<Self::Item> where Self::Item: Ordfn min_max(self) -> MinMaxResult<Self::Item> where Self::Item: Ordfn max_by<B, F>(self, f: F) -> Option<Self::Item> where F: FnMut(&Self::Item) -> B, B: Ordfn min_by<B, F>(self, f: F) -> Option<Self::Item> where F: FnMut(&Self::Item) -> B, B: Ordfn rev(self) -> Rev<Self> where Self: DoubleEndedIteratorfn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, 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: Clonefn reverse_in_place<'a, T>(&mut self) where T: 'a, Self: Iterator<Item=&'a mut T> + DoubleEndedIteratorfn sum<S = Self::Item>(self) -> S where S: Add<Self::Item, Output=S> + Zerofn product<P = Self::Item>(self) -> P where P: Mul<Self::Item, Output=P> + One
+ 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).
+
+ Search functions by type signature (e.g.
+ vec -> usize)
+