const go/token.LBRACK
31 uses
go/token (current package)
token.go#L83: LBRACK // [
token.go#L192: LBRACK: "[",
go/parser
parser.go#L544: if p.tok == token.LBRACK {
parser.go#L606: lbrack := p.expect(token.LBRACK)
parser.go#L675: if len(names) == 1 && p.tok == token.LBRACK {
parser.go#L821: case token.LBRACK:
parser.go#L850: case token.MUL, token.ARROW, token.FUNC, token.LBRACK, token.CHAN, token.MAP, token.STRUCT, token.INTERFACE, token.LPAREN:
parser.go#L1070: lbrack := p.expect(token.LBRACK)
parser.go#L1116: if p.tok == token.LBRACK {
parser.go#L1139: case p.tok == token.LBRACK:
parser.go#L1197: if p.tok == token.LBRACK {
parser.go#L1308: p.expect(token.LBRACK)
parser.go#L1346: opening := p.expect(token.LBRACK)
parser.go#L1379: if p.tok == token.LBRACK {
parser.go#L1383: case token.LBRACK:
parser.go#L1384: lbrack := p.expect(token.LBRACK)
parser.go#L1551: lbrack := p.expect(token.LBRACK)
parser.go#L1756: case token.LBRACK:
parser.go#L2456: token.LBRACK, token.STRUCT, token.MAP, token.CHAN, token.INTERFACE, // composite types
parser.go#L2616: if p.tok == token.LBRACK {
parser.go#L2638: if p.tok != token.LBRACK {
parser.go#L2800: if p.tok == token.LBRACK {
go/printer
nodes.go#L331: openTok, closeTok = token.LBRACK, token.RBRACK
nodes.go#L913: p.print(token.LBRACK)
nodes.go#L923: p.print(token.LBRACK)
nodes.go#L932: p.print(token.LBRACK)
nodes.go#L1043: p.print(token.LBRACK)
nodes.go#L1063: p.print(token.MAP, token.LBRACK)
printer.go#L793: (tok != token.RBRACK || p.prevOpen == token.LBRACK) {
printer.go#L912: case token.LPAREN, token.LBRACK:
go/scanner
scanner.go#L895: tok = token.LBRACK