class Prism::FloatNode

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

comparing the value of locations. Locations are checked only for presence.
Implements case-equality for the node. This is effectively == but without

def ===(other)
  other.is_a?(FloatNode) &&
    (value === other.value)
end

def accept: (Visitor visitor) -> void

def accept(visitor)
  visitor.visit_float_node(self)
end

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

def child_nodes
  []
end

def comment_targets: () -> Array[Node | Location]

def comment_targets
  [] #: Array[Prism::node | Location]
end

def compact_child_nodes: () -> Array[Node]

def compact_child_nodes
  []
end

def copy: (?value: Float, ?location: Location) -> FloatNode

def copy(value: self.value, location: self.location)
  FloatNode.new(source, value, location)
end

def deconstruct_keys: (Array[Symbol] keys) -> { value: Float, location: Location }

def deconstruct_keys(keys)
  { value: value, location: location }
end

def initialize: (Float value, Location location) -> void

def initialize(source, value, location)
  @source = source
  @newline = false
  @location = location
  @value = value
end

def inspect -> String

def inspect
  InspectVisitor.compose(self)
end

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