Struct aho_corasick::packed::Builder [−][src]
pub struct Builder { /* fields omitted */ }
A builder for constructing a packed searcher from a collection of patterns.
Example
This example shows how to use a builder to construct a searcher. By default, leftmost-first match semantics are used.
use aho_corasick::packed::{Builder, MatchKind}; let searcher = Builder::new() .add("foobar") .add("foo") .build()?; let matches: Vec<usize> = searcher .find_iter("foobar") .map(|mat| mat.pattern()) .collect(); assert_eq!(vec![0], matches);
Implementations
impl Builder
[src]
impl Builder
[src]pub fn new() -> Builder
[src]
Create a new builder for constructing a multi-pattern searcher. This constructor uses the default configuration.
pub fn build(&self) -> Option<Searcher>
[src]
Build a searcher from the patterns added to this builder so far.
pub fn add<P: AsRef<[u8]>>(&mut self, pattern: P) -> &mut Builder
[src]
Add the given pattern to this set to match.
The order in which patterns are added is significant. Namely, when using leftmost-first match semantics, then when multiple patterns can match at a particular location, the pattern that was added first is used as the match.
If the number of patterns added exceeds the amount supported by packed
searchers, then the builder will stop accumulating patterns and render
itself inert. At this point, constructing a searcher will always return
None
.
pub fn extend<I, P>(&mut self, patterns: I) -> &mut Builder where
I: IntoIterator<Item = P>,
P: AsRef<[u8]>,
[src]
I: IntoIterator<Item = P>,
P: AsRef<[u8]>,
Add the given iterator of patterns to this set to match.
The iterator must yield elements that can be converted into a &[u8]
.
The order in which patterns are added is significant. Namely, when using leftmost-first match semantics, then when multiple patterns can match at a particular location, the pattern that was added first is used as the match.
If the number of patterns added exceeds the amount supported by packed
searchers, then the builder will stop accumulating patterns and render
itself inert. At this point, constructing a searcher will always return
None
.