MCPcopy Create free account

hub / github.com/dlclark/regexp2 / functions

Functions981 in github.com/dlclark/regexp2

↓ 4 callersMethodcaptureSlotFromName
Looks up the slot number for a given name
syntax/parser.go:2215
↓ 4 callersMethodconsumeAutocap
()
syntax/parser.go:366
↓ 4 callersMethoddecodeStringWithStart
(s string, startAt int)
runner.go:2177
↓ 4 callersMethodeliminateEndingBacktracking
Converts nodes at the end of the node tree to be atomic. The correctness of this optimization depends on nothing being able to backtrack into the prov
syntax/tree.go:736
↓ 4 callersMethodfindStringMatchStart
(input string, startAt int)
stringprefixfilter.go:413
↓ 4 callersMethodisCaptureName
Looks up the slot number for a given name
syntax/parser.go:2230
↓ 4 callersMethodisCaptureSlot
True if the capture slot was noted
syntax/parser.go:2220
↓ 4 callersMethodisGroupNameStartChar
(ch rune)
syntax/parser.go:934
↓ 4 callersFunctionnewRegexNodeM
(t NodeType, opt RegexOptions, m int)
syntax/tree.go:164
↓ 4 callersFunctionnewStringMatchText
(input string, r []rune)
match.go:87
↓ 4 callersFunctionopcodeBacktracks
(op InstOp)
syntax/code.go:174
↓ 4 callersFunctionproblem
(t *testing.T, input string, args ...interface{})
regexp_corpus_pcre_test.go:139
↓ 4 callersMethodreplaceNodeIfUnnecessary
Simple optimization. If a concatenation or alternation has only one child strip out the intermediate node. If it has zero children, turn it into an em
syntax/tree.go:1769
↓ 4 callersFunctionstringFixedDistanceSetFilter
(set syntax.FixedDistanceSet, minRequiredLength int)
stringprefixfilter.go:98
↓ 4 callersMethoduseOptionI
True if I option enabling case-insensitivity is on.
syntax/parser.go:2247
↓ 3 callersMethodCapture
Capture captures a subexpression. Note that the capnum used here has already been mapped to a non-sparse index (by the code generator RegexWriter).
runner.go:2001
↓ 3 callersMethodCopy
Copy makes a deep copy to prevent accidental mutation of a set
syntax/charclass.go:170
↓ 3 callersFunctionEscape
(input string)
syntax/escape.go:10
↓ 3 callersMethodFindAllRunesIndex
FindAllRunesIndex returns a slice of rune index pairs identifying all successive matches in r.
regexp.go:330
↓ 3 callersMethodFindAllStringSubmatchIndex
(s string, n int)
compat/interface.go:34
↓ 3 callersMethodFindStringIndex
(s string)
compat/interface.go:23
↓ 3 callersMethodFindStringSubmatch
(s string)
compat/interface.go:24
↓ 3 callersMethodFindStringSubmatchIndex
(s string)
compat/interface.go:25
↓ 3 callersFunctionIndexOfAny1
(in []rune, find rune)
helpers/indexof.go:27
↓ 3 callersFunctionIndexOfIgnoreCase
TODO: LastIndexOf methods IndexOfAnyInRange LastIndexOfAnyInRange LastIndexOfAnyExceptInRange find should always be sent in lower-case
helpers/indexof.go:189
↓ 3 callersFunctionIndexOfIgnoreCaseAscii
(in []rune, find []rune)
helpers/indexof.go:212
↓ 3 callersFunctionIsECMAIdentifierStartChar
(r rune)
syntax/charclass.go:463
↓ 3 callersMethodIsNotoneloopFamily
()
syntax/tree.go:247
↓ 3 callersMethodIsOneloopFamily
()
syntax/tree.go:244
↓ 3 callersMethodIsSetloopFamily
()
syntax/tree.go:241
↓ 3 callersMethodIsSingleton
()
syntax/charclass.go:478
↓ 3 callersFunctionOptionMaxCachedReplacerDataEntries
OptionMaxCachedReplacerDataEntries limits parsed replacement patterns cached per Regexp.
options.go:131
↓ 3 callersMethodReplaceFunc
ReplaceFunc searches the input string and replaces each match found using the string from the evaluator Count will limit the number of matches attempt
regexp.go:230
↓ 3 callersMethodScan
Scan uses the Boyer-Moore algorithm to find the first occurrence of the specified string within text, beginning at index, and constrained within begli
syntax/prefix.go:622
↓ 3 callersMethodSingletonChar
SingletonChar will return the char from the first range without validation. It assumes you have checked for IsSingleton or IsSingletonInverse and will
syntax/charclass.go:474
↓ 3 callersFunctionStartsWith
(in []rune, find []rune)
helpers/indexof.go:321
↓ 3 callersFunctionStopTimeoutClock
StopTimeoutClock should only be used in unit tests to prevent the timeout clock goroutine from appearing like a leaking goroutine
regexp.go:171
↓ 3 callersFunctionWrap
Wrap returns an adapter around re.
compat/regexp.go:37
↓ 3 callersMethodaddDigit
(ecma, negate bool)
syntax/charclass.go:512
↓ 3 callersMethodaddMatch
Nonpublic builder: add a capture to the group specified by "c"
match.go:269
↓ 3 callersFunctioncaptureIndex
(c *regexp2.Capture)
compat/regexp.go:346
↓ 3 callersFunctioncorpusIntSlicesEqual
(a, b []int)
regexp_corpus_helpers_test.go:58
↓ 3 callersFunctiondoubleIntSlice
(s *[]int, pos *int)
runner.go:986
↓ 3 callersFunctionfindFirstCharClass
Computes a character class for the first character in tree. This uses a more robust algorithm than is used by TryFindFixedLiterals and thus can find
syntax/prefixanalyzer.go:19
↓ 3 callersFunctionfindLeadingStringsLeftToRight
(r *Runner, prefixes [][]rune, firstRunes []rune, ignoreCase bool)
runner.go:1552
↓ 3 callersMethodfindStringPrefixCandidate
(input string, startAt int)
stringprefixfilter.go:399
↓ 3 callersFunctionfoldASCII
(c rune)
helpers/indexof.go:286
↓ 3 callersMethodforEachStringMatch
(s string, n int, f func(*regexp2.Match))
compat/regexp.go:287
↓ 3 callersFunctiongetPooledReplaceBuffer
(neededBytes, maxSize int)
bufferpool.go:68
↓ 3 callersMethodinitCaches
()
regexp.go:677
↓ 3 callersFunctionisStringRuneBoundary
(s string, index int)
stringprefixfilter.go:440
↓ 3 callersMethodmakeAnything
()
syntax/charclass.go:573
↓ 3 callersFunctionmakeDeadline
makeDeadline returns a time that is approximately time.Now().Add(d)
fastclock.go:46
↓ 3 callersMethodmakeLoopAtomic
()
syntax/tree.go:700
↓ 3 callersMethodmakeRep
Pass type as OneLazy or OneLoop
syntax/tree.go:292
↓ 3 callersFunctionmakeText
(n int)
regexp_performance_test.go:210
↓ 3 callersMethodmatchIndex
matchIndex returns the index of the last specified matched group by capnum
match.go:249
↓ 3 callersMethodmatchLength
matchLength returns the length of the last specified matched group by capnum
match.go:259
↓ 3 callersFunctionnewCompileConfig
(options []CompileOption)
options.go:96
↓ 3 callersFunctionnewMatchText
(r []rune)
match.go:83
↓ 3 callersFunctionnewRegexNodeMN
(t NodeType, opt RegexOptions, m, n int)
syntax/tree.go:171
↓ 3 callersMethodnoteCaptureSlot
(i, pos int)
syntax/parser.go:203
↓ 3 callersMethodpoolIndex
(neededSize, maxSize int)
bufferpool.go:23
↓ 3 callersFunctionreadRunes
(r io.RuneReader)
compat/regexp.go:355
↓ 3 callersMethodreduce
()
syntax/tree.go:473
↓ 3 callersMethodscanCharEscape
Scans \ code for escape codes that map to single unicode chars.
syntax/parser.go:1969
↓ 3 callersFunctionsetCaptureFields
(c *Capture, runeIndex, runeLength int)
match.go:417
↓ 3 callersMethodsetOperator
(op int)
runner.go:1153
↓ 3 callersMethodsetPattern
(pattern string)
syntax/parser.go:190
↓ 3 callersFunctionstringFixedDistanceCandidateStart
(input string, startAt, byteIndex, distance int)
stringprefixfilter.go:384
↓ 3 callersFunctionstringFixedDistanceCharFilter
(ch rune, distance, minRequiredLength int)
stringprefixfilter.go:287
↓ 3 callersFunctionstringFixedDistanceStringFilter
(literal string, distance, minRequiredLength int)
stringprefixfilter.go:320
↓ 3 callersMethoduseOptionX
True if X option enabling whitespace/comment mode is on.
syntax/parser.go:2262
↓ 2 callersMethodCheckTimeout
()
runner.go:2150
↓ 2 callersMethodComputeMinLength
Computes a min bound on the required length of any string that could possibly match. If the result is 0, there is no minimum we can enforce.
syntax/tree.go:1872
↓ 2 callersMethodCrawlpos
Get the height of the stack
runner.go:1012
↓ 2 callersFunctionEquals
(in []rune, start int, length int, find []rune)
helpers/indexof.go:369
↓ 2 callersFunctionEscape
Escape adds backslashes to any special characters in the input string
regexp.go:153
↓ 2 callersMethodFind
(b []byte)
compat/interface.go:18
↓ 2 callersMethodFindAll
(b []byte, n int)
compat/interface.go:29
↓ 2 callersMethodFindAllSubmatchIndex
(b []byte, n int)
compat/interface.go:36
↓ 2 callersMethodFindIndex
(b []byte)
compat/interface.go:19
↓ 2 callersMethodFindLastExpressionInLoopForAutoAtomic
Recurs into the last expression of a loop node, looking to see if it can find a node that could be made atomic _assuming_ the conditions exist for it
syntax/tree.go:825
↓ 2 callersMethodFindReaderSubmatchIndex
(r io.RuneReader)
compat/interface.go:21
↓ 2 callersMethodFindRunesMatch
FindRunesMatch searches the input rune slice for a Regexp match
regexp.go:252
↓ 2 callersMethodFindString
(s string)
compat/interface.go:22
↓ 2 callersMethodFindSubmatch
(b []byte)
compat/interface.go:26
↓ 2 callersMethodFindSubmatchIndex
(b []byte)
compat/interface.go:27
↓ 2 callersMethodGetIfNRanges
(n int)
syntax/charclass.go:1383
↓ 2 callersMethodGroupNameFromNumber
GroupNameFromNumber retrieves a group name that corresponds to a group number. It will return "" for an unknown group number. Unnamed groups automatic
regexp.go:602
↓ 2 callersMethodIndexOfAny
(in []rune)
helpers/searchvalues.go:155
↓ 2 callersFunctionIndexOfAnyExcept
(in []rune, bad []rune)
helpers/indexof.go:61
↓ 2 callersMethodIsAnything
()
syntax/charclass.go:508
↓ 2 callersFunctionIsECMAWordChar
(r rune)
syntax/charclass.go:455
↓ 2 callersMethodIsSingletonInverse
()
syntax/charclass.go:485
↓ 2 callersFunctionNewStringSearchValues
(vals [][]rune, ignoreCase bool)
helpers/searchvalues.go:123
↓ 2 callersMethodOpcodeDescription
OpcodeDescription is a humman readable string of the specific offset
syntax/code.go:246
↓ 2 callersFunctionOptionDebug
OptionDebug enables debug output and runner tracing for the compiled regexp.
options.go:159
↓ 2 callersFunctionOptionIsCodeGen
OptionIsCodeGen enables more expensive compile-time analysis intended for regexp2cg generated engines.
options.go:152
↓ 2 callersFunctionOptionMaxCachedReplacerDataBytes
OptionMaxCachedReplacerDataBytes skips caching replacement patterns longer than n bytes.
options.go:138
← previousnext →101–200 of 981, ranked by callers