pub fn execute_regular<S, E>(
automaton: &Automaton<S, E>,
subject: &[S],
limits: TextLimits,
extension_matches: impl Fn(&E, &S) -> bool,
) -> ExecutionOutcomewhere
S: PartialEq,Expand description
Executes a compiled regular automaton without recursion or backtracking.
extension_matches supplies the consuming predicate for admitted extension
states. Fixed-width assertions remain in this accounted regular model;
variable-width assertions are returned as typed refusals.