Struct Dfa 

pub struct Dfa { /* private fields */ }

Lazy DFA for fast exact matching.

Implementations

impl Dfa

pub fn from_nfa( nfa: &Nfa, bridge: Option<&FuzzyBridge>, case_insensitive: bool, multi_line: bool, ) -> Option<Self>

Create a new DFA from an NFA. Returns None if the NFA contains states that can’t be converted to DFA (fuzzy matching with edits, lookahead/lookbehind, backreferences).

If bridge is provided, exact FuzzyLiteral states will be expanded. If case_insensitive is true, matching will be case-insensitive. If multi_line is true, ^ and $ will match at line boundaries.

pub fn find(&mut self, text: &str) -> Option<DfaMatch>

Find the first match in the text.

pub fn find_all(&mut self, text: &str) -> Vec<DfaMatch>

Find all non-overlapping matches.

pub fn find_n(&mut self, text: &str, n: usize) -> Vec<DfaMatch>

Find the first n non-overlapping matches.

pub fn is_anchored_start(&self) -> bool

Check if the DFA is anchored at start.

pub fn is_anchored_end(&self) -> bool

Check if the DFA is anchored at end.

pub fn state_count(&self) -> usize

Get the number of states in the DFA.

pub fn minimize(&mut self) -> usize

Minimize the DFA using Hopcroft’s algorithm. Returns the number of states removed.

Trait Implementations

impl Debug for Dfa

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.