class Prism::RangeNode
Represents the use of the ‘..` or `…` operators.
1..2 ^^^^ c if a =~ /left/ ... b =~ /right/ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Attributes
protected attr_reader flags: Integer
The left-hand side of the range, if present. It can be either ‘nil` or any [non-void expression](github.com/ruby/prism/blob/main/docs/parsing_rules.md#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](github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
..5 ^ 1...foo ^^^
If neither right-hand or left-hand side was included, this will be a MissingNode
.
Public Class Methods
def initialize: (Integer flags, Prism::node? left, Prism::node? right, Location
operator_loc
, Location
location) -> void
# File prism/node.rb, line 15287 def initialize(source, flags, left, right, operator_loc, location) @source = source @location = location @flags = flags @left = left @right = right @operator_loc = operator_loc end
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 prism/node.rb, line 15401 def self.type :range_node end
Public Instance Methods
Implements case-equality for the node. This is effectively == but without comparing the value of locations. Locations are checked only for presence.
# File prism/node.rb, line 15407 def ===(other) other.is_a?(RangeNode) && (flags === other.flags) && (left === other.left) && (right === other.right) && (operator_loc.nil? == other.operator_loc.nil?) end
def accept: (Visitor
visitor) -> void
# File prism/node.rb, line 15297 def accept(visitor) visitor.visit_range_node(self) end
def child_nodes
: () -> Array[nil | Node]
# File prism/node.rb, line 15302 def child_nodes [left, right] end
def comment_targets
: () -> Array[Node | Location]
# File prism/node.rb, line 15315 def comment_targets [*left, *right, operator_loc] #: Array[Prism::node | Location] end
def compact_child_nodes
: () -> Array
# File prism/node.rb, line 15307 def compact_child_nodes compact = [] #: Array[Prism::node] compact << left if left compact << right if right compact end
def copy: (?flags: Integer, ?left: Prism::node?, ?right: Prism::node?, ?operator_loc: Location
, ?location: Location
) -> RangeNode
# File prism/node.rb, line 15320 def copy(flags: self.flags, left: self.left, right: self.right, operator_loc: self.operator_loc, location: self.location) RangeNode.new(source, flags, left, right, operator_loc, location) end
def deconstruct_keys
: (Array keys) -> { flags: Integer, left: Prism::node?, right: Prism::node?, operator_loc
: Location
, location: Location
}
# File prism/node.rb, line 15328 def deconstruct_keys(keys) { flags: flags, left: left, right: right, operator_loc: operator_loc, location: location } end
def exclude_end?: () -> bool
# File prism/node.rb, line 15363 def exclude_end? flags.anybits?(RangeFlags::EXCLUDE_END) end
def inspect -> String
# File prism/node.rb, line 15373 def inspect InspectVisitor.compose(self) end
def operator: () -> String
# File prism/node.rb, line 15368 def operator operator_loc.slice end
The location of the ‘..` or `…` operator.
# File prism/node.rb, line 15356 def operator_loc location = @operator_loc return location if location.is_a?(Location) @operator_loc = Location.new(source, location >> 32, location & 0xFFFFFFFF) end
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 prism/node.rb, line 15391 def type :range_node end