class Prism::StatementsNode

def accept: (visitor: Visitor) -> void

def accept(visitor)
  visitor.visit_statements_node(self)
end

def child_nodes: () -> Array[nil | Node]

def child_nodes
  [*body]
end

def comment_targets: () -> Array[Node | Location]

def comment_targets
  [*body]
end

def compact_child_nodes: () -> Array[Node]

def compact_child_nodes
  [*body]
end

def copy: (**params) -> StatementsNode

def copy(**params)
  StatementsNode.new(
    params.fetch(:body) { body },
    params.fetch(:location) { location },
  )
end

def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location]

def deconstruct_keys(keys)
  { body: body, location: location }
end

def initialize: (body: Array[Node], location: Location) -> void

def initialize(body, location)
  @body = body
  @location = location
end

def inspect(inspector = NodeInspector.new)
  inspector << inspector.header(self)
  inspector << "└── body: #{inspector.list("#{inspector.prefix}    ", body)}"
  inspector.to_str
end

def type: () -> Symbol

keys will use a jump table.
you can take advantage of the fact that case statements with all symbol
it uses a single integer comparison, but also because if you're on CRuby
can use for comparison. This is faster than the other approaches because
Instead, you can call #type, which will return to you a symbol that you

method calls, and/or array allocations.
these approaches are relatively slow because of the constant lookups,
case statement and doing `case node; when cls1; when cls2; end`. Both of
calling `[cls1, cls2].include?(node.class)` or putting the node into a
classes to see what kind of behavior to perform. Usually this is done by
Sometimes you want to check an instance of a node against a list of

def type
  :statements_node
end