class Prism::UnlessNode

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

# sig/prism/node.rbs

class Prism::UnlessNode < Prism::Node
  def accept: (Analyzer::Visitor visitor) -> Array[Prism::CallNode]
  def initialize: (Prism::Location keyword_loc, Prism::LocalVariableWriteNode predicate, nil then_keyword_loc, Prism::StatementsNode statements, nil consequent, Prism::Location end_keyword_loc, Prism::Location location) -> void
end

^^^^^^^^^^^^^^^^^^^^^^^
unless foo then bar end
^^^^^^^^^^^^^^
bar unless foo
Represents the use of the ‘unless` keyword, either in the block form or the modifier form.

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

def accept(visitor)

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

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

This signature was generated using 2 samples from 1 application.

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

def child_nodes

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

def comment_targets

def comment_targets: () -> Array[Node | Location] 
def comment_targets
  [keyword_loc, predicate, *then_keyword_loc, *statements, *consequent, *end_keyword_loc]
end

def compact_child_nodes

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

def copy(**params)

def copy: (**params) -> UnlessNode 
def copy(**params)
  UnlessNode.new(
    params.fetch(:keyword_loc) { keyword_loc },
    params.fetch(:predicate) { predicate },
    params.fetch(:then_keyword_loc) { then_keyword_loc },
    params.fetch(:statements) { statements },
    params.fetch(:consequent) { consequent },
    params.fetch(:end_keyword_loc) { end_keyword_loc },
    params.fetch(:location) { location },
  )
end

def deconstruct_keys(keys)

def deconstruct_keys: (Array[Symbol] keys) -> { keyword_loc: Location, predicate: Node, then_keyword_loc: Location?, statements: StatementsNode?, consequent: ElseNode?, end_keyword_loc: Location?, location: Location } 
def deconstruct_keys(keys)
  { keyword_loc: keyword_loc, predicate: predicate, then_keyword_loc: then_keyword_loc, statements: statements, consequent: consequent, end_keyword_loc: end_keyword_loc, location: location }
end

def end_keyword

def end_keyword: () -> String? 
def end_keyword
  end_keyword_loc&.slice
end

def initialize(keyword_loc, predicate, then_keyword_loc, statements, consequent, end_keyword_loc, location)

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

def initialize: (Prism::Location keyword_loc, Prism::LocalVariableWriteNode predicate, nil then_keyword_loc, Prism::StatementsNode statements, nil consequent, Prism::Location end_keyword_loc, Prism::Location location) -> void

This signature was generated using 1 sample from 1 application.

def initialize: (Location keyword_loc, Node predicate, Location? then_keyword_loc, StatementsNode? statements, ElseNode? consequent, Location? end_keyword_loc, Location location) -> void 
def initialize(keyword_loc, predicate, then_keyword_loc, statements, consequent, end_keyword_loc, location)
  @newline = false
  @keyword_loc = keyword_loc
  @predicate = predicate
  @then_keyword_loc = then_keyword_loc
  @statements = statements
  @consequent = consequent
  @end_keyword_loc = end_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 << "├── keyword_loc: #{inspector.location(keyword_loc)}\n"
  inspector << "├── predicate:\n"
  inspector << inspector.child_node(predicate, "│   ")
  inspector << "├── then_keyword_loc: #{inspector.location(then_keyword_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
  if (consequent = self.consequent).nil?
    inspector << "├── consequent: ∅\n"
  else
    inspector << "├── consequent:\n"
    inspector << consequent.inspect(inspector.child_inspector("│   ")).delete_prefix(inspector.prefix)
  end
  inspector << "└── end_keyword_loc: #{inspector.location(end_keyword_loc)}\n"
  inspector.to_str
end

def keyword

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

def set_newline_flag(newline_marked) # :nodoc:

:nodoc: 
def set_newline_flag(newline_marked) # :nodoc:
  predicate.set_newline_flag(newline_marked)
end

def then_keyword

def then_keyword: () -> String? 
def then_keyword
  then_keyword_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
  :unless_node
end