Class: Prism::RationalNode

Inherits:
PrismNode
  • Object
show all
Defined in:
lib/prism/node.rb,
lib/prism/node_ext.rb,
ext/prism/api_node.c

Overview

Represents a rational number literal.

1.0r
^^^^

Instance Attribute Summary collapse

Class Method Summary collapse

Instance Method Summary collapse

Constructor Details

#initialize(source, node_id, location, flags, numerator, denominator) ⇒ RationalNode

Initialize a new RationalNode node.



13617
13618
13619
13620
13621
13622
13623
13624
 
# File 'lib/prism/node.rb', line 13617

def initialize(source, node_id, location, flags, numerator, denominator)
  @source = source
  @node_id = node_id
  @location = location
  @flags = flags
  @numerator = numerator
  @denominator = denominator
end

Instance Attribute Details

#denominator ⇒ Object (readonly)

The denominator of the rational number.

1.5r # denominator 2



13687
13688
13689
 
# File 'lib/prism/node.rb', line 13687

def denominator
  @denominator
end

#numerator ⇒ Object (readonly)

The numerator of the rational number.

1.5r # numerator 3



13682
13683
13684
 
# File 'lib/prism/node.rb', line 13682

def numerator
  @numerator
end

Class Method Details

.type ⇒ Object

Return a symbol representation of this node type. See ‘Node::type`.



13700
13701
13702
 
# File 'lib/prism/node.rb', line 13700

def self.type
  :rational_node
end

Instance Method Details

#===(other) ⇒ Object

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



13706
13707
13708
13709
13710
13711
 
# File 'lib/prism/node.rb', line 13706

def ===(other)
  other.is_a?(RationalNode) &&
    (flags === other.flags) &&
    (numerator === other.numerator) &&
    (denominator === other.denominator)
end

#accept(visitor) ⇒ Object

def accept: (Visitor visitor) -> void



13627
13628
13629
 
# File 'lib/prism/node.rb', line 13627

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

#binary? ⇒ Boolean

def binary?: () -> bool

Returns:

  • (Boolean) 


13660
13661
13662
 
# File 'lib/prism/node.rb', line 13660

def binary?
  flags.anybits?(IntegerBaseFlags::BINARY)
end

#child_nodes ⇒ Object Also known as: deconstruct

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



13632
13633
13634
 
# File 'lib/prism/node.rb', line 13632

def child_nodes
  []
end

#comment_targets ⇒ Object

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



13642
13643
13644
 
# File 'lib/prism/node.rb', line 13642

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

#compact_child_nodes ⇒ Object

def compact_child_nodes: () -> Array



13637
13638
13639
 
# File 'lib/prism/node.rb', line 13637

def compact_child_nodes
  []
end

#copy(node_id: self.node_id, location: self.location, flags: self.flags, numerator: self.numerator, denominator: self.denominator) ⇒ Object

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



13647
13648
13649
 
# File 'lib/prism/node.rb', line 13647

def copy(node_id: self.node_id, location: self.location, flags: self.flags, numerator: self.numerator, denominator: self.denominator)
  RationalNode.new(source, node_id, location, flags, numerator, denominator)
end

#decimal? ⇒ Boolean

def decimal?: () -> bool

Returns:

  • (Boolean) 


13665
13666
13667
 
# File 'lib/prism/node.rb', line 13665

def decimal?
  flags.anybits?(IntegerBaseFlags::DECIMAL)
end

#deconstruct_keys(keys) ⇒ Object

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



13655
13656
13657
 
# File 'lib/prism/node.rb', line 13655

def deconstruct_keys(keys)
  { node_id: node_id, location: location, numerator: numerator, denominator: denominator }
end

#hexadecimal? ⇒ Boolean

def hexadecimal?: () -> bool

Returns:

  • (Boolean) 


13675
13676
13677
 
# File 'lib/prism/node.rb', line 13675

def hexadecimal?
  flags.anybits?(IntegerBaseFlags::HEXADECIMAL)
end

#inspect ⇒ Object

def inspect -> String



13690
13691
13692
 
# File 'lib/prism/node.rb', line 13690

def inspect
  InspectVisitor.compose(self)
end

#numeric ⇒ Object

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



120
121
122
123
124
125
126
127
128
 
# File 'lib/prism/node_ext.rb', line 120

def numeric
  deprecated("value", "numerator", "denominator")

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

#octal? ⇒ Boolean

def octal?: () -> bool

Returns:

  • (Boolean) 


13670
13671
13672
 
# File 'lib/prism/node.rb', line 13670

def octal?
  flags.anybits?(IntegerBaseFlags::OCTAL)
end

#type ⇒ Object

Return a symbol representation of this node type. See ‘Node#type`.



13695
13696
13697
 
# File 'lib/prism/node.rb', line 13695

def type
  :rational_node
end

#value ⇒ Object

Returns the value of the node as a Ruby Rational.



114
115
116
 
# File 'lib/prism/node_ext.rb', line 114

def value
  Rational(numerator, denominator)
end