# Functions
CharDescription Produces a human-readable description for a single character.
According to UTS#18 Unicode Regular Expressions (http://www.unicode.org/reports/tr18/) RL 1.4 Simple Word Boundaries The class of <word_character> includes all Alphabetic values from the Unicode character database, from UnicodeData.txt [UData], plus the U+200C ZERO WIDTH NON-JOINER and U+200D ZERO WIDTH JOINER.
NewReplacerData will populate a reusable replacer data struct based on the given replacement string and the capture group data from a regexp.
Parse converts a regex string into a parse tree.
# Constants
where the regex can be pegged.
where the regex can be pegged.
where the regex can be pegged.
where the regex can be pegged.
where the regex can be pegged.
where the regex can be pegged.
where the regex can be pegged.
where the regex can be pegged.
bit to indicate that we're backtracking.
bit to indicate that we're backtracking on a second branch.
zap back to saved state.
\A.
^.
\b.
back jump,limit branch++ if zero<=c<limit.
back jump branch first for loop.
back group define group.
bit to indicate that we're case-insensitive.
"c".
"d".
should be escaped.
\b.
"e".
\Z.
\Z.
$.
internal issue.
Parser errors.
"n".
zap backtracking state.
back recall position.
jump just go.
"i".
"x".
back jump straight first.
back jump,limit same, but straight first.
back jump straight first for loop.
Add arg.
Bitwise and with 1 and add original.
Bitwise or with 1.
Set to arg.
Mask to get unmodified ordinary operator.
MaxPrefixSize is the largest number of runes we'll use for a BoyerMoyer prefix.
lef string abcd.
"m".
\B.
\B.
Reject!.
lef char [^a].
lef,back char,min,max .{,n}?.
lef,back char,min,max .{,n}.
lef,back char,min,max .{n}.
back val set counter, null mark.
back save position.
lef char a.
lef,back char,min,max a {,n}?.
lef,back char,min,max a {,n}.
lef,back char,min,max a {n}.
prune it baby.
quantifier.
RE2 compat mode.
lef group \#.
"r".
bit to indicate that we're reverse scanning.
ordinary stopper.
lef set [a-z\s] \w \s \d.
back val set counter, make mark.
back save backtrack state.
lef,back set,min,max [\d]{,n}?.
lef,back set,min,max [\d]{,n}.
back save position.
lef,back set,min,max [\d]{n}.
"s".
\G.
done!.
backtrack if ref undefined.
"u".
whitespace.
ScanBlank stopper.
# Variables
ErrReplacementError is a general error during parsing the replacement text.
# Structs
BmPrefix precomputes the Boyer-Moore tables for fast string scanning.
CharSet combines start-end rune ranges and unicode categories representing a set of characters.
An Error describes a failure to parse a regular expression and gives the offending expression.
# Type aliases
An ErrorCode describes a failure to parse a regular expression.