class Prism::StatementsNode

^^^^^^^^^^^^^
foo; bar; baz
Represents a set of statements contained within some scope.

def self.type

Return a symbol representation of this node type. See `Node::type`.
def self.type
  :statements_node
end

def ===(other)

comparing the value of locations. Locations are checked only for presence.
Implements case-equality for the node. This is effectively == but without
def ===(other)
  other.is_a?(StatementsNode) &&
    (body.length == other.body.length) &&
    body.zip(other.body).all? { |left, right| left === right }
end

def accept(visitor)

def accept: (Visitor visitor) -> void
def accept(visitor)
  visitor.visit_statements_node(self)
end

def child_nodes

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

def comment_targets

def comment_targets: () -> Array[Node | Location]
def comment_targets
  [*body] #: Array[Prism::node | Location]
end

def compact_child_nodes

def compact_child_nodes: () -> Array[Node]
def compact_child_nodes
  [*body]
end

def copy(node_id: self.node_id, location: self.location, flags: self.flags, body: self.body)

def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?body: Array[Prism::node]) -> StatementsNode
def copy(node_id: self.node_id, location: self.location, flags: self.flags, body: self.body)
  StatementsNode.new(source, node_id, location, flags, body)
end

def deconstruct_keys(keys)

def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, body: Array[Prism::node] }
def deconstruct_keys(keys)
  { node_id: node_id, location: location, body: body }
end

def initialize(source, node_id, location, flags, body)

Initialize a new StatementsNode node.
def initialize(source, node_id, location, flags, body)
  @source = source
  @node_id = node_id
  @location = location
  @flags = flags
  @body = body
end

def inspect

def inspect -> String
def inspect
  InspectVisitor.compose(self)
end

def type

Return a symbol representation of this node type. See `Node#type`.
def type
  :statements_node
end