str::[−][src] pattern:: Searcher
A searcher for a string pattern.
This trait provides methods for searching for non-overlapping matches of a pattern starting from the front (left) of a string.
It will be implemented by associated
types of the
The trait is marked unsafe because the indices returned by the
next() methods are required to lie on valid utf8 boundaries in
the haystack. This enables consumers of this trait to
slice the haystack without additional runtime checks.
Getter for the underlying string to be searched in
Will always return the same
fn next(&mut self) -> SearchStep
Performs the next search step starting from the front.
haystack[a..b]matches the pattern.
haystack[a..b]can not match the pattern, even partially.
Doneif every byte of the haystack has been visited
The stream of
Reject values up to a
will contain index ranges that are adjacent, non-overlapping,
covering the whole haystack, and laying on utf8 boundaries.
Match result needs to contain the whole matched pattern,
Reject results may be split up into arbitrary
many adjacent fragments. Both ranges may have zero length.
As an example, the pattern
"aaa" and the haystack
might produce the stream
[Reject(0, 1), Reject(1, 2), Match(2, 5), Reject(5, 8)]
Find the next
Match result. See
Unlike next(), there is no guarantee that the returned ranges of this and next_reject will overlap. This will return (start_match, end_match), where start_match is the index of where the match begins, and end_match is the index after the end of the match.
Find the next
Reject result. See
Unlike next(), there is no guarantee that the returned ranges of this and next_match will overlap.