regexp/syntax.Regexp.Rune (field)
117 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#L161: if re.Op == OpCharClass && len(re.Rune) == 2 && re.Rune[0] == re.Rune[1] {
parse.go#L163: if p.maybeConcat(re.Rune[0], p.flags&^FoldCase) {
parse.go#L167: re.Rune = re.Rune[:1]
parse.go#L169: } else if re.Op == OpCharClass && len(re.Rune) == 4 &&
parse.go#L170: re.Rune[0] == re.Rune[1] && re.Rune[2] == re.Rune[3] &&
parse.go#L171: unicode.SimpleFold(re.Rune[0]) == re.Rune[2] &&
parse.go#L172: unicode.SimpleFold(re.Rune[2]) == re.Rune[0] ||
parse.go#L173: re.Op == OpCharClass && len(re.Rune) == 2 &&
parse.go#L174: re.Rune[0]+1 == re.Rune[1] &&
parse.go#L175: unicode.SimpleFold(re.Rune[0]) == re.Rune[1] &&
parse.go#L176: unicode.SimpleFold(re.Rune[1]) == re.Rune[0] {
parse.go#L178: if p.maybeConcat(re.Rune[0], p.flags|FoldCase) {
parse.go#L184: re.Rune = re.Rune[:1]
parse.go#L218: re2.Rune = append(re2.Rune, re1.Rune...)
parse.go#L222: re1.Rune = re1.Rune0[:1]
parse.go#L223: re1.Rune[0] = r
parse.go#L241: re.Rune = re.Rune0[:1]
parse.go#L394: re.Rune = cleanClass(&re.Rune)
parse.go#L395: if len(re.Rune) == 2 && re.Rune[0] == 0 && re.Rune[1] == unicode.MaxRune {
parse.go#L396: re.Rune = nil
parse.go#L400: 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#L401: re.Rune = nil
parse.go#L405: if cap(re.Rune)-len(re.Rune) > 100 {
parse.go#L408: re.Rune = append(re.Rune0[:0], re.Rune...)
parse.go#L502: prefix.Rune = append(prefix.Rune[:0], str...)
parse.go#L602: if sub[max].Op < sub[j].Op || sub[max].Op == sub[j].Op && len(sub[max].Rune) < len(sub[j].Rune) {
parse.go#L647: return re.Rune, re.Flags & FoldCase
parse.go#L679: re.Rune = re.Rune[:copy(re.Rune, re.Rune[n:])]
parse.go#L680: if len(re.Rune) == 0 {
parse.go#L732: re.Rune = re.Rune0[:0] // use local storage for small strings
parse.go#L734: if len(re.Rune) >= cap(re.Rune) {
parse.go#L736: re.Rune = []rune(s)
parse.go#L739: re.Rune = append(re.Rune, c)
parse.go#L922: re.Rune = r
parse.go#L931: re.Rune = r
parse.go#L1156: return re.Op == OpLiteral && len(re.Rune) == 1 ||
parse.go#L1166: return len(re.Rune) == 1 && re.Rune[0] == r
parse.go#L1168: for i := 0; i < len(re.Rune); i += 2 {
parse.go#L1169: if re.Rune[i] <= r && r <= re.Rune[i+1] {
parse.go#L1212: dst.Rune = appendLiteral(dst.Rune, src.Rune[0], src.Flags)
parse.go#L1214: dst.Rune = appendClass(dst.Rune, src.Rune)
parse.go#L1218: if src.Rune[0] == dst.Rune[0] && src.Flags == dst.Flags {
parse.go#L1222: dst.Rune = appendLiteral(dst.Rune[:0], dst.Rune[0], dst.Flags)
parse.go#L1223: dst.Rune = appendLiteral(dst.Rune, src.Rune[0], src.Flags)
parse.go#L1592: re.Rune = re.Rune0[:0]
parse.go#L1602: re.Rune = append(re.Rune, '\n', '\n')
parse.go#L1606: class := re.Rune
parse.go#L1672: re.Rune = class
parse.go#L1673: class = cleanClass(&re.Rune)
parse.go#L1677: re.Rune = class
regexp.go#L22: Rune []rune // matched runes, for OpLiteral, OpCharClass
regexp.go#L78: if len(x.Rune) != len(y.Rune) {
regexp.go#L81: for i, r := range x.Rune {
regexp.go#L82: if r != y.Rune[i] {
regexp.go#L128: for _, r := range re.Rune {
regexp.go#L135: if len(re.Rune)%2 != 0 {
regexp.go#L140: if len(re.Rune) == 0 {
regexp.go#L142: } else if re.Rune[0] == 0 && re.Rune[len(re.Rune)-1] == unicode.MaxRune && len(re.Rune) > 2 {
regexp.go#L146: for i := 1; i < len(re.Rune)-1; i += 2 {
regexp.go#L147: lo, hi := re.Rune[i]+1, re.Rune[i+1]-1
regexp.go#L155: for i := 0; i < len(re.Rune); i += 2 {
regexp.go#L156: lo, hi := re.Rune[i], re.Rune[i+1]
regexp.go#L198: if sub := re.Sub[0]; sub.Op > OpCapture || sub.Op == OpLiteral && len(sub.Rune) > 1 {
simplify.go#L28: nre.Rune = nil
regexp
regexp.go#L280: for _, r := range re.Rune {