class Prism::RationalNode

Represents a rational number literal.

1.0r
^^^^

Attributes

denominator[R]

The denominator of the rational number.

1.5r # denominator 2

flags[R]

protected attr_reader flags: Integer

numerator[R]

The numerator of the rational number.

1.5r # numerator 3

Public Class Methods

new(source, flags, numerator, denominator, location) click to toggle source

def initialize: (Integer flags, Integer numerator, Integer denominator, Location location) -> void

# File lib/prism/node.rb, line 15525
def initialize(source, flags, numerator, denominator, location)
  @source = source
  @location = location
  @flags = flags
  @numerator = numerator
  @denominator = denominator
end

type() click to toggle source

Similar to type, this method returns a symbol that you can use for splitting on the type of the node without having to do a long === chain. Note that like type, it will still be slower than using == for a single class, but should be faster in a case statement or an array comparison.

def self.type: () -> Symbol

# File lib/prism/node.rb, line 15629
def self.type
  :rational_node
end

Public Instance Methods

===(other) click to toggle source

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

# File lib/prism/node.rb, line 15635
def ===(other)
  other.is_a?(RationalNode) &&
    (flags === other.flags) &&
    (numerator === other.numerator) &&
    (denominator === other.denominator)
end

accept(visitor) click to toggle source

def accept: (Visitor visitor) -> void

# File lib/prism/node.rb, line 15534
def accept(visitor)
  visitor.visit_rational_node(self)
end

binary?() click to toggle source

def binary?: () -> bool

# File lib/prism/node.rb, line 15581
def binary?
  flags.anybits?(IntegerBaseFlags::BINARY)
end

child_nodes() click to toggle source

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

# File lib/prism/node.rb, line 15539
def child_nodes
  []
end

Also aliased as: deconstruct

comment_targets() click to toggle source

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

# File lib/prism/node.rb, line 15549
def comment_targets
  [] #: Array[Prism::node | Location]
end

compact_child_nodes() click to toggle source

def compact_child_nodes: () -> Array

# File lib/prism/node.rb, line 15544
def compact_child_nodes
  []
end

copy(flags: self.flags, numerator: self.numerator, denominator: self.denominator, location: self.location) click to toggle source

def copy: (?flags: Integer, ?numerator: Integer, ?denominator: Integer, ?location: Location) -> RationalNode

# File lib/prism/node.rb, line 15554
def copy(flags: self.flags, numerator: self.numerator, denominator: self.denominator, location: self.location)
  RationalNode.new(source, flags, numerator, denominator, location)
end

decimal?() click to toggle source

def decimal?: () -> bool

# File lib/prism/node.rb, line 15586
def decimal?
  flags.anybits?(IntegerBaseFlags::DECIMAL)
end

deconstruct()

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

Alias for: child_nodes

deconstruct_keys(keys) click to toggle source

def deconstruct_keys: (Array keys) -> { flags: Integer, numerator: Integer, denominator: Integer, location: Location }

# File lib/prism/node.rb, line 15562
def deconstruct_keys(keys)
  { flags: flags, numerator: numerator, denominator: denominator, location: location }
end

hexadecimal?() click to toggle source

def hexadecimal?: () -> bool

# File lib/prism/node.rb, line 15596
def hexadecimal?
  flags.anybits?(IntegerBaseFlags::HEXADECIMAL)
end

inspect() click to toggle source

def inspect -> String

# File lib/prism/node.rb, line 15601
def inspect
  InspectVisitor.compose(self)
end

numeric() click to toggle source

Returns the value of the node as an IntegerNode or a FloatNode. This method is deprecated in favor of value or numerator/#denominator.

# File lib/prism/node_ext.rb, line 111
def numeric
  deprecated("value", "numerator", "denominator")

  if denominator == 1
    IntegerNode.new(source, flags, numerator, location.chop)
  else
    FloatNode.new(source, numerator.to_f / denominator, location.chop)
  end
end

octal?() click to toggle source

def octal?: () -> bool

# File lib/prism/node.rb, line 15591
def octal?
  flags.anybits?(IntegerBaseFlags::OCTAL)
end

type() click to toggle source

Sometimes you want to check an instance of a node against a list of classes to see what kind of behavior to perform. Usually this is done by calling ‘[cls1, cls2].include?(node.class)` or putting the node into a case statement and doing `case node; when cls1; when cls2; end`. Both of these approaches are relatively slow because of the constant lookups, method calls, and/or array allocations.

Instead, you can call type, which will return to you a symbol that you can use for comparison. This is faster than the other approaches because it uses a single integer comparison, but also because if you’re on CRuby you can take advantage of the fact that case statements with all symbol keys will use a jump table.

def type: () -> Symbol

# File lib/prism/node.rb, line 15619
def type
  :rational_node
end

value() click to toggle source

Returns the value of the node as a Ruby Rational.

# File lib/prism/node_ext.rb, line 105
def value
  Rational(numerator, denominator)
end