class Prism::StatementsNode

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

# sig/prism/node.rbs

class Prism::StatementsNode < Prism::Node
  def self.type: () -> Symbol
  
  type Prism__StatementsNode_accept_return_value = Array[Prism::ModuleNode] | Array[Prism::ClassNode] | Array[Prism::LocalVariableWriteNode] | Array[Prism::IntegerNode] | Array[Prism::CallNode] | Array[Prism::LocalVariableReadNode]
  
  def accept: (Analyzer::Visitor visitor) -> Prism__StatementsNode_accept_return_value
  
  type Prism__StatementsNode_compact_child_nodes_return_value = Array[Prism::ModuleNode] | Array[Prism::CallNode] | Array[Prism::ClassNode] | Array[Prism::IfNode] | Array[Prism::ConstantWriteNode] | Array[Prism::InterpolatedStringNode] | Array[Prism::DefNode] | Array[Prism::LocalVariableWriteNode] | Array[Prism::LocalVariableReadNode]
  
  def compact_child_nodes: () -> Prism__StatementsNode_compact_child_nodes_return_value
  
  type Prism__StatementsNode_initialize_body = Array[Prism::CallNode] | Array[Prism::ClassNode] | Array[Prism::LocalVariableWriteNode] | Array[Prism::DefNode] | Array[Prism::IfNode] | Array[Prism::LocalVariableReadNode] | Array[Prism::InstanceVariableOrWriteNode] | Array[Prism::ReturnNode] | Array[Prism::UnlessNode]
  
  def initialize: (Prism__StatementsNode_initialize_body body, Prism::Location location) -> void
  def type: () -> Symbol
end

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

def self.type

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

def self.type: () -> Symbol

This signature was generated using 3 samples from 1 application.

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

def accept(visitor)

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

type Prism__StatementsNode_accept_return_value = Array[Prism::ModuleNode] | Array[Prism::ClassNode] | Array[Prism::LocalVariableWriteNode] | Array[Prism::IntegerNode] | Array[Prism::CallNode] | Array[Prism::LocalVariableReadNode]

def accept: (Analyzer::Visitor visitor) -> ( | Prism::CallNode | Prism::CallNode | Prism::CallNode)

This signature was generated using 12 samples from 1 application.

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]
end

def compact_child_nodes

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

type Prism__StatementsNode_compact_child_nodes_return_value = Array[Prism::ModuleNode] | Array[Prism::CallNode] | Array[Prism::ClassNode] | Array[Prism::IfNode] | Array[Prism::ConstantWriteNode] | Array[Prism::InterpolatedStringNode] | Array[Prism::DefNode] | Array[Prism::LocalVariableWriteNode] | Array[Prism::LocalVariableReadNode]
type Prism__StatementsNode_compact_child_nodes_return_value =  | Prism::CallNode | Prism::CallNode | Prism::IfNode | Prism::ConstantWriteNode | Prism::ClassNode | Prism::CallNode | Prism::CallNode | Prism::SingletonClassNode | Prism::IfNode | Prism::CallNode | Prism::InstanceVariableReadNode | Prism::ModuleNode | Prism::LocalVariableWriteNode | Prism::CallNode | Prism::CallNode | Prism::IfNode | Prism::LocalVariableReadNode | Prism::DefNode | Prism::CallNode | Prism::DefNode

def compact_child_nodes: () -> Prism__StatementsNode_compact_child_nodes_return_value

This signature was generated using 23 samples from 1 application.

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

def copy(**params)

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

def deconstruct_keys(keys)

def deconstruct_keys: (Array[Symbol] keys) -> { body: Array[Node], location: Location } 
def deconstruct_keys(keys)
  { body: body, location: location }
end

def initialize(body, location)

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

type Prism__StatementsNode_initialize_body = Array[Prism::CallNode] | Array[Prism::ClassNode] | Array[Prism::LocalVariableWriteNode] | Array[Prism::DefNode] | Array[Prism::IfNode] | Array[Prism::LocalVariableReadNode] | Array[Prism::InstanceVariableOrWriteNode] | Array[Prism::ReturnNode] | Array[Prism::UnlessNode]
type Prism__StatementsNode_initialize_body =  | Prism::IfNode | Prism::DefNode | Prism::CallNode | Prism::DefNode | Prism::DefNode | Prism::DefNode | Prism::CallNode | Prism::UnlessNode | Prism::CallNode | Prism::UnlessNode | Prism::ModuleNode | Prism::IfNode | Prism::CallNode | Prism::IfNode | Prism::LocalVariableWriteNode | Prism::UntilNode | Prism::LocalVariableWriteNode | Prism::CallNode

def initialize: (Prism__StatementsNode_initialize_body body, Prism::Location location) -> void

This signature was generated using 22 samples from 1 application.

def initialize: (Array[Node] body, Location location) -> void 
def initialize(body, location)
  @newline = false
  @body = body
  @location = location
end

def inspect(inspector = NodeInspector.new)

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

def type

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

def type: () -> Symbol

This signature was generated using 3 samples from 1 application.

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