captureSlotsInUse returns the capture slots whose values can affect matching. Group 0 is always retained as the success marker. Ordinary captures that

The top level RegexCode generator. It does a depth-first walk through the tree and calls EmitFragment to emits code before and after each child of an

commonPrefixLen returns the length of the common prefix of two strings.

compileASCIIStringSetPrefixFilter builds a byte-oriented multi-prefix scanner for the narrow shape where it beats running strings.Index once per prefi

Computes a maximum length of any string that could possibly match. or -1 if the length may not always be the same.

CountCaptures is a prescanner for deducing the slots used for captures by doing a partial tokenization of the pattern.

disjointAtomicBranchSets returns the first-character sets when an alternation can select a branch without leaving a backtracking choice.

dispatchCandidates returns disjoint branch sets and the leading nodes that can be folded into a consuming Dispatch instruction.

debug

Emits a two-argument operation.

The main RegexCode generator. It does a depth-first walk through the tree and calls EmitFragment to emits code before and after each child of an inter

True if options stack is empty.

True if the group stack is empty.

Returns true if the stack is empty.

extendClock ensures that clock is live and will run until at least end.

This function optimizes out prefix nodes from alternation branches that are the same across multiple contiguous branches. e.g. \w12|\d34|\d56|\w78|\w9

Analyzes all the branches of the alternation for text that's identical at the beginning of every branch. That text is then pulled out into its own on

True if the stack is empty.

Performs additional optimizations on an entire tree prior to being used. Some optimizations are performed by the parser while parsing, and others are

Finds {one/notone/set}loop nodes in the concatenation that can be automatically upgraded to {one/notone/set}loopatomic nodes. Such changes avoid pote

arbitrary cut-off to avoid generating lots of sets unnecessarily Finds sets at fixed-offsets from the beginning of the pattern/</summary> set "thoroug

Analyzes a list of fixed-distance sets to extract a case-sensitive string at a fixed distance.</summary>

Returns a leading positive lookahead if found and whether to keep examining subsequent nodes in a concatenation.

The above table was generated programmatically with the following. This can be augmented to incorporate additional data sources, though it is only in

Updates the results list with found prefixes. All existing strings in the list are treated as existing discovered prefixes prior to the node being pro

It takes a RegexTree and computes the set of chars that can start it.

This is a related computation: it takes a RegexTree and computes the leading substring if it sees one. It's quite trivial and gives up easily.

hasDisjointStartingSets reports whether every branch is non-nullable and begins with a character set that cannot overlap any other branch. In that cas

Returns n <= 0xF for a hex digit.

True if the stack is empty.

isIntrinsicallyAtomic reports whether a successful match of this node has no alternative input-consuming path to explore if something later fails.

Returns true for options allowed only at the top level

Returns true for those characters that begin a quantifier.

Returns true for those characters that terminate a string of ordinary chars.

Returns true for those characters that terminate a string of ordinary chars.