regexp/syntax.parser.stack (field)

48 uses

	regexp/syntax (current package)
		parse.go#L81: 	stack       []*Regexp // stack of parsed expressions
		parse.go#L139: 	p.stack = append(p.stack, re)
		parse.go#L153: 	n := len(p.stack)
		parse.go#L158: 	re1 := p.stack[n-1]
		parse.go#L159: 	re2 := p.stack[n-2]
		parse.go#L175: 	p.stack = p.stack[:n-1]
		parse.go#L233: 	n := len(p.stack)
		parse.go#L237: 	sub := p.stack[n-1]
		parse.go#L248: 	p.stack[n-1] = re
		parse.go#L295: 	i := len(p.stack)
		parse.go#L296: 	for i > 0 && p.stack[i-1].Op < opPseudo {
		parse.go#L299: 	subs := p.stack[i:]
		parse.go#L300: 	p.stack = p.stack[:i]
		parse.go#L314: 	i := len(p.stack)
		parse.go#L315: 	for i > 0 && p.stack[i-1].Op < opPseudo {
		parse.go#L318: 	subs := p.stack[i:]
		parse.go#L319: 	p.stack = p.stack[:i]
		parse.go#L888: 		p.stack = p.stack[:len(p.stack)-1]
		parse.go#L892: 	n := len(p.stack)
		parse.go#L896: 	return p.stack[0], nil
		parse.go#L1171: 	n := len(p.stack)
		parse.go#L1172: 	if n >= 3 && p.stack[n-2].Op == opVerticalBar && isCharClass(p.stack[n-1]) && isCharClass(p.stack[n-3]) {
		parse.go#L1173: 		re1 := p.stack[n-1]
		parse.go#L1174: 		re3 := p.stack[n-3]
		parse.go#L1178: 			p.stack[n-3] = re3
		parse.go#L1182: 		p.stack = p.stack[:n-1]
		parse.go#L1187: 		re1 := p.stack[n-1]
		parse.go#L1188: 		re2 := p.stack[n-2]
		parse.go#L1193: 				cleanAlt(p.stack[n-3])
		parse.go#L1195: 			p.stack[n-2] = re1
		parse.go#L1196: 			p.stack[n-1] = re2
		parse.go#L1208: 		p.stack = p.stack[:len(p.stack)-1]
		parse.go#L1212: 	n := len(p.stack)
		parse.go#L1216: 	re1 := p.stack[n-1]
		parse.go#L1217: 	re2 := p.stack[n-2]
		parse.go#L1218: 	p.stack = p.stack[:n-2]