class Prism::DefinedNode

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

# sig/prism/node.rbs

class Prism::DefinedNode < Prism::Node
  def accept: (Analyzer::Visitor visitor) -> Array[Prism::YieldNode]
end

^^^^^^^^^^^
defined?(a)
Represents the use of the ‘defined?` keyword.

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
  :defined_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 1 sample from 1 application.

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

def child_nodes

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

def comment_targets

def comment_targets: () -> Array[Node | Location] 
def comment_targets
  [*lparen_loc, value, *rparen_loc, keyword_loc]
end

def compact_child_nodes

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

def copy(**params)

def copy: (**params) -> DefinedNode 
def copy(**params)
  DefinedNode.new(
    params.fetch(:lparen_loc) { lparen_loc },
    params.fetch(:value) { value },
    params.fetch(:rparen_loc) { rparen_loc },
    params.fetch(:keyword_loc) { keyword_loc },
    params.fetch(:location) { location },
  )
end

def deconstruct_keys(keys)

def deconstruct_keys: (Array[Symbol] keys) -> { lparen_loc: Location?, value: Node, rparen_loc: Location?, keyword_loc: Location, location: Location } 
def deconstruct_keys(keys)
  { lparen_loc: lparen_loc, value: value, rparen_loc: rparen_loc, keyword_loc: keyword_loc, location: location }
end

def initialize(lparen_loc, value, rparen_loc, keyword_loc, location)

def initialize: (Location? lparen_loc, Node value, Location? rparen_loc, Location keyword_loc, Location location) -> void 
def initialize(lparen_loc, value, rparen_loc, keyword_loc, location)
  @newline = false
  @lparen_loc = lparen_loc
  @value = value
  @rparen_loc = rparen_loc
  @keyword_loc = keyword_loc
  @location = location
end

def inspect(inspector = NodeInspector.new)

def inspect(NodeInspector inspector) -> String 
def inspect(inspector = NodeInspector.new)
  inspector << inspector.header(self)
  inspector << "├── lparen_loc: #{inspector.location(lparen_loc)}\n"
  inspector << "├── value:\n"
  inspector << inspector.child_node(value, "│   ")
  inspector << "├── rparen_loc: #{inspector.location(rparen_loc)}\n"
  inspector << "└── keyword_loc: #{inspector.location(keyword_loc)}\n"
  inspector.to_str
end

def keyword

def keyword: () -> String 
def keyword
  keyword_loc.slice
end

def lparen

def lparen: () -> String? 
def lparen
  lparen_loc&.slice
end

def rparen

def rparen: () -> String? 
def rparen
  rparen_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
  :defined_node
end