MCPcopy Create free account

hub / github.com/dlclark/regexp2 / functions

Functions1,368 in github.com/dlclark/regexp2

↓ 1 callersMethodstackDescription
(a []int, index int)
runner.go:2474
↓ 1 callersMethodstackPeek
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
runner.go:1338
↓ 1 callersMethodstackPeekN
get the ith element down on the grouping stack
runner.go:1343
↓ 1 callersMethodstackPop
()
runner.go:1325
↓ 1 callersMethodstackPopN
pop framesize items from the grouping stack
runner.go:1330
↓ 1 callersMethodstackPush
Push onto the grouping stack
runner.go:1313
↓ 1 callersMethodstackPush2
(I1, I2 int)
runner.go:1318
↓ 1 callersMethodstartGroup
Start a new round for the parser state (in response to an open paren or string start)
syntax/parser.go:2810
↓ 1 callersMethodstartTimeoutWatch
()
runner.go:2570
↓ 1 callersFunctionstopClock
stop the timeout clock in the background should only used for unit tests to abandon the background goroutine
fastclock.go:96
↓ 1 callersFunctionstringByteOffsets
(s string, runeCount int)
match.go:159
↓ 1 callersMethodstringCode
Returns an index in the string table for a string. uses a map to eliminate duplicates.
syntax/writer.go:651
↓ 1 callersFunctionstringHasLiteralAfterLoop
(input string, searchAt int, literal *syntax.LiteralAfterLoop)
stringprefixfilter.go:402
↓ 1 callersFunctionstripRustRegexComment
(s string)
regexp_corpus_rust_test.go:484
↓ 1 callersFunctionsumFrequencies
(chars []rune)
syntax/prefixanalyzer.go:1053
↓ 1 callersMethodtextPos
()
runner.go:1161
↓ 1 callersMethodtextposDescription
()
runner.go:2496
↓ 1 callersMethodtextstart
()
runner.go:1157
↓ 1 callersMethodtextto
(newpos int)
runner.go:1149
↓ 1 callersMethodtidy
(textpos int)
match.go:248
↓ 1 callersMethodtidyMatch
(mode scanMode)
runner.go:2357
↓ 1 callersFunctiontoRunePrefixes
(prefixes []string)
syntax/optimizations.go:643
↓ 1 callersMethodtopFC
This is the top.
syntax/prefix.go:146
↓ 1 callersMethodtrackPeek
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
runner.go:1303
↓ 1 callersMethodtrackPeekN
get the ith element down on the backtracking stack
runner.go:1308
↓ 1 callersMethodtrackPop
()
runner.go:1290
↓ 1 callersMethodtrackPopN
pop framesize items from the backtracking stack
runner.go:1295
↓ 1 callersMethodtrackPush
()
runner.go:1206
↓ 1 callersMethodtrackPush1
(I1 int)
runner.go:1211
↓ 1 callersMethodtrackPush2
(I1, I2 int)
runner.go:1218
↓ 1 callersMethodtrackPush3
(I1, I2, I3 int)
runner.go:1227
↓ 1 callersMethodtrackPushNeg1
(I1 int)
runner.go:1238
↓ 1 callersMethodtrackPushNeg2
(I1, I2 int)
runner.go:1245
↓ 1 callersMethodtrackpos
push onto the backtracking stack
runner.go:1182
↓ 1 callersMethodtrackto
(newpos int)
runner.go:1153
↓ 1 callersFunctiontryFindCaseEquivalences
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
syntax/charclass.go:809
↓ 1 callersFunctiontryFindPrefix
Processes the node, adding any prefix text to the builder. Returns whether processing should continue with subsequent nodes.
syntax/prefixanalyzer.go:251
↓ 1 callersFunctiontryFindRawFixedSets
Starting from the specified root node, populates results with any characters at a fixed distance from the node's starting position. The function retu
syntax/prefixanalyzer.go:779
↓ 1 callersMethodtypeFromCode
Returns ReNode type for zero-length assertions with a \ code.
syntax/parser.go:1784
↓ 1 callersFunctionunEscapeGroup
(val string)
regexp_corpus_pcre_test.go:328
↓ 1 callersFunctionunEscapeToMatch
(line string)
regexp_corpus_pcre_test.go:270
↓ 1 callersFunctionunwrapImmediateLiteralAfterLoopNode
(node *RegexNode)
syntax/prefixanalyzer.go:1246
↓ 1 callersMethoduseOptionM
True if M option altering meaning of $ and ^ is on.
syntax/parser.go:2594
↓ 1 callersMethoduseOptionS
True if S option altering meaning of . is on.
syntax/parser.go:2599
↓ 1 callersFunctionvalidateMatch
(t *testing.T, re *Regexp, m *Match, toMatch, value string, idx, capIdx int)
regexp_corpus_pcre_test.go:152
↓ 1 callersFunctionvalidateNoMatch
(t *testing.T, re *Regexp, m *Match)
regexp_corpus_pcre_test.go:144
↓ 1 callersFunctionwhitespaceLoop
(node *RegexNode)
syntax/prefixanalyzer.go:1444
↓ 1 callersFunctionwithEqualASCIIPrefixSearch
Dense candidate prefixes benefit from checking alternatives together. Keep the existing scanner for short inputs and sparse candidates, where its stri
stringprefixfilter.go:65
↓ 1 callersFunctionwriteRunes
Three very similar algorithms appear below: replace (pattern), replace (evaluator), and split.
replace.go:25
↓ 1 callersMethodwriteStrToBuf
(buf *bytes.Buffer)
syntax/tree.go:256
MethodAnalyze
<summary>Analyzes the set to determine some basic properties that can be used to optimize usage.
syntax/charclass.go:1603
FunctionBenchmarkAnchoredLiteralLongNonMatch
(b *testing.B)
regexp_performance_test.go:139
FunctionBenchmarkAnchoredLiteralShortNonMatch
* func BenchmarkReplaceAll(b *testing.B) { x := "abcdefghijklmnopqrstuvwxyz" b.StopTimer() re := MustCompile("[cjrw]", 0) b.StartTimer() for i :
regexp_performance_test.go:127
FunctionBenchmarkAnchoredLongMatch
(b *testing.B)
regexp_performance_test.go:171
FunctionBenchmarkAnchoredShortMatch
(b *testing.B)
regexp_performance_test.go:159
FunctionBenchmarkAsciiSearchValues_1K
(b *testing.B)
helpers/searchvalues_test.go:111
FunctionBenchmarkAsciiSearchValues_1M
(b *testing.B)
helpers/searchvalues_test.go:117
FunctionBenchmarkAsciiSearchValues_32
(b *testing.B)
helpers/searchvalues_test.go:108
FunctionBenchmarkAsciiSearchValues_32K
(b *testing.B)
helpers/searchvalues_test.go:114
FunctionBenchmarkAsciiSearchValues_32M
(b *testing.B)
helpers/searchvalues_test.go:120
FunctionBenchmarkBackreference
(b *testing.B)
regexp_performance_test.go:661
FunctionBenchmarkBackreferenceFailure
(b *testing.B)
regexp_performance_test.go:684
FunctionBenchmarkCategoryCompile
(b *testing.B)
regexp_performance_test.go:93
FunctionBenchmarkCategoryContains
(b *testing.B)
syntax/charclass_contains_test.go:29
FunctionBenchmarkCategoryMatch
(b *testing.B)
regexp_performance_test.go:61
FunctionBenchmarkDecodeString_ASCII
(b *testing.B)
helpers/indexof_bench_test.go:57
FunctionBenchmarkDisjointAlternationDispatch
(b *testing.B)
regexp_performance_test.go:262
FunctionBenchmarkDisjointAlternationDispatchLoop
(b *testing.B)
regexp_performance_test.go:296
FunctionBenchmarkECMABoundaryDigitLoop
(b *testing.B)
regexp_ecma_test.go:1881
FunctionBenchmarkECMADuplicateAlternatives
(b *testing.B)
syntax/parser_benchmark_test.go:8
FunctionBenchmarkECMADuplicateBooleanMatch
(b *testing.B)
regexp_performance_test.go:588
FunctionBenchmarkECMADuplicateReplacement
(b *testing.B)
regexp_performance_test.go:603
FunctionBenchmarkECMALegacyEscapesCompile
(b *testing.B)
regexp_ecma_escapes_test.go:269
FunctionBenchmarkECMAQuantifiedCaptures
(b *testing.B)
regexp_performance_test.go:613
FunctionBenchmarkECMASetLoopBeforeDot
Deciding whether [\r\n]+ can be atomic compares its set with ECMAScript's ".", which is stored as ranges that cover about 1.1M runes.
syntax/parser_benchmark_test.go:20
FunctionBenchmarkECMAUnicodeProperties
(b *testing.B)
regexp_ecma_test.go:1216
FunctionBenchmarkEqualASCIIPrefixSearch
Compare the compiled search with the existing candidate scanning strategies. End-to-end regexp benchmarks separately cover decoding and engine executi
prefixsearch_test.go:172
FunctionBenchmarkFindAllRunesIndexNoMatch
(b *testing.B)
string_processing_benchmark_test.go:100
FunctionBenchmarkFindLeadingStringsLeftToRight
(b *testing.B)
regexp_performance_test.go:394
FunctionBenchmarkFindNextMatch
(b *testing.B)
string_processing_benchmark_test.go:31
FunctionBenchmarkFindRunesMatchStartingAt
(b *testing.B)
regexp_search_benchmark_test.go:10
FunctionBenchmarkFindRunesMatches
(b *testing.B)
matchview_benchmark_test.go:8
FunctionBenchmarkFindStringMatchLeadingLiteralLateHit32K
(b *testing.B)
regexp_performance_test.go:458
FunctionBenchmarkFindStringMatchMixed
(b *testing.B)
string_processing_benchmark_test.go:8
FunctionBenchmarkIndexOfAny1_ASCIIMiss
(b *testing.B)
helpers/indexof_bench_test.go:21
FunctionBenchmarkIndexOfAny_ASCIISetMiss
(b *testing.B)
helpers/indexof_bench_test.go:33
FunctionBenchmarkIndexOf_ASCIIMiss
(b *testing.B)
helpers/indexof_bench_test.go:8
FunctionBenchmarkIndexStringIgnoreCaseASCII
Dense prefix candidates reproduce repeated rescans of an absent case variant. Sparse and absent candidates also check the cost of searching long input
helpers/indexof_ignorecase_bench_test.go:12
FunctionBenchmarkIsASCII
(b *testing.B)
helpers/indexof_bench_test.go:46
FunctionBenchmarkLandmarkRunnerStartup
A fresh runner isolates first-use search preparation from regex compilation. The warm case measures the same scan with the runner and its storage reus
regexp_search_benchmark_test.go:213
FunctionBenchmarkLeading
(b *testing.B)
regexp_performance_test.go:524
FunctionBenchmarkLiteral
(b *testing.B)
regexp_performance_test.go:10
FunctionBenchmarkLiteralMatch
(b *testing.B)
regexp_performance_test.go:750
FunctionBenchmarkMatchClass
(b *testing.B)
regexp_performance_test.go:34
FunctionBenchmarkMatchClass_InRange
(b *testing.B)
regexp_performance_test.go:47
FunctionBenchmarkMatchEasy0_1K
(b *testing.B)
regexp_performance_test.go:355
FunctionBenchmarkMatchEasy0_1M
(b *testing.B)
regexp_performance_test.go:357
FunctionBenchmarkMatchEasy0_32
(b *testing.B)
regexp_performance_test.go:354
FunctionBenchmarkMatchEasy0_32K
(b *testing.B)
regexp_performance_test.go:356
FunctionBenchmarkMatchEasy0_32M
(b *testing.B)
regexp_performance_test.go:358
← previousnext →701–800 of 1,368, ranked by callers