class Prism::EmbeddedStatementsNode

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

# sig/prism/node.rbs

class Prism::EmbeddedStatementsNode < Prism::Node
  def accept: (Analyzer::Visitor visitor) -> Array[Prism::StatementsNode]
  def compact_child_nodes: () -> Array[Prism::StatementsNode]
  def initialize: (Prism::Location opening_loc, Prism::StatementsNode statements, Prism::Location closing_loc, Prism::Location location) -> void
end

^^^^^^
“foo #{bar}”
Represents an interpolated set of statements.

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

def accept(visitor)

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

def accept: (Analyzer::Visitor visitor) ->

This signature was generated using 3 samples from 1 application.

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

def child_nodes

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

def closing

def closing: () -> String 
def closing
  closing_loc.slice
end

def comment_targets

def comment_targets: () -> Array[Node | Location] 
def comment_targets
  [opening_loc, *statements, closing_loc]
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 1 sample from 1 application.

def compact_child_nodes: () -> Array[Node] 
def compact_child_nodes
  compact = []
  compact << statements if statements
  compact
end

def copy(**params)

def copy: (**params) -> EmbeddedStatementsNode 
def copy(**params)
  EmbeddedStatementsNode.new(
    params.fetch(:opening_loc) { opening_loc },
    params.fetch(:statements) { statements },
    params.fetch(:closing_loc) { closing_loc },
    params.fetch(:location) { location },
  )
end

def deconstruct_keys(keys)

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

def initialize(opening_loc, statements, closing_loc, location)

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

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

This signature was generated using 1 sample from 1 application.

def initialize: (Location opening_loc, StatementsNode? statements, Location closing_loc, Location location) -> void 
def initialize(opening_loc, statements, closing_loc, location)
  @newline = false
  @opening_loc = opening_loc
  @statements = statements
  @closing_loc = closing_loc
  @location = location
end

def inspect(inspector = NodeInspector.new)

def inspect(NodeInspector inspector) -> String 
def inspect(inspector = NodeInspector.new)
  inspector << inspector.header(self)
  inspector << "├── opening_loc: #{inspector.location(opening_loc)}\n"
  if (statements = self.statements).nil?
    inspector << "├── statements: ∅\n"
  else
    inspector << "├── statements:\n"
    inspector << statements.inspect(inspector.child_inspector("│   ")).delete_prefix(inspector.prefix)
  end
  inspector << "└── closing_loc: #{inspector.location(closing_loc)}\n"
  inspector.to_str
end

def opening

def opening: () -> String 
def opening
  opening_loc.slice
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
  :embedded_statements_node
end