const go/token.MUL
24 uses
go/token (current package)
token.go#L41: MUL // *
token.go#L150: MUL: "*",
token.go#L280: case MUL, QUO, REM, SHL, SHR, AND, AND_NOT:
go/constant
value.go#L1127: case token.MUL:
value.go#L1160: case token.MUL:
value.go#L1190: case token.MUL:
value.go#L1208: case token.MUL:
value.go#L1231: case token.MUL:
value.go#L1269: func mul(x, y Value) Value { return BinaryOp(x, token.MUL, y) }
go/parser
parser.go#L679: for p.tok == token.IDENT || p.tok == token.MUL || p.tok == token.LPAREN {
parser.go#L702: star := p.expect(token.MUL)
parser.go#L749: case token.IDENT, token.MUL, token.ARROW, token.FUNC, token.CHAN, token.MAP, token.STRUCT, token.INTERFACE, token.LPAREN:
parser.go#L782: case token.MUL, token.ARROW, token.FUNC, token.LBRACK, token.CHAN, token.MAP, token.STRUCT, token.INTERFACE, token.LPAREN:
parser.go#L1267: case token.MUL:
parser.go#L1784: case token.MUL:
parser.go#L2440: token.ADD, token.SUB, token.MUL, token.AND, token.XOR, token.ARROW, token.NOT: // unary operators
parser.go#L2654: if t.Op == token.MUL && (isTypeLit(t.Y) || p.tok == token.COMMA) {
go/printer
nodes.go#L820: p.print(token.MUL)
nodes.go#L825: p.print(token.MUL)
go/scanner
scanner.go#L923: tok = s.switch2(token.MUL, token.MUL_ASSIGN)
go/types
expr.go#L143: token.MUL: "multiplication",
expr.go#L1046: token.MUL: allNumeric,
expr.go#L1152: re2, im2 := constant.BinaryOp(re, token.MUL, re), constant.BinaryOp(im, token.MUL, im)