regexp/syntax.Regexp.Sub (field)
94 uses
regexp/syntax (current package)
compile.go#L128: sub := c.compile(re.Sub[0])
compile.go#L132: return c.star(c.compile(re.Sub[0]), re.Flags&NonGreedy != 0)
compile.go#L134: return c.plus(c.compile(re.Sub[0]), re.Flags&NonGreedy != 0)
compile.go#L136: return c.quest(c.compile(re.Sub[0]), re.Flags&NonGreedy != 0)
compile.go#L138: if len(re.Sub) == 0 {
compile.go#L142: for i, sub := range re.Sub {
compile.go#L152: for _, sub := range re.Sub {
parse.go#L246: re.Sub = re.Sub0[:1]
parse.go#L247: re.Sub[0] = sub
parse.go#L282: for _, sub := range re.Sub {
parse.go#L368: re.Sub = re.Sub0[:0]
parse.go#L371: re.Sub = append(re.Sub, sub.Sub...)
parse.go#L374: re.Sub = append(re.Sub, sub)
parse.go#L378: re.Sub = p.factor(re.Sub)
parse.go#L379: if len(re.Sub) == 1 {
parse.go#L381: re = re.Sub[0]
parse.go#L456: re.Sub = append(re.Sub[:0], prefix, suffix)
parse.go#L489: (isCharClass(first) || (first.Op == OpRepeat && first.Min == first.Max && isCharClass(first.Sub[0]))) {
parse.go#L513: re.Sub = append(re.Sub[:0], prefix, suffix)
parse.go#L587: if re.Op == OpConcat && len(re.Sub) > 0 {
parse.go#L588: re = re.Sub[0]
parse.go#L599: if re.Op == OpConcat && len(re.Sub) > 0 {
parse.go#L602: sub := re.Sub[0]
parse.go#L604: re.Sub[0] = sub
parse.go#L607: switch len(re.Sub) {
parse.go#L611: re.Sub = nil
parse.go#L614: re = re.Sub[1]
parse.go#L617: copy(re.Sub, re.Sub[1:])
parse.go#L618: re.Sub = re.Sub[:len(re.Sub)-1]
parse.go#L639: if re.Op == OpConcat && len(re.Sub) > 0 {
parse.go#L640: sub := re.Sub[0]
parse.go#L653: if re.Op == OpConcat && len(re.Sub) > 0 {
parse.go#L655: p.reuse(re.Sub[0])
parse.go#L657: re.Sub = re.Sub[:copy(re.Sub, re.Sub[1:])]
parse.go#L658: switch len(re.Sub) {
parse.go#L661: re.Sub = nil
parse.go#L664: re = re.Sub[0]
parse.go#L1229: re2.Sub = re2.Sub0[:1]
parse.go#L1230: re2.Sub[0] = re1
regexp.go#L20: Sub []*Regexp // subexpressions, if any
regexp.go#L88: if len(x.Sub) != len(y.Sub) {
regexp.go#L91: for i, sub := range x.Sub {
regexp.go#L92: if !sub.Equal(y.Sub[i]) {
regexp.go#L98: if x.Flags&NonGreedy != y.Flags&NonGreedy || !x.Sub[0].Equal(y.Sub[0]) {
regexp.go#L103: if x.Flags&NonGreedy != y.Flags&NonGreedy || x.Min != y.Min || x.Max != y.Max || !x.Sub[0].Equal(y.Sub[0]) {
regexp.go#L108: if x.Cap != y.Cap || x.Name != y.Name || !x.Sub[0].Equal(y.Sub[0]) {
regexp.go#L193: if re.Sub[0].Op != OpEmptyMatch {
regexp.go#L194: writeRegexp(b, re.Sub[0])
regexp.go#L198: if sub := re.Sub[0]; sub.Op > OpCapture || sub.Op == OpLiteral && len(sub.Rune) > 1 {
regexp.go#L227: for _, sub := range re.Sub {
regexp.go#L237: for i, sub := range re.Sub {
regexp.go#L298: for _, sub := range re.Sub {
regexp.go#L317: for _, sub := range re.Sub {
simplify.go#L22: for i, sub := range re.Sub {
simplify.go#L29: nre.Sub = append(nre.Sub0[:0], re.Sub[:i]...)
simplify.go#L32: nre.Sub = append(nre.Sub, nsub)
simplify.go#L38: sub := re.Sub[0].Simplify()
simplify.go#L49: sub := re.Sub[0].Simplify()
simplify.go#L65: nre.Sub = nre.Sub0[:0]
simplify.go#L67: nre.Sub = append(nre.Sub, sub)
simplify.go#L69: nre.Sub = append(nre.Sub, simplify1(OpPlus, re.Flags, sub, nil))
simplify.go#L88: prefix.Sub = prefix.Sub0[:0]
simplify.go#L90: prefix.Sub = append(prefix.Sub, sub)
simplify.go#L99: nre2.Sub = append(nre2.Sub0[:0], sub, suffix)
simplify.go#L105: prefix.Sub = append(prefix.Sub, suffix)
simplify.go#L144: if re != nil && re.Op == op && re.Flags&NonGreedy == flags&NonGreedy && sub == re.Sub[0] {
simplify.go#L149: re.Sub = append(re.Sub0[:0], sub)
regexp
regexp.go#L283: return minInputLen(re.Sub[0])
regexp.go#L285: return re.Min * minInputLen(re.Sub[0])
regexp.go#L288: for _, sub := range re.Sub {
regexp.go#L293: l := minInputLen(re.Sub[0])
regexp.go#L295: for _, sub := range re.Sub[1:] {
 |
The pages are generated with Golds v0.3.2-preview. (GOOS=darwin GOARCH=amd64)
Golds is a Go 101 project developed by Tapir Liu.
PR and bug reports are welcome and can be submitted to the issue list.
Please follow @Go100and1 (reachable from the left QR code) to get the latest news of Golds. |