Represents the use of the ‘||` operator or the `or` keyword.
left or right ^^^^^^^^^^^^^
Represents the left side of the expression. It can be any [non-void expression](github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
left or right ^^^^ 1 || 2 ^
Represents the right side of the expression. It can be any [non-void expression](github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
left || right
^^^^^
1 or 2
^
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 14318
def initialize(source, left, right, operator_loc, location)
@source = source
@location = location
@left = left
@right = right
@operator_loc = operator_loc
end
def initialize: (Prism::node left, Prism::node right, Location operator_loc, Location location) -> void
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 14421
def self.type
:or_node
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 tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 14427
def ===(other)
other.is_a?(OrNode) &&
(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.
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 14327
def accept(visitor)
visitor.visit_or_node(self)
end
def accept: (Visitor visitor) -> void
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 14332
def child_nodes
[left, right]
end
def child_nodes: () -> Array[nil | Node]
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 14342
def comment_targets
[left, right, operator_loc] #: Array[Prism::node | Location]
end
def comment_targets: () -> Array[Node | Location]
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 14337
def compact_child_nodes
[left, right]
end
def compact_child_nodes: () -> Array
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 14347
def copy(left: self.left, right: self.right, operator_loc: self.operator_loc, location: self.location)
OrNode.new(source, left, right, operator_loc, location)
end
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 14355
def deconstruct_keys(keys)
{ left: left, right: right, operator_loc: operator_loc, location: location }
end
def deconstruct_keys: (Array keys) -> { left: Prism::node, right: Prism::node, operator_loc: Location, location: Location }
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 14393
def inspect
InspectVisitor.compose(self)
end
def inspect -> String
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 14388
def operator
operator_loc.slice
end
def operator: () -> String
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 14381
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` keyword or the `||` operator.
left or right
^^
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 14411
def type
:or_node
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