* * Simple parsing for replacement patterns */

Called in Beforechild to prevent further processing of the current child

Technically we are actually peeking at items already popped. So if you want to get and pop the top item from the stack, you do r.stackPop(); r.stackP

get the ith element down on the grouping stack

pop framesize items from the grouping stack

Push onto the grouping stack

Start a new round for the parser state (in response to an open paren or string start)

stop the timeout clock in the background should only used for unit tests to abandon the background goroutine

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

This is the top.

Technically we are actually peeking at items already popped. So if you want to get and pop the top item from the stack, you do r.trackPop(); r.trackP

get the ith element down on the backtracking stack

pop framesize items from the backtracking stack

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

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 :