TokenMatcher

Embeds the already-built DFA table as Array[Int] literals - no Regex/Subset involved.

Build a matcher from pre-parsed regexes (use this from macros after compile-time parsing).

Like fromRegexes, but fails fast with Left(StateSpaceLimitExceeded(maxStates)) instead of exploring more than maxStates distinct derivative states while building the DFA - see StateSpaceLimitExceeded. Opt-in: fromRegexes itself stays uncapped for existing callers.

Like fromRegexes, but returns the first UnsupportedTokenConstruct as a Left instead of throwing it.

Build a matcher from pre-parsed subsets (use this from macros after compile-time parsing).

Like fromSubsets, but capped the way fromRegexesBounded caps fromRegexes.

Every pattern that uses a construct fromRegexesChecked rejects, with the first such construct in it, in pattern order - the check those builders make, without building the matcher. Empty when every pattern is supported. E.g. for a macro that reports each unsupported pattern at compile time and builds the matcher at runtime.

Embeds the already-built DFA table as Array[Int] literals - no Regex/Subset involved.