class Prism::BreakNode

^^^^^^^^^
break foo
Represents the use of the ‘break` 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
  :break_node
end

def accept(visitor)

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

def child_nodes

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

def comment_targets

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

def compact_child_nodes

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

def copy(**params)

def copy: (**params) -> BreakNode
def copy(**params)
  BreakNode.new(
    params.fetch(:arguments) { arguments },
    params.fetch(:keyword_loc) { keyword_loc },
    params.fetch(:location) { location },
  )
end

def deconstruct_keys(keys)

def deconstruct_keys: (Array[Symbol] keys) -> { arguments: ArgumentsNode?, keyword_loc: Location, location: Location }
def deconstruct_keys(keys)
  { arguments: arguments, keyword_loc: keyword_loc, location: location }
end

def initialize(arguments, keyword_loc, location)

def initialize: (ArgumentsNode? arguments, Location keyword_loc, Location location) -> void
def initialize(arguments, keyword_loc, location)
  @newline = false
  @arguments = arguments
  @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)
  if (arguments = self.arguments).nil?
    inspector << "├── arguments: ∅\n"
  else
    inspector << "├── arguments:\n"
    inspector << arguments.inspect(inspector.child_inspector("│   ")).delete_prefix(inspector.prefix)
  end
  inspector << "└── keyword_loc: #{inspector.location(keyword_loc)}\n"
  inspector.to_str
end

def keyword

def keyword: () -> String
def keyword
  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
  :break_node
end