const go/token.MUL
26 uses
go/token (current package)
token.go#L40: MUL // *
token.go#L149: MUL: "*",
token.go#L276: case MUL, QUO, REM, SHL, SHR, AND, AND_NOT:
go/constant
value.go#L1134: case token.MUL:
value.go#L1167: case token.MUL:
value.go#L1197: case token.MUL:
value.go#L1215: case token.MUL:
value.go#L1238: case token.MUL:
value.go#L1276: func mul(x, y Value) Value { return BinaryOp(x, token.MUL, y) }
go/parser
parser.go#L685: case token.MUL:
parser.go#L706: if p.tok == token.MUL {
parser.go#L747: for p.tok == token.IDENT || p.tok == token.MUL || p.tok == token.LPAREN {
parser.go#L770: star := p.expect(token.MUL)
parser.go#L817: case token.IDENT, token.MUL, token.ARROW, token.FUNC, token.CHAN, token.MAP, token.STRUCT, token.INTERFACE, token.LPAREN:
parser.go#L850: case token.MUL, token.ARROW, token.FUNC, token.LBRACK, token.CHAN, token.MAP, token.STRUCT, token.INTERFACE, token.LPAREN:
parser.go#L1372: case token.MUL:
parser.go#L1832: case token.MUL:
parser.go#L2437: token.ADD, token.SUB, token.MUL, token.AND, token.XOR, token.ARROW, token.NOT: // unary operators
parser.go#L2687: case token.MUL:
go/printer
nodes.go#L841: p.print(token.MUL)
nodes.go#L846: p.print(token.MUL)
go/scanner
scanner.go#L892: tok = s.switch2(token.MUL, token.MUL_ASSIGN)
go/types
expr.go#L124: token.MUL: "multiplication",
expr.go#L737: token.MUL: allNumeric,
expr.go#L817: re2, im2 := constant.BinaryOp(re, token.MUL, re), constant.BinaryOp(im, token.MUL, im)