FindAllIndex returns a slice of byte index pairs for all successive matches in b.

FindAllStringSubmatchIndex returns a slice of byte index pairs for all successive matches and their submatches in s.

FindAllSubmatchIndex returns a slice of byte index pairs for all successive matches and their submatches in b.

FindIndex returns a two-element slice defining the location of the leftmost match in b.

Finds the guaranteed beginning literal(s) of the node, or null if none exists. allowZeroWidth = true

FindStringSubmatchIndex returns a slice holding the byte index pairs of the leftmost match and its submatches.

FindSubmatchIndex returns a slice holding the byte index pairs of the leftmost match and its submatches.

Gets the character that begins a One or Multi.

return the first index of our original vals values within the slice given

decide whether the pos at the specified index is a boundary or not. It's just not worth emitting inline code for this logic.

When a regex is anchored, we can do a quick IsMatch test instead of a Scan

MatchString return true if the string matches the regex error will be set if a timeout occurs

MatchString reports whether the string s contains any match of the regular expression.

Determines whether two sets could overlap.

NewReplacerData will populate a reusable replacer data struct based on the given replacement string and the capture group data from a regexp

PrepareCharSetASCIIBitmaps builds bounded ASCII lookup tables for compiled character classes before the regexp is shared across goroutines.

StackDepth returns the number of integer slots currently used by the generated engine's backtracking stack.

StartsWithIgnoreCaseAscii would be faster find should always be sent in lower-case

Determines whether the specified child index of a concatenation begins a sequence whose values should be used to perform an ordinal case-insensitive c

Unescape removes any backslashes from previously-escaped special characters in the input string

Unwrap returns the wrapped regexp2 regular expression.

Finish the current concatenation (in response to a |)

Adds to the class any case-equivalence versions of characters already in the class. Used for case-insensitivity.

Finish the current quantifiable (when a quantifier is found)

Finish the current group (in response to a ')' or end)

Merges everything but the new ranges into our own

Sets the current unit to a single inverse-char node

Sets the current unit to a single char node

Sets the current unit to a single set node

Sets the current unit to an assertion of the specified type

Nonpublic builder: Add a capture to balance the specified group. This is used by the balanced match construct. (?<foo-foo2>...) If there were no s

FC computation and shortcut cases for each node type

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.

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.