class Prism::ProgramNode

Experimental RBS support (using type sampling data from the type_fusion project). 

# sig/prism/node.rbs

class Prism::ProgramNode < Prism::Node
  def compact_child_nodes: () -> Array[Prism::StatementsNode]
  def initialize: (Array[] locals, Prism::StatementsNode statements, Prism::Location location) -> void
end

The top level node of any parse tree.

def self.type

def self.type: () -> Symbol

class, but should be faster in a case statement or an array comparison.
Note that like #type, it will still be slower than using == for a single
splitting on the type of the node without having to do a long === chain.
Similar to #type, this method returns a symbol that you can use for 
def self.type
  :program_node
end

def accept(visitor)

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

def child_nodes

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

def comment_targets

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

def compact_child_nodes

Experimental RBS support (using type sampling data from the type_fusion project). 

def compact_child_nodes: () ->

This signature was generated using 3 samples from 1 application.

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

def copy(**params)

def copy: (**params) -> ProgramNode 
def copy(**params)
  ProgramNode.new(
    params.fetch(:locals) { locals },
    params.fetch(:statements) { statements },
    params.fetch(:location) { location },
  )
end

def deconstruct_keys(keys)

def deconstruct_keys: (Array[Symbol] keys) -> { locals: Array[Symbol], statements: StatementsNode, location: Location } 
def deconstruct_keys(keys)
  { locals: locals, statements: statements, location: location }
end

def initialize(locals, statements, location)

Experimental RBS support (using type sampling data from the type_fusion project). 

def initialize: ( locals, Prism::StatementsNode statements, Prism::Location location) -> void

This signature was generated using 3 samples from 1 application.

def initialize: (Array[Symbol] locals, StatementsNode statements, Location location) -> void 
def initialize(locals, statements, location)
  @newline = false
  @locals = locals
  @statements = statements
  @location = location
end

def inspect(inspector = NodeInspector.new)

def inspect(NodeInspector inspector) -> String 
def inspect(inspector = NodeInspector.new)
  inspector << inspector.header(self)
  inspector << "├── locals: #{locals.inspect}\n"
  inspector << "└── statements:\n"
  inspector << inspector.child_node(statements, "    ")
  inspector.to_str
end

def type

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
  :program_node
end