go/ast.CompositeLit.Elts (field)
25 uses
go/ast (current package)
ast.go#L330: Elts []Expr // list of composite elements; or nil
filter.go#L110: n := len(lit.Elts)
filter.go#L111: lit.Elts = filterExprList(lit.Elts, filter, export)
filter.go#L112: if len(lit.Elts) < n {
walk.go#L84: walkList(v, n.Elts)
go/doc
exports.go#L30: n := len(lit.Elts)
exports.go#L31: lit.Elts = filterExprList(lit.Elts, filter, export)
exports.go#L32: if len(lit.Elts) < n {
go/parser
parser.go#L1696: return &ast.CompositeLit{Type: typ, Lbrace: lbrace, Elts: elts, Rbrace: rbrace}
resolver.go#L286: for _, e := range n.Elts {
go/printer
nodes.go#L1019: p.exprList(x.Lbrace, x.Elts, 1, commaTerm, x.Rbrace, x.Incomplete)
nodes.go#L1026: if len(x.Elts) > 0 {
go/types
exprstring.go#L57: if len(x.Elts) > 0 {
literals.go#L158: if len(e.Elts) == 0 {
literals.go#L165: if _, ok := e.Elts[0].(*ast.KeyValueExpr); ok {
literals.go#L168: for _, e := range e.Elts {
literals.go#L205: for i, e := range e.Elts {
literals.go#L224: if len(e.Elts) < len(fields) {
literals.go#L239: n := check.indexedElts(e.Elts, utyp.elem, utyp.len)
literals.go#L267: check.indexedElts(e.Elts, utyp.elem, -1)
literals.go#L281: visited := make(map[any][]Type, len(e.Elts))
literals.go#L282: for _, e := range e.Elts {
literals.go#L320: for _, e := range e.Elts {