regexp/syntax.Regexp.Rune (field)

122 uses

	regexp/syntax (current package)
		compile.go#L96: 		if len(re.Rune) == 0 {
		compile.go#L100: 		for j := range re.Rune {
		compile.go#L101: 			f1 := c.rune(re.Rune[j:j+1], re.Flags)
		compile.go#L110: 		return c.rune(re.Rune, re.Flags)
		parse.go#L221: 		size = int64(len(re.Rune))
		parse.go#L293: 	p.numRunes += len(re.Rune)
		parse.go#L294: 	if re.Op == OpCharClass && len(re.Rune) == 2 && re.Rune[0] == re.Rune[1] {
		parse.go#L296: 		if p.maybeConcat(re.Rune[0], p.flags&^FoldCase) {
		parse.go#L300: 		re.Rune = re.Rune[:1]
		parse.go#L302: 	} else if re.Op == OpCharClass && len(re.Rune) == 4 &&
		parse.go#L303: 		re.Rune[0] == re.Rune[1] && re.Rune[2] == re.Rune[3] &&
		parse.go#L304: 		unicode.SimpleFold(re.Rune[0]) == re.Rune[2] &&
		parse.go#L305: 		unicode.SimpleFold(re.Rune[2]) == re.Rune[0] ||
		parse.go#L306: 		re.Op == OpCharClass && len(re.Rune) == 2 &&
		parse.go#L307: 			re.Rune[0]+1 == re.Rune[1] &&
		parse.go#L308: 			unicode.SimpleFold(re.Rune[0]) == re.Rune[1] &&
		parse.go#L309: 			unicode.SimpleFold(re.Rune[1]) == re.Rune[0] {
		parse.go#L311: 		if p.maybeConcat(re.Rune[0], p.flags|FoldCase) {
		parse.go#L317: 		re.Rune = re.Rune[:1]
		parse.go#L351: 	re2.Rune = append(re2.Rune, re1.Rune...)
		parse.go#L355: 		re1.Rune = re1.Rune0[:1]
		parse.go#L356: 		re1.Rune[0] = r
		parse.go#L374: 	re.Rune = re.Rune0[:1]
		parse.go#L525: 		re.Rune = cleanClass(&re.Rune)
		parse.go#L526: 		if len(re.Rune) == 2 && re.Rune[0] == 0 && re.Rune[1] == unicode.MaxRune {
		parse.go#L527: 			re.Rune = nil
		parse.go#L531: 		if len(re.Rune) == 4 && re.Rune[0] == 0 && re.Rune[1] == '\n'-1 && re.Rune[2] == '\n'+1 && re.Rune[3] == unicode.MaxRune {
		parse.go#L532: 			re.Rune = nil
		parse.go#L536: 		if cap(re.Rune)-len(re.Rune) > 100 {
		parse.go#L539: 			re.Rune = append(re.Rune0[:0], re.Rune...)
		parse.go#L637: 			prefix.Rune = append(prefix.Rune[:0], str...)
		parse.go#L739: 				if sub[max].Op < sub[j].Op || sub[max].Op == sub[j].Op && len(sub[max].Rune) < len(sub[j].Rune) {
		parse.go#L784: 	return re.Rune, re.Flags & FoldCase
		parse.go#L816: 		re.Rune = re.Rune[:copy(re.Rune, re.Rune[n:])]
		parse.go#L817: 		if len(re.Rune) == 0 {
		parse.go#L869: 	re.Rune = re.Rune0[:0] // use local storage for small strings
		parse.go#L871: 		if len(re.Rune) >= cap(re.Rune) {
		parse.go#L873: 			re.Rune = []rune(s)
		parse.go#L876: 		re.Rune = append(re.Rune, c)
		parse.go#L1059: 					re.Rune = r
		parse.go#L1068: 				re.Rune = r
		parse.go#L1302: 	return re.Op == OpLiteral && len(re.Rune) == 1 ||
		parse.go#L1312: 		return len(re.Rune) == 1 && re.Rune[0] == r
		parse.go#L1314: 		for i := 0; i < len(re.Rune); i += 2 {
		parse.go#L1315: 			if re.Rune[i] <= r && r <= re.Rune[i+1] {
		parse.go#L1356: 			dst.Rune = appendLiteral(dst.Rune, src.Rune[0], src.Flags)
		parse.go#L1358: 			dst.Rune = appendClass(dst.Rune, src.Rune)
		parse.go#L1362: 		if src.Rune[0] == dst.Rune[0] && src.Flags == dst.Flags {
		parse.go#L1366: 		dst.Rune = appendLiteral(dst.Rune[:0], dst.Rune[0], dst.Flags)
		parse.go#L1367: 		dst.Rune = appendLiteral(dst.Rune, src.Rune[0], src.Flags)
		parse.go#L1738: 	re.Rune = re.Rune0[:0]
		parse.go#L1748: 			re.Rune = append(re.Rune, '\n', '\n')
		parse.go#L1752: 	class := re.Rune
		parse.go#L1818: 	re.Rune = class
		parse.go#L1819: 	class = cleanClass(&re.Rune)
		parse.go#L1823: 	re.Rune = class
		regexp.go#L23: 	Rune     []rune     // matched runes, for OpLiteral, OpCharClass
		regexp.go#L79: 		return slices.Equal(x.Rune, y.Rune)
		regexp.go#L138: 		for _, r := range re.Rune {
		regexp.go#L152: 		for i := 0; i < len(re.Rune); i += 2 {
		regexp.go#L153: 			lo := max(minFold, re.Rune[i])
		regexp.go#L154: 			hi := min(maxFold, re.Rune[i+1])
		regexp.go#L157: 					if !(lo <= f && f <= hi) && !inCharClass(f, re.Rune) {
		regexp.go#L269: 		for _, r := range re.Rune {
		regexp.go#L273: 		if len(re.Rune)%2 != 0 {
		regexp.go#L278: 		if len(re.Rune) == 0 {
		regexp.go#L280: 		} else if re.Rune[0] == 0 && re.Rune[len(re.Rune)-1] == unicode.MaxRune && len(re.Rune) > 2 {
		regexp.go#L284: 			for i := 1; i < len(re.Rune)-1; i += 2 {
		regexp.go#L285: 				lo, hi := re.Rune[i]+1, re.Rune[i+1]-1
		regexp.go#L295: 			for i := 0; i < len(re.Rune); i += 2 {
		regexp.go#L296: 				lo, hi := re.Rune[i], re.Rune[i+1]
		regexp.go#L340: 		if sub.Op > OpCapture || sub.Op == OpLiteral && len(sub.Rune) > 1 {
		simplify.go#L28: 				nre.Rune = nil

	regexp
		regexp.go#L276: 		for _, r := range re.Rune {