# Struct core::str::RSplitTerminator [−] [src]

    pub struct RSplitTerminator<'a, P: Pattern<'a>>(_);

Created with the method `rsplit_terminator()`.

## Trait Implementations

### `impl<'a, P: Pattern<'a>> Iterator for RSplitTerminator<'a, P> where P::Searcher: ReverseSearcher<'a>`

#### `type Item = &'a str`

#### `fn next(&mut self) -> Option<&'a str>`

#### `fn size_hint(&self) -> (usize, Option<usize>)`

#### `fn count(self) -> usize where Self: Sized`

#### `fn last(self) -> Option<Self::Item> where Self: Sized`

#### `fn nth(&mut self, n: usize) -> Option<Self::Item> where Self: Sized`

#### `fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where Self: Sized, U: IntoIterator<Item=Self::Item>`

#### `fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where Self: Sized, U: IntoIterator`

#### `fn map<B, F>(self, f: F) -> Map<Self, F> where Self: Sized, F: FnMut(Self::Item) -> B`

#### `fn filter<P>(self, predicate: P) -> Filter<Self, P> where Self: Sized, P: FnMut(&Self::Item) -> bool`

#### `fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where Self: Sized, F: FnMut(Self::Item) -> Option<B>`

#### `fn enumerate(self) -> Enumerate<Self> where Self: Sized`

#### `fn peekable(self) -> Peekable<Self> where Self: Sized`

#### `fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where Self: Sized, P: FnMut(&Self::Item) -> bool`

#### `fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where Self: Sized, P: FnMut(&Self::Item) -> bool`

#### `fn skip(self, n: usize) -> Skip<Self> where Self: Sized`

#### `fn take(self, n: usize) -> Take<Self> where Self: Sized`

#### `fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where Self: Sized, F: FnMut(&mut St, Self::Item) -> Option<B>`

#### `fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where Self: Sized, U: IntoIterator, F: FnMut(Self::Item) -> U`

#### `fn fuse(self) -> Fuse<Self> where Self: Sized`

#### `fn inspect<F>(self, f: F) -> Inspect<Self, F> where Self: Sized, F: FnMut(&Self::Item)`

#### `fn by_ref(&mut self) -> &mut Self where Self: Sized`

#### `fn collect<B: FromIterator<Self::Item>>(self) -> B where Self: Sized`

#### `fn partition<B, F>(self, f: F) -> (B, B) where Self: Sized, B: Default + Extend<Self::Item>, F: FnMut(&Self::Item) -> bool`

#### `fn fold<B, F>(self, init: B, f: F) -> B where Self: Sized, F: FnMut(B, Self::Item) -> B`

#### `fn all<F>(&mut self, f: F) -> bool where Self: Sized, F: FnMut(Self::Item) -> bool`

#### `fn any<F>(&mut self, f: F) -> bool where Self: Sized, F: FnMut(Self::Item) -> bool`

#### `fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where Self: Sized, P: FnMut(&Self::Item) -> bool`

#### `fn position<P>(&mut self, predicate: P) -> Option<usize> where Self: Sized, P: FnMut(Self::Item) -> bool`

#### `fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: Sized + ExactSizeIterator + DoubleEndedIterator`

#### `fn max(self) -> Option<Self::Item> where Self: Sized, Self::Item: Ord`

#### `fn min(self) -> Option<Self::Item> where Self: Sized, Self::Item: Ord`

#### `fn max_by<B: Ord, F>(self, f: F) -> Option<Self::Item> where Self: Sized, F: FnMut(&Self::Item) -> B`

#### `fn max_by_key<B: Ord, F>(self, f: F) -> Option<Self::Item> where Self: Sized, F: FnMut(&Self::Item) -> B`

#### `fn min_by<B: Ord, F>(self, f: F) -> Option<Self::Item> where Self: Sized, F: FnMut(&Self::Item) -> B`

#### `fn min_by_key<B: Ord, F>(self, f: F) -> Option<Self::Item> where Self: Sized, F: FnMut(&Self::Item) -> B`

#### `fn rev(self) -> Rev<Self> where Self: Sized + DoubleEndedIterator`

#### `fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromA: Default + Extend<A>, FromB: Default + Extend<B>, Self: Sized + Iterator<Item=(A, B)>`

#### `fn cloned<'a, T: 'a>(self) -> Cloned<Self> where Self: Sized + Iterator<Item=&'a T>, T: Clone`

#### `fn cycle(self) -> Cycle<Self> where Self: Sized + Clone`

#### `fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero, Self: Sized`

#### `fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One, Self: Sized`

#### `fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord, Self: Sized`

#### `fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>, Self: Sized`

#### `fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>, Self: Sized`

#### `fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>, Self: Sized`

#### `fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>, Self: Sized`

#### `fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>, Self: Sized`

#### `fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>, Self: Sized`

#### `fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>, Self: Sized`

### `impl<'a, P: Pattern<'a>> Clone for RSplitTerminator<'a, P> where P::Searcher: Clone`

#### `fn clone(&self) -> Self`

#### `fn clone_from(&mut self, source: &Self)`

### `impl<'a, P: Pattern<'a>> DoubleEndedIterator for RSplitTerminator<'a, P> where P::Searcher: DoubleEndedSearcher<'a>`

#### `fn next_back(&mut self) -> Option<&'a str>`

# Help

## Keyboard Shortcuts

?
  Show this help dialog
S
  Focus the search field
⇤
  Move up in search results
⇥
  Move down in search results
⏎
  Go to active search result

## Search Tricks

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`, `type`, `macro`, and `const`.

Search functions by type signature (e.g. `vec -> usize`)