class Prism::ProgramNode
The top level node of any parse tree.
def self.type
def self.type :program_node end
def ===(other)
Implements case-equality for the node. This is effectively == but without
def ===(other) other.is_a?(ProgramNode) && (locals.length == other.locals.length) && locals.zip(other.locals).all? { |left, right| left === right } && (statements === other.statements) end
def accept(visitor)
def accept(visitor) visitor.visit_program_node(self) end
def child_nodes
def child_nodes [statements] end
def comment_targets
def comment_targets [statements] #: Array[Prism::node | Location] end
def compact_child_nodes
def compact_child_nodes [statements] end
def copy(node_id: self.node_id, location: self.location, flags: self.flags, locals: self.locals, statements: self.statements)
def copy(node_id: self.node_id, location: self.location, flags: self.flags, locals: self.locals, statements: self.statements) ProgramNode.new(source, node_id, location, flags, locals, statements) end
def deconstruct_keys(keys)
def deconstruct_keys(keys) { node_id: node_id, location: location, locals: locals, statements: statements } end
def initialize(source, node_id, location, flags, locals, statements)
def initialize(source, node_id, location, flags, locals, statements) @source = source @node_id = node_id @location = location @flags = flags @locals = locals @statements = statements end
def inspect
def inspect InspectVisitor.compose(self) end
def type
def type :program_node end