| /dports/lang/mono/mono-5.10.1.57/mcs/class/referencesource/System/regex/system/text/regularexpressions/ |
| H A D | RegexTree.cs | 17 …internal RegexTree(RegexNode root, Dictionary<Int32, Int32> caps, Int32[] capnumlist, int captop, … in RegexTree() argument
19 …internal RegexTree(RegexNode root, Hashtable caps, Int32[] capnumlist, int captop, Hashtable capna… in RegexTree()
25 _capnumlist = capnumlist; in RegexTree()
|
| /dports/lang/mono/mono-5.10.1.57/external/corefx/src/System.Text.RegularExpressions/src/System/Text/RegularExpressions/ |
| H A D | RegexTree.cs | 14 …internal RegexTree(RegexNode root, Hashtable caps, int[] capnumlist, int captop, Hashtable capname… in RegexTree() argument
18 _capnumlist = capnumlist; in RegexTree()
|
| /dports/www/gitlab-workhorse/gitlab-foss-0a901d60f8ae4a60c04ae82e6e9c3a03e9321417/workhorse/vendor/github.com/dlclark/regexp2/syntax/ |
| H A D | writer.go | 67 if tree.capnumlist == nil || tree.captop == len(tree.capnumlist) {
71 capsize = len(tree.capnumlist)
73 for i := 0; i < len(tree.capnumlist); i++ {
74 w.caps[tree.capnumlist[i]] = i
|
| H A D | parser.go | 135 capnumlist []int member
169 capnumlist: p.capnumlist,
239 p.capnumlist = make([]int, p.capcount)
243 p.capnumlist[i] = k
247 sort.Ints(p.capnumlist)
251 if p.capnames != nil || p.capnumlist != nil {
269 if p.capnumlist != nil {
270 j = p.capnumlist[i]
|
| /dports/www/grafana8/grafana-8.3.6/vendor/github.com/dlclark/regexp2/syntax/ |
| H A D | writer.go | 67 if tree.capnumlist == nil || tree.captop == len(tree.capnumlist) {
71 capsize = len(tree.capnumlist)
73 for i := 0; i < len(tree.capnumlist); i++ {
74 w.caps[tree.capnumlist[i]] = i
|
| H A D | parser.go | 135 capnumlist []int member
169 capnumlist: p.capnumlist,
239 p.capnumlist = make([]int, p.capcount)
243 p.capnumlist[i] = k
247 sort.Ints(p.capnumlist)
251 if p.capnames != nil || p.capnumlist != nil {
269 if p.capnumlist != nil {
270 j = p.capnumlist[i]
|
| /dports/devel/gh/cli-2.4.0/vendor/github.com/dlclark/regexp2/syntax/ |
| H A D | writer.go | 67 if tree.capnumlist == nil || tree.captop == len(tree.capnumlist) {
71 capsize = len(tree.capnumlist)
73 for i := 0; i < len(tree.capnumlist); i++ {
74 w.caps[tree.capnumlist[i]] = i
|
| H A D | parser.go | 135 capnumlist []int member
169 capnumlist: p.capnumlist,
239 p.capnumlist = make([]int, p.capcount)
243 p.capnumlist[i] = k
247 sort.Ints(p.capnumlist)
251 if p.capnames != nil || p.capnumlist != nil {
269 if p.capnumlist != nil {
270 j = p.capnumlist[i]
|
| /dports/www/gitea/gitea-1.16.5/vendor/github.com/dlclark/regexp2/syntax/ |
| H A D | writer.go | 67 if tree.capnumlist == nil || tree.captop == len(tree.capnumlist) {
71 capsize = len(tree.capnumlist)
73 for i := 0; i < len(tree.capnumlist); i++ {
74 w.caps[tree.capnumlist[i]] = i
|
| H A D | parser.go | 135 capnumlist []int member
169 capnumlist: p.capnumlist,
239 p.capnumlist = make([]int, p.capcount)
243 p.capnumlist[i] = k
247 sort.Ints(p.capnumlist)
251 if p.capnames != nil || p.capnumlist != nil {
269 if p.capnumlist != nil {
270 j = p.capnumlist[i]
|
| /dports/sysutils/chezmoi/chezmoi-2.9.3/vendor/github.com/dlclark/regexp2/syntax/ |
| H A D | writer.go | 67 if tree.capnumlist == nil || tree.captop == len(tree.capnumlist) {
71 capsize = len(tree.capnumlist)
73 for i := 0; i < len(tree.capnumlist); i++ {
74 w.caps[tree.capnumlist[i]] = i
|
| /dports/databases/cayley/cayley-0.7.5-2-gcf576ba/vendor/github.com/dlclark/regexp2/syntax/ |
| H A D | writer.go | 66 if tree.capnumlist == nil || tree.captop == len(tree.capnumlist) {
70 capsize = len(tree.capnumlist)
72 for i := 0; i < len(tree.capnumlist); i++ {
73 w.caps[tree.capnumlist[i]] = i
|
| H A D | parser.go | 132 capnumlist []int member
166 capnumlist: p.capnumlist,
230 p.capnumlist = make([]int, p.capcount)
234 p.capnumlist[i] = k
238 sort.Ints(p.capnumlist)
242 if p.capnames != nil || p.capnumlist != nil {
260 if p.capnumlist != nil {
261 j = p.capnumlist[i]
|
| /dports/www/gohugo/hugo-0.91.2/vendor/github.com/dlclark/regexp2/syntax/ |
| H A D | writer.go | 67 if tree.capnumlist == nil || tree.captop == len(tree.capnumlist) {
71 capsize = len(tree.capnumlist)
73 for i := 0; i < len(tree.capnumlist); i++ {
74 w.caps[tree.capnumlist[i]] = i
|
| H A D | parser.go | 135 capnumlist []int member
169 capnumlist: p.capnumlist,
239 p.capnumlist = make([]int, p.capcount)
243 p.capnumlist[i] = k
247 sort.Ints(p.capnumlist)
251 if p.capnames != nil || p.capnumlist != nil {
269 if p.capnumlist != nil {
270 j = p.capnumlist[i]
|
| /dports/net-p2p/go-ethereum/go-ethereum-1.10.14/vendor/github.com/dlclark/regexp2/syntax/ |
| H A D | writer.go | 67 if tree.capnumlist == nil || tree.captop == len(tree.capnumlist) {
71 capsize = len(tree.capnumlist)
73 for i := 0; i < len(tree.capnumlist); i++ {
74 w.caps[tree.capnumlist[i]] = i
|
| H A D | parser.go | 135 capnumlist []int member
169 capnumlist: p.capnumlist,
239 p.capnumlist = make([]int, p.capcount)
243 p.capnumlist[i] = k
247 sort.Ints(p.capnumlist)
251 if p.capnames != nil || p.capnumlist != nil {
269 if p.capnumlist != nil {
270 j = p.capnumlist[i]
|
| /dports/devel/chroma/chroma-0.9.2/vendor/github.com/dlclark/regexp2/syntax/ |
| H A D | writer.go | 67 if tree.capnumlist == nil || tree.captop == len(tree.capnumlist) {
71 capsize = len(tree.capnumlist)
73 for i := 0; i < len(tree.capnumlist); i++ {
74 w.caps[tree.capnumlist[i]] = i
|
| /dports/misc/cheat/cheat-4.2.2/vendor/github.com/dlclark/regexp2/regexp2-1.4.0/syntax/ |
| H A D | writer.go | 67 if tree.capnumlist == nil || tree.captop == len(tree.capnumlist) {
71 capsize = len(tree.capnumlist)
73 for i := 0; i < len(tree.capnumlist); i++ {
74 w.caps[tree.capnumlist[i]] = i
|
| H A D | parser.go | 135 capnumlist []int member
169 capnumlist: p.capnumlist,
239 p.capnumlist = make([]int, p.capcount)
243 p.capnumlist[i] = k
247 sort.Ints(p.capnumlist)
251 if p.capnames != nil || p.capnumlist != nil {
269 if p.capnumlist != nil {
270 j = p.capnumlist[i]
|
| /dports/misc/cheat/cheat-4.2.2/vendor/github.com/dlclark/regexp2/syntax/ |
| H A D | writer.go | 67 if tree.capnumlist == nil || tree.captop == len(tree.capnumlist) {
71 capsize = len(tree.capnumlist)
73 for i := 0; i < len(tree.capnumlist); i++ {
74 w.caps[tree.capnumlist[i]] = i
|
| H A D | parser.go | 135 capnumlist []int member
169 capnumlist: p.capnumlist,
239 p.capnumlist = make([]int, p.capcount)
243 p.capnumlist[i] = k
247 sort.Ints(p.capnumlist)
251 if p.capnames != nil || p.capnumlist != nil {
269 if p.capnumlist != nil {
270 j = p.capnumlist[i]
|
| /dports/sysutils/glow/glow-0.2.0/vendor/github.com/dlclark/regexp2/syntax/ |
| H A D | writer.go | 67 if tree.capnumlist == nil || tree.captop == len(tree.capnumlist) {
71 capsize = len(tree.capnumlist)
73 for i := 0; i < len(tree.capnumlist); i++ {
74 w.caps[tree.capnumlist[i]] = i
|
| /dports/sysutils/go-wtf/wtf-0.21.0/vendor/github.com/dlclark/regexp2/regexp2-1.1.6/syntax/ |
| H A D | writer.go | 67 if tree.capnumlist == nil || tree.captop == len(tree.capnumlist) {
71 capsize = len(tree.capnumlist)
73 for i := 0; i < len(tree.capnumlist); i++ {
74 w.caps[tree.capnumlist[i]] = i
|
| /dports/sysutils/go-wtf/wtf-0.21.0/vendor/github.com/dlclark/regexp2/syntax/ |
| H A D | writer.go | 67 if tree.capnumlist == nil || tree.captop == len(tree.capnumlist) {
71 capsize = len(tree.capnumlist)
73 for i := 0; i < len(tree.capnumlist); i++ {
74 w.caps[tree.capnumlist[i]] = i
|