Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/dlclark/regexp2
/ functions
Functions
1,370 in github.com/dlclark/regexp2
⨍
Functions
1,370
◇
Types & classes
96
↓ 1 callers
Function
splitRustRegexTopLevelArrays
(raw string)
regexp_corpus_rust_test.go:434
↓ 1 callers
Method
stackDescription
(a []int, index int)
runner.go:2474
↓ 1 callers
Method
stackPeek
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 callers
Method
stackPeekN
get the ith element down on the grouping stack
runner.go:1343
↓ 1 callers
Method
stackPop
()
runner.go:1325
↓ 1 callers
Method
stackPopN
pop framesize items from the grouping stack
runner.go:1330
↓ 1 callers
Method
stackPush
Push onto the grouping stack
runner.go:1313
↓ 1 callers
Method
stackPush2
(I1, I2 int)
runner.go:1318
↓ 1 callers
Method
startGroup
Start a new round for the parser state (in response to an open paren or string start)
syntax/parser.go:2810
↓ 1 callers
Method
startTimeoutWatch
()
runner.go:2570
↓ 1 callers
Function
stopClock
stop the timeout clock in the background should only used for unit tests to abandon the background goroutine
fastclock.go:96
↓ 1 callers
Function
stringByteOffsets
(s string, runeCount int)
match.go:159
↓ 1 callers
Method
stringCode
Returns an index in the string table for a string. uses a map to eliminate duplicates.
syntax/writer.go:651
↓ 1 callers
Function
stringHasLiteralAfterLoop
(input string, searchAt int, literal *syntax.LiteralAfterLoop)
stringprefixfilter.go:402
↓ 1 callers
Function
stripRustRegexComment
(s string)
regexp_corpus_rust_test.go:484
↓ 1 callers
Function
sumFrequencies
(chars []rune)
syntax/prefixanalyzer.go:1053
↓ 1 callers
Method
textPos
()
runner.go:1161
↓ 1 callers
Method
textposDescription
()
runner.go:2496
↓ 1 callers
Method
textstart
()
runner.go:1157
↓ 1 callers
Method
textto
(newpos int)
runner.go:1149
↓ 1 callers
Method
tidy
(textpos int)
match.go:248
↓ 1 callers
Method
tidyMatch
(mode scanMode)
runner.go:2357
↓ 1 callers
Function
toRunePrefixes
(prefixes []string)
syntax/optimizations.go:643
↓ 1 callers
Method
topFC
This is the top.
syntax/prefix.go:146
↓ 1 callers
Method
trackPeek
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 callers
Method
trackPeekN
get the ith element down on the backtracking stack
runner.go:1308
↓ 1 callers
Method
trackPop
()
runner.go:1290
↓ 1 callers
Method
trackPopN
pop framesize items from the backtracking stack
runner.go:1295
↓ 1 callers
Method
trackPush
()
runner.go:1206
↓ 1 callers
Method
trackPush1
(I1 int)
runner.go:1211
↓ 1 callers
Method
trackPush2
(I1, I2 int)
runner.go:1218
↓ 1 callers
Method
trackPush3
(I1, I2, I3 int)
runner.go:1227
↓ 1 callers
Method
trackPushNeg1
(I1 int)
runner.go:1238
↓ 1 callers
Method
trackPushNeg2
(I1, I2 int)
runner.go:1245
↓ 1 callers
Method
trackpos
push onto the backtracking stack
runner.go:1182
↓ 1 callers
Method
trackto
(newpos int)
runner.go:1153
↓ 1 callers
Function
tryFindCaseEquivalences
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:791
↓ 1 callers
Function
tryFindPrefix
Processes the node, adding any prefix text to the builder. Returns whether processing should continue with subsequent nodes.
syntax/prefixanalyzer.go:251
↓ 1 callers
Function
tryFindRawFixedSets
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 callers
Method
typeFromCode
Returns ReNode type for zero-length assertions with a \ code.
syntax/parser.go:1784
↓ 1 callers
Function
unEscapeGroup
(val string)
regexp_corpus_pcre_test.go:328
↓ 1 callers
Function
unEscapeToMatch
(line string)
regexp_corpus_pcre_test.go:270
↓ 1 callers
Function
unwrapImmediateLiteralAfterLoopNode
(node *RegexNode)
syntax/prefixanalyzer.go:1246
↓ 1 callers
Method
useOptionM
True if M option altering meaning of $ and ^ is on.
syntax/parser.go:2594
↓ 1 callers
Method
useOptionS
True if S option altering meaning of . is on.
syntax/parser.go:2599
↓ 1 callers
Function
validateMatch
(t *testing.T, re *Regexp, m *Match, toMatch, value string, idx, capIdx int)
regexp_corpus_pcre_test.go:152
↓ 1 callers
Function
validateNoMatch
(t *testing.T, re *Regexp, m *Match)
regexp_corpus_pcre_test.go:144
↓ 1 callers
Function
whitespaceLoop
(node *RegexNode)
syntax/prefixanalyzer.go:1444
↓ 1 callers
Function
withEqualASCIIPrefixSearch
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 callers
Function
writeRunes
Three very similar algorithms appear below: replace (pattern), replace (evaluator), and split.
replace.go:25
↓ 1 callers
Method
writeStrToBuf
(buf *bytes.Buffer)
syntax/tree.go:256
Method
Analyze
<summary>Analyzes the set to determine some basic properties that can be used to optimize usage.
syntax/charclass.go:1586
Function
BenchmarkAnchoredLiteralLongNonMatch
(b *testing.B)
regexp_performance_test.go:139
Function
BenchmarkAnchoredLiteralShortNonMatch
* func BenchmarkReplaceAll(b *testing.B) { x := "abcdefghijklmnopqrstuvwxyz" b.StopTimer() re := MustCompile("[cjrw]", 0) b.StartTimer() for i :
regexp_performance_test.go:127
Function
BenchmarkAnchoredLongMatch
(b *testing.B)
regexp_performance_test.go:171
Function
BenchmarkAnchoredShortMatch
(b *testing.B)
regexp_performance_test.go:159
Function
BenchmarkAsciiSearchValues_1K
(b *testing.B)
helpers/searchvalues_test.go:111
Function
BenchmarkAsciiSearchValues_1M
(b *testing.B)
helpers/searchvalues_test.go:117
Function
BenchmarkAsciiSearchValues_32
(b *testing.B)
helpers/searchvalues_test.go:108
Function
BenchmarkAsciiSearchValues_32K
(b *testing.B)
helpers/searchvalues_test.go:114
Function
BenchmarkAsciiSearchValues_32M
(b *testing.B)
helpers/searchvalues_test.go:120
Function
BenchmarkBackreference
(b *testing.B)
regexp_performance_test.go:661
Function
BenchmarkBackreferenceFailure
(b *testing.B)
regexp_performance_test.go:684
Function
BenchmarkCategoryCompile
(b *testing.B)
regexp_performance_test.go:93
Function
BenchmarkCategoryContains
(b *testing.B)
syntax/charclass_contains_test.go:29
Function
BenchmarkCategoryMatch
(b *testing.B)
regexp_performance_test.go:61
Function
BenchmarkDecodeString_ASCII
(b *testing.B)
helpers/indexof_bench_test.go:57
Function
BenchmarkDisjointAlternationDispatch
(b *testing.B)
regexp_performance_test.go:262
Function
BenchmarkDisjointAlternationDispatchLoop
(b *testing.B)
regexp_performance_test.go:296
Function
BenchmarkECMABoundaryDigitLoop
(b *testing.B)
regexp_ecma_test.go:1881
Function
BenchmarkECMADuplicateAlternatives
(b *testing.B)
syntax/parser_benchmark_test.go:8
Function
BenchmarkECMADuplicateBooleanMatch
(b *testing.B)
regexp_performance_test.go:588
Function
BenchmarkECMADuplicateReplacement
(b *testing.B)
regexp_performance_test.go:603
Function
BenchmarkECMALegacyEscapesCompile
(b *testing.B)
regexp_ecma_escapes_test.go:269
Function
BenchmarkECMAQuantifiedCaptures
(b *testing.B)
regexp_performance_test.go:613
Function
BenchmarkECMASetLoopBeforeDot
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
Function
BenchmarkECMAUnicodeProperties
(b *testing.B)
regexp_ecma_test.go:1216
Function
BenchmarkEqualASCIIPrefixSearch
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
Function
BenchmarkFindAllRunesIndexNoMatch
(b *testing.B)
string_processing_benchmark_test.go:100
Function
BenchmarkFindLeadingStringsLeftToRight
(b *testing.B)
regexp_performance_test.go:394
Function
BenchmarkFindNextMatch
(b *testing.B)
string_processing_benchmark_test.go:31
Function
BenchmarkFindRunesMatchStartingAt
(b *testing.B)
regexp_search_benchmark_test.go:10
Function
BenchmarkFindRunesMatches
(b *testing.B)
matchview_benchmark_test.go:8
Function
BenchmarkFindStringMatchLeadingLiteralLateHit32K
(b *testing.B)
regexp_performance_test.go:458
Function
BenchmarkFindStringMatchMixed
(b *testing.B)
string_processing_benchmark_test.go:8
Function
BenchmarkIndexOfAny1_ASCIIMiss
(b *testing.B)
helpers/indexof_bench_test.go:21
Function
BenchmarkIndexOfAny_ASCIISetMiss
(b *testing.B)
helpers/indexof_bench_test.go:33
Function
BenchmarkIndexOf_ASCIIMiss
(b *testing.B)
helpers/indexof_bench_test.go:8
Function
BenchmarkIndexStringIgnoreCaseASCII
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
Function
BenchmarkIsASCII
(b *testing.B)
helpers/indexof_bench_test.go:46
Function
BenchmarkLandmarkRunnerStartup
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
Function
BenchmarkLeading
(b *testing.B)
regexp_performance_test.go:524
Function
BenchmarkLiteral
(b *testing.B)
regexp_performance_test.go:10
Function
BenchmarkLiteralMatch
(b *testing.B)
regexp_performance_test.go:750
Function
BenchmarkMatchClass
(b *testing.B)
regexp_performance_test.go:34
Function
BenchmarkMatchClass_InRange
(b *testing.B)
regexp_performance_test.go:47
Function
BenchmarkMatchEasy0_1K
(b *testing.B)
regexp_performance_test.go:355
Function
BenchmarkMatchEasy0_1M
(b *testing.B)
regexp_performance_test.go:357
Function
BenchmarkMatchEasy0_32
(b *testing.B)
regexp_performance_test.go:354
Function
BenchmarkMatchEasy0_32K
(b *testing.B)
regexp_performance_test.go:356
← previous
next →
701–800 of 1,370, ranked by callers