Scans contents of [] (not including []'s), and converts to a set.

Scans exactly c hex digits (c=2 for \xFF, c=4 for \uFFFF)

Scan hex digits until we hit a closing brace. Non-hex digits, hex value too large for UTF-8, or running out of chars are errors

Scans imnsxu-imnsxu option string, stops at the first unrecognized char.

scanQuoted scans the literal text after \Q through the next \E, or through the end of the pattern when there is no terminator.

Returns an index in the set table for a charset uses a map to eliminate duplicates.

Walks the nodes of the expression looking for any node that could possibly match the first character of a match, e.g. in `a*b*c+d`, we'd find [abc], o

revert the last capture

option shortcuts True if N option disabling '(' autocapture is on.

Three very similar algorithms appear below: replace (pattern), replace (evaluator), and split.

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.

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

NextGraphemeClusterBoundary returns the first extended-grapheme boundary after start, or -1 when start is not a valid input position. It implements th

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

PreviousGraphemeClusterBoundary returns the first extended-grapheme boundary before end, or -1 when end is not a valid input position.

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

TryMatchGrapheme consumes one Unicode extended grapheme cluster in the runner's current direction. It is exported for regexp2cg-generated engines.

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

addQuotedUnit adds the literal characters scanned by \Q...\E. All but the final character are completed immediately so a following quantifier applies

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