123456789_123456789_123456789_123456789_123456789_

Class: Prism::RangeNode

Relationships & Source Files
Super Chains via Extension / Inclusion / Inheritance
Class Chain:
self, PrismNode
Instance Chain:
self, PrismNode
Inherits: PrismNode
Defined in: lib/prism/node.rb,
ext/prism/api_node.c

Overview

Represents the use of the .. or ... operators.

1..2
^^^^

c if a =~ /left/ ... b =~ /right/
     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^

Class Method Summary

Instance Attribute Summary

Instance Method Summary

Constructor Details

.new(source, node_id, location, flags, left, right, operator_loc) ⇒ RangeNode

Initialize a new RangeNode node.

[ GitHub ] 

  


# File 'lib/prism/node.rb', line 13224



def initialize(source, node_id, location, flags, left, right, operator_loc)
  @source = source
  @node_id = node_id
  @location = location
  @flags = flags
  @left = left
  @right = right
  @operator_loc = operator_loc
end


  







Class Method Details



  

    .type  
  



  

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

  



  [ GitHub ]


  

  


# File 'lib/prism/node.rb', line 13315



def self.type
  :range_node
end


  







Instance Attribute Details



  

    #exclude_end?  ⇒ Boolean  (readonly)
  



  

    
def exclude_end?: () -> bool

  





  


  [ GitHub ]


  

  


# File 'lib/prism/node.rb', line 13271



def exclude_end?
  flags.anybits?(RangeFlags::EXCLUDE_END)
end


  








  

    #left   (readonly)
  



  

    
The left-hand side of the range, if present. It can be either nil or anynon-void expression.


1...
^

hello...goodbye
^^^^^

  



  [ GitHub ]


  

  


# File 'lib/prism/node.rb', line 13282



attr_reader :left


  








  

    #right   (readonly)
  



  

    
The right-hand side of the range, if present. It can be either nil or anynon-void expression.


#..5
  ^

1...foo
    ^^^


If neither right-hand or left-hand side was included, this will be a MissingNode.

  



  [ GitHub ]


  

  


# File 'lib/prism/node.rb', line 13291



attr_reader :right


  







Instance Method Details



  

    #===(other)  
  



  

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

  



  [ GitHub ]


  

  


# File 'lib/prism/node.rb', line 13321



def ===(other)
  other.is_a?(RangeNode) &&
    (flags === other.flags) &&
    (left === other.left) &&
    (right === other.right) &&
    (operator_loc.nil? == other.operator_loc.nil?)
end


  








  

    #accept(visitor)  
  



  

    
def accept: (Visitor visitor) -> void

  



  [ GitHub ]


  

  


# File 'lib/prism/node.rb', line 13235



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


  








  

    #child_nodes  
    Also known as: #deconstruct
  



  

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

  



  [ GitHub ]


  

  


# File 'lib/prism/node.rb', line 13240



def child_nodes
  [left, right]
end


  








  

    #comment_targets  
  



  

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

  



  [ GitHub ]


  

  


# File 'lib/prism/node.rb', line 13253



def comment_targets
  [*left, *right, operator_loc] #: Array[Prism::node | Location]
end


  








  

    #compact_child_nodes  
  



  

    
def compact_child_nodes: () -> Array

  



  [ GitHub ]


  

  


# File 'lib/prism/node.rb', line 13245



def compact_child_nodes
  compact = [] #: Array[Prism::node]
  compact << left if left
  compact << right if right
  compact
end


  








  

    #copy(node_id: self.node_id, location: self.location, flags: self.flags, left: self.left, right: self.right, operator_loc: self.operator_loc)  
  



  

    
def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?left: Prism.node?, ?right: Prism.node?, ?operator_loc: Location) -> RangeNode

  



  [ GitHub ]


  

  


# File 'lib/prism/node.rb', line 13258



def copy(node_id: self.node_id, location: self.location, flags: self.flags, left: self.left, right: self.right, operator_loc: self.operator_loc)
  RangeNode.new(source, node_id, location, flags, left, right, operator_loc)
end


  








  

    #deconstruct  
  



  

    
Alias for #child_nodes.

  



  [ GitHub ]


  

  


# File 'lib/prism/node.rb', line 13263



alias deconstruct child_nodes


  








  

    #deconstruct_keys(keys)  
  



  

    
def deconstruct_keys: (Array keys) -> { node_id: Integer, location: Location, left: Prism.node?, right: Prism.node?, operator_loc: Location }

  



  [ GitHub ]


  

  


# File 'lib/prism/node.rb', line 13266



def deconstruct_keys(keys)
  { node_id: node_id, location: location, left: left, right: right, operator_loc: operator_loc }
end


  








  

    #inspect  
  



  

    
def inspect -> String

  



  [ GitHub ]


  

  


# File 'lib/prism/node.rb', line 13305



def inspect
  InspectVisitor.compose(self)
end


  








  

    #operator  
  



  

    
def operator: () -> String

  



  [ GitHub ]


  

  


# File 'lib/prism/node.rb', line 13300



def operator
  operator_loc.slice
end


  








  

    #operator_loc  
  



  

    
The location of the .. or ... operator.

  



  [ GitHub ]


  

  


# File 'lib/prism/node.rb', line 13293



def operator_loc
  location = @operator_loc
  return location if location.is_a?(Location)
  @operator_loc = Location.new(source, location >> 32, location & 0xFFFFFFFF)
end


  








  

    #type  
  



  

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

  



  [ GitHub ]


  

  


# File 'lib/prism/node.rb', line 13310



def type
  :range_node
end