class Prism::RangeNode
Represents the use of the ..
or ...
operators.
1..2 ^^^^ c if a =~ /left/ ... b =~ /right/ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Attributes
The left-hand side of the range, if present. It can be either nil
or any non-void expression.
1... ^ hello...goodbye ^^^^^
The right-hand side of the range, if present. It can be either nil
or any non-void expression.
..5 ^ 1...foo ^^^
If neither right-hand or left-hand side was included, this will be a MissingNode
.
Public Class Methods
Source
# File lib/prism/node.rb, line 14954 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
Initialize a new RangeNode
node.
Source
# File lib/prism/node.rb, line 15053 def self.type :range_node end
Return a symbol representation of this node type. See Node::type
.
Public Instance Methods
Source
# File lib/prism/node.rb, line 15059 def ===(other) other.is_a?(RangeNode) && (flags === other.flags) && (left === other.left) && (right === other.right) && (operator_loc.nil? == other.operator_loc.nil?) end
Implements case-equality for the node. This is effectively == but without comparing the value of locations. Locations are checked only for presence.
Source
# File lib/prism/node.rb, line 14965 def accept(visitor) visitor.visit_range_node(self) end
def accept: (Visitor
visitor) -> void
Source
# File lib/prism/node.rb, line 14970 def child_nodes [left, right] end
def child_nodes
: () -> Array[nil | Node]
Source
# File lib/prism/node.rb, line 14983 def comment_targets [*left, *right, operator_loc] #: Array[Prism::node | Location] end
def comment_targets
: () -> Array[Node | Location]
Source
# File lib/prism/node.rb, line 14975 def compact_child_nodes compact = [] #: Array[Prism::node] compact << left if left compact << right if right compact end
def compact_child_nodes
: () -> Array
Source
# File lib/prism/node.rb, line 14988 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
def copy: (?node_id: Integer, ?location: Location
, ?flags: Integer, ?left: Prism::node?, ?right: Prism::node?, ?operator_loc: Location
) -> RangeNode
Source
# File lib/prism/node.rb, line 14996 def deconstruct_keys(keys) { node_id: node_id, location: location, left: left, right: right, operator_loc: operator_loc } end
def deconstruct_keys
: (Array keys) -> { node_id: Integer, location: Location
, left: Prism::node?, right: Prism::node?, operator_loc
: Location
}
Source
# File lib/prism/node.rb, line 15001 def exclude_end? flags.anybits?(RangeFlags::EXCLUDE_END) end
def exclude_end?: () -> bool
Source
# File lib/prism/node.rb, line 15043 def inspect InspectVisitor.compose(self) end
def inspect -> String
Source
# File lib/prism/node.rb, line 15038 def operator operator_loc.slice end
def operator: () -> String
Source
# File lib/prism/node.rb, line 15025 def operator_loc location = @operator_loc return location if location.is_a?(Location) @operator_loc = Location.new(source, location >> 32, location & 0xFFFFFFFF) end
The location of the ..
or ...
operator.
Source
# File lib/prism/node.rb, line 15033 def save_operator_loc(repository) repository.enter(node_id, :operator_loc) end
Save the operator_loc
location using the given saved source so that it can be retrieved later.
Source
# File lib/prism/node.rb, line 15048 def type :range_node end
Return a symbol representation of this node type. See Node#type
.