class Prism::RationalNode

^^^^
1.0r
Represents a rational number literal.

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

def accept(visitor)

def accept: (visitor: Visitor) -> void

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

def child_nodes

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

def child_nodes
  [numeric]
end

def comment_targets

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

def comment_targets
  [numeric]
end

def compact_child_nodes

def compact_child_nodes: () -> Array[Node]

def compact_child_nodes
  [numeric]
end

def copy(**params)

def copy: (**params) -> RationalNode

def copy(**params)
  RationalNode.new(
    params.fetch(:numeric) { numeric },
    params.fetch(:location) { location },
  )
end

def deconstruct_keys(keys)

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

def initialize(numeric, location)

def initialize: (numeric: Node, location: Location) -> void

def initialize(numeric, location)
  @numeric = numeric
  @location = location
end

def inspect(inspector = NodeInspector.new)

def inspect(inspector: NodeInspector) -> String

def inspect(inspector = NodeInspector.new)
  inspector << inspector.header(self)
  inspector << "└── numeric:\n"
  inspector << inspector.child_node(numeric, "    ")
  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
  :rational_node
end

def value

Returns the value of the node as a Ruby Rational.

def value
  Rational(slice.chomp("r"))
end

Modules

Classes