Struct MultiMatcher

pub struct MultiMatcher<C: Hash + Eq> {
    pub trie: Trie<C>,
    pub pat_id: Vec<Option<usize>>,
    pub fail: Vec<usize>,
    pub fast: Vec<usize>,
}

Multi-pattern matching with the Aho-Corasick algorithm

Fields

trie: Trie<C>

A prefix trie storing the string patterns to search for.

pat_id: Vec<Option<usize>>

Stores which completed pattern string each node corresponds to.

fail: Vec<usize>

Aho-Corasick failure automaton. fail[i] is the node corresponding to the longest prefix-suffix of the node corresponding to i.

fast: Vec<usize>

Shortcut to the next match along the failure chain, or to the root.

Implementations

impl<C: Hash + Eq> MultiMatcher<C>

pub fn new( patterns: impl IntoIterator<Item = impl IntoIterator<Item = C>>, ) -> Self

Precomputes the automaton that allows linear-time string matching. If there are duplicate patterns, all but one copy will be ignored.

pub fn ac_match(&self, text: impl IntoIterator<Item = C>) -> Vec<usize>

Aho-Corasick algorithm, sets @return[i] = node corresponding to longest prefix of some pattern matching a suffix of text[0..=i].

pub fn get_end_pos_and_pat_id( &self, match_nodes: &[usize], ) -> Vec<(usize, usize)>

For each non-empty match, returns where in the text it ends, and the index of the corresponding pattern.