Struct Matcher 

pub struct Matcher<'a> { /* private fields */ }

The NFA-based matching engine.

Implementations

impl<'a> Matcher<'a>

pub fn new( nfa: &'a Nfa, fuzzy_bridge: Option<&'a FuzzyBridge>, capture_count: usize, config: MatcherConfig, ) -> Self

Create a new matcher.

pub fn with_prefilter( nfa: &'a Nfa, fuzzy_bridge: Option<&'a FuzzyBridge>, capture_count: usize, config: MatcherConfig, prefilter: Arc<Prefilter>, ) -> Self

Create a new matcher with a prefilter.

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

Find the first match in the text (or best match in BESTMATCH mode).

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

Find all non-overlapping matches.

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

Find up to n non-overlapping matches.

This is more efficient than find_all when only a limited number of matches is needed, as it stops searching after finding n matches.

pub fn find_at(&self, text: &str, start: usize) -> Option<MatchResult>

Try to find a match starting at a specific position.

Unlike find() which searches the entire text, this starts the search at the given position. The full text is still used for boundary checks (e.g., \b word boundaries).

pub fn build_cache(&self, text: &str) -> Option<CachedMatches>

Build the fuzzy cache for the given text.

This can be used for lazy iteration where we want to compute the cache once upfront and reuse it for multiple find_at_with_cache calls.

pub fn find_at_with_cache( &self, text: &str, start: usize, cached: Option<&CachedMatches>, ) -> Option<MatchResult>

Try to find a match starting at a specific position using cached fuzzy matches.