push onto the backtracking stack

transferCapture captures a subexpression. Note that the capnum used here has already been mapped to a non-sparse index (by the code generator RegexWri

Performs a fast lookup which determines if a character is involved in case conversion, as well as returns the OTHER characters that should be consider

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

Processes the node, adding any prefix text to the builder. Returns whether processing should continue with subsequent nodes.

Starting from the specified root node, populates results with any characters at a fixed distance from the node's starting position. The function retu

Returns ReNode type for zero-length assertions with a \ code.

True if M option altering meaning of $ and ^ is on.

True if S option altering meaning of . is on.

<summary>Analyzes the set to determine some basic properties that can be used to optimize usage.

* func BenchmarkReplaceAll(b *testing.B) { x := "abcdefghijklmnopqrstuvwxyz" b.StopTimer() re := MustCompile("[cjrw]", 0) b.StartTimer() for i :

ByteRange returns the UTF-8 byte index and byte length of the captured substring. The first call lazily caches byte offsets on shared match text, so i

Compile parses a regular expression and returns a compat adapter for it.

Dump returns the contents of the filter as a human readable string

Find returns a slice holding the text of the leftmost match in b.

FindAll returns a slice of all successive matches in b.

FindAllString returns a slice of all successive matches in s.

FindAllStringIndex returns a slice of byte index pairs identifying all successive matches in s.

FindAllStringIndex returns a slice of byte index pairs for all successive matches in s.

FindAllStringSubmatch returns a slice of all successive matches and their submatches in s.

FindAllSubmatch returns a slice of all successive matches and their submatches in b.

FindReaderIndex returns a two-element slice defining the byte location of the leftmost match in text read from r.

FindReaderSubmatchIndex returns a slice holding the byte index pairs of the leftmost match and its submatches in text read from r.

FindRunesMatchStartingAt searches the input rune slice for a Regexp match starting at the startAt index

FindString returns a string holding the text of the leftmost match in s.

FindStringIndex returns a two-element slice defining the location of the leftmost match in s.

FindStringSubmatch returns a slice of strings holding the text of the leftmost match and its submatches.

FindSubmatch returns a slice of byte slices holding the text of the leftmost match and its submatches.

Fuzz is the input point for go-fuzz