class Prism::WhileNode

^^^^^^^^^^^^^^^^^^^^
while foo do bar end
^^^^^^^^^^^^^
bar while foo
Represents the use of the ‘while` 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
  :while_node
end

def accept(visitor)

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

def begin_modifier?

def begin_modifier?: () -> bool 
def begin_modifier?
  flags.anybits?(LoopFlags::BEGIN_MODIFIER)
end

def child_nodes

def child_nodes: () -> Array[nil | Node] 
def child_nodes
  [predicate, 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
  [keyword_loc, *closing_loc, predicate, *statements]
end

def compact_child_nodes

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

def copy(**params)

def copy: (**params) -> WhileNode 
def copy(**params)
  WhileNode.new(
    params.fetch(:flags) { flags },
    params.fetch(:keyword_loc) { keyword_loc },
    params.fetch(:closing_loc) { closing_loc },
    params.fetch(:predicate) { predicate },
    params.fetch(:statements) { statements },
    params.fetch(:location) { location },
  )
end

def deconstruct_keys(keys)

def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, keyword_loc: Location, closing_loc: Location?, predicate: Node, statements: StatementsNode?, location: Location } 
def deconstruct_keys(keys)
  { flags: flags, keyword_loc: keyword_loc, closing_loc: closing_loc, predicate: predicate, statements: statements, location: location }
end

def initialize(flags, keyword_loc, closing_loc, predicate, statements, location)

def initialize: (Integer flags, Location keyword_loc, Location? closing_loc, Node predicate, StatementsNode? statements, Location location) -> void 
def initialize(flags, keyword_loc, closing_loc, predicate, statements, location)
  @newline = false
  @flags = flags
  @keyword_loc = keyword_loc
  @closing_loc = closing_loc
  @predicate = predicate
  @statements = statements
  @location = location
end

def inspect(inspector = NodeInspector.new)

def inspect(NodeInspector inspector) -> String 
def inspect(inspector = NodeInspector.new)
  inspector << inspector.header(self)
  flags = [("begin_modifier" if begin_modifier?)].compact
  inspector << "├── flags: #{flags.empty? ? "∅" : flags.join(", ")}\n"
  inspector << "├── keyword_loc: #{inspector.location(keyword_loc)}\n"
  inspector << "├── closing_loc: #{inspector.location(closing_loc)}\n"
  inspector << "├── predicate:\n"
  inspector << inspector.child_node(predicate, "│   ")
  if (statements = self.statements).nil?
    inspector << "└── statements: ∅\n"
  else
    inspector << "└── statements:\n"
    inspector << statements.inspect(inspector.child_inspector("    ")).delete_prefix(inspector.prefix)
  end
  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 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
  :while_node
end