Struct aho_corasick::FullAcAutomaton [] [src]

pub struct FullAcAutomaton<P> { /* fields omitted */ }
[]

A complete Aho-Corasick automaton.

This uses a single transition matrix that permits each input character to move to the next state with a single lookup in the matrix.

This is as fast as it gets, but it is guaranteed to use a lot of memory. Namely, it will use at least 4 * 256 * #states, where the number of states is capped at length of all patterns concatenated.

Methods

impl<P: AsRef<[u8]>> FullAcAutomaton<P>
[src]

[]

Build a new expanded Aho-Corasick automaton from an existing Aho-Corasick automaton.

Trait Implementations

impl<P: Clone> Clone for FullAcAutomaton<P>
[src]

[]

Returns a copy of the value. Read more

[]

Performs copy-assignment from source. Read more

impl<P: AsRef<[u8]>> Automaton<P> for FullAcAutomaton<P>
[src]

[]

Return the next state given the current state and next character.

[]

Build a match given the current state, pattern index and input index.

[]

Return true if and only if the given state and current pattern index indicate a match. Read more

[]

Return the set of bytes that have transitions in the root state.

[]

Returns all of the patterns matched by this automaton. Read more

[]

Returns the pattern indexed at i. Read more

[]

Return the number of patterns in the automaton.

[]

Returns true if the automaton has no patterns.

[]

Returns an iterator of non-overlapping matches in s.

[]

Returns an iterator of overlapping matches in s.

[]

Returns an iterator of non-overlapping matches in the given reader.

[]

Returns an iterator of overlapping matches in the given reader.

impl<P: AsRef<[u8]> + Debug> Debug for FullAcAutomaton<P>
[src]

[]

Formats the value using the given formatter.