class Prism::ClassNode

^^^^^^^^^^^^^
class Foo end
Represents a class declaration involving the ‘class` 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
  :class_node
end

def accept(visitor)

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

def child_nodes

def child_nodes: () -> Array[nil | Node]
def child_nodes
  [constant_path, superclass, body]
end

def class_keyword

def class_keyword: () -> String
def class_keyword
  class_keyword_loc.slice
end

def comment_targets

def comment_targets: () -> Array[Node | Location]
def comment_targets
  [class_keyword_loc, constant_path, *inheritance_operator_loc, *superclass, *body, end_keyword_loc]
end

def compact_child_nodes

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

def copy(**params)

def copy: (**params) -> ClassNode
def copy(**params)
  ClassNode.new(
    params.fetch(:locals) { locals },
    params.fetch(:class_keyword_loc) { class_keyword_loc },
    params.fetch(:constant_path) { constant_path },
    params.fetch(:inheritance_operator_loc) { inheritance_operator_loc },
    params.fetch(:superclass) { superclass },
    params.fetch(:body) { body },
    params.fetch(:end_keyword_loc) { end_keyword_loc },
    params.fetch(:name) { name },
    params.fetch(:location) { location },
  )
end

def deconstruct_keys(keys)

def deconstruct_keys: (Array[Symbol] keys) -> { locals: Array[Symbol], class_keyword_loc: Location, constant_path: Node, inheritance_operator_loc: Location?, superclass: Node?, body: Node?, end_keyword_loc: Location, name: Symbol, location: Location }
def deconstruct_keys(keys)
  { locals: locals, class_keyword_loc: class_keyword_loc, constant_path: constant_path, inheritance_operator_loc: inheritance_operator_loc, superclass: superclass, body: body, end_keyword_loc: end_keyword_loc, name: name, location: location }
end

def end_keyword

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

def inheritance_operator

def inheritance_operator: () -> String?
def inheritance_operator
  inheritance_operator_loc&.slice
end

def initialize(locals, class_keyword_loc, constant_path, inheritance_operator_loc, superclass, body, end_keyword_loc, name, location)

def initialize: (Array[Symbol] locals, Location class_keyword_loc, Node constant_path, Location? inheritance_operator_loc, Node? superclass, Node? body, Location end_keyword_loc, Symbol name, Location location) -> void
def initialize(locals, class_keyword_loc, constant_path, inheritance_operator_loc, superclass, body, end_keyword_loc, name, location)
  @newline = false
  @locals = locals
  @class_keyword_loc = class_keyword_loc
  @constant_path = constant_path
  @inheritance_operator_loc = inheritance_operator_loc
  @superclass = superclass
  @body = body
  @end_keyword_loc = end_keyword_loc
  @name = name
  @location = location
end

def inspect(inspector = NodeInspector.new)

def inspect(NodeInspector inspector) -> String
def inspect(inspector = NodeInspector.new)
  inspector << inspector.header(self)
  inspector << "├── locals: #{locals.inspect}\n"
  inspector << "├── class_keyword_loc: #{inspector.location(class_keyword_loc)}\n"
  inspector << "├── constant_path:\n"
  inspector << inspector.child_node(constant_path, "│   ")
  inspector << "├── inheritance_operator_loc: #{inspector.location(inheritance_operator_loc)}\n"
  if (superclass = self.superclass).nil?
    inspector << "├── superclass: ∅\n"
  else
    inspector << "├── superclass:\n"
    inspector << superclass.inspect(inspector.child_inspector("│   ")).delete_prefix(inspector.prefix)
  end
  if (body = self.body).nil?
    inspector << "├── body: ∅\n"
  else
    inspector << "├── body:\n"
    inspector << body.inspect(inspector.child_inspector("│   ")).delete_prefix(inspector.prefix)
  end
  inspector << "├── end_keyword_loc: #{inspector.location(end_keyword_loc)}\n"
  inspector << "└── name: #{name.inspect}\n"
  inspector.to_str
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
  :class_node
end