Trait collections::str::pattern::Pattern
[−]
[src]
pub trait Pattern<'a> {
type Searcher: Searcher<'a>;
fn into_searcher(self, haystack: &'a str) -> Self::Searcher;
fn is_contained_in(self, haystack: &'a str) -> bool { ... }
fn is_prefix_of(self, haystack: &'a str) -> bool { ... }
fn is_suffix_of(self, haystack: &'a str) -> bool where Self::Searcher: ReverseSearcher<'a> { ... }
}A string pattern.
A Pattern<'a>`Pattern<'a>expresses that the implementing type can be used as a string pattern for searching in a` expresses that the implementing type
can be used as a string pattern for searching in a &'a str`&'a str`.
For example, both 'a'`'a'and` and "aa"`"aa"are patterns that would match at index` are patterns that
would match at index 1`1in the string` in the string "baaaab"`"baaaab"`.
The trait itself acts as a builder for an associated
Searcher`Searcher` type, which does the actual work of finding
occurrences of the pattern in a string.
Associated Types
Required Methods
fn into_searcher(self, haystack: &'a str) -> Self::Searcher
Constructs the associated searcher from
self`selfand the` and the haystack`haystack` to search in.
Provided Methods
fn is_contained_in(self, haystack: &'a str) -> bool
Checks whether the pattern matches anywhere in the haystack
fn is_prefix_of(self, haystack: &'a str) -> bool
Checks whether the pattern matches at the front of the haystack
fn is_suffix_of(self, haystack: &'a str) -> bool where Self::Searcher: ReverseSearcher<'a>
Checks whether the pattern matches at the back of the haystack
Implementors
impl<'a, C> Pattern<'a> for CharEqPattern<C> where C: CharEqimpl<'a, 'b> Pattern<'a> for &'b strimpl<'a> Pattern<'a> for charimpl<'a, 'b> Pattern<'a> for &'b [char]impl<'a, F> Pattern<'a> for F where F: FnMut(char) -> boolimpl<'a, 'b> Pattern<'a> for &'b &'b strimpl<'a, 'b> Pattern<'a> for &'b String