const go/token.LBRACK
31 uses
go/token (current package)
token.go#L83: LBRACK // [
token.go#L192: LBRACK: "[",
go/parser
parser.go#L558: if p.tok == token.LBRACK {
parser.go#L620: lbrack := p.expect(token.LBRACK)
parser.go#L689: if len(names) == 1 && p.tok == token.LBRACK {
parser.go#L835: case token.LBRACK:
parser.go#L864: case token.MUL, token.ARROW, token.FUNC, token.LBRACK, token.CHAN, token.MAP, token.STRUCT, token.INTERFACE, token.LPAREN:
parser.go#L1084: lbrack := p.expect(token.LBRACK)
parser.go#L1130: if p.tok == token.LBRACK {
parser.go#L1153: case p.tok == token.LBRACK:
parser.go#L1211: if p.tok == token.LBRACK {
parser.go#L1322: p.expect(token.LBRACK)
parser.go#L1360: opening := p.expect(token.LBRACK)
parser.go#L1393: if p.tok == token.LBRACK {
parser.go#L1397: case token.LBRACK:
parser.go#L1398: lbrack := p.expect(token.LBRACK)
parser.go#L1561: lbrack := p.expect(token.LBRACK)
parser.go#L1766: case token.LBRACK:
parser.go#L2466: token.LBRACK, token.STRUCT, token.MAP, token.CHAN, token.INTERFACE, // composite types
parser.go#L2624: if p.tok == token.LBRACK {
parser.go#L2646: if p.tok != token.LBRACK {
parser.go#L2808: 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#L882: tok = token.LBRACK