class Prism::AndNode

Parent:: Prism::Node

Represents the use of the ‘&&` operator or the `and` keyword.

left and right
^^^^^^^^^^^^^^

Attributes

left [R]

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 and right
^^^^

1 && 2
^

right [R]

Represents the right side of the expression.

left && right
        ^^^^^

1 and 2
      ^

Public Class Methods

new (source, node_id, location, flags, left, right, operator_loc)

Source

# File lib/prism/node.rb, line 651
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 AndNode node.

type ()

Source

# File lib/prism/node.rb, line 744
def self.type
  :and_node
end

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

Public Instance Methods

=== (other)

Source

# File lib/prism/node.rb, line 750
def ===(other)
  other.is_a?(AndNode) &&
    (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.

accept (visitor)

Source

# File lib/prism/node.rb, line 662
def accept(visitor)
  visitor.visit_and_node(self)
end

def accept: (Visitor visitor) -> void

child_nodes ()

Source

# File lib/prism/node.rb, line 667
def child_nodes
  [left, right]
end

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

Also aliased as: deconstruct

comment_targets ()

Source

# File lib/prism/node.rb, line 677
def comment_targets
  [left, right, operator_loc] #: Array[Prism::node | Location]
end

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

compact_child_nodes ()

Source

# File lib/prism/node.rb, line 672
def compact_child_nodes
  [left, right]
end

def compact_child_nodes: () -> Array

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

Source

# File lib/prism/node.rb, line 682
def copy(node_id: self.node_id, location: self.location, flags: self.flags, left: self.left, right: self.right, operator_loc: self.operator_loc)
  AndNode.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) -> AndNode

deconstruct ()

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

Alias for: child_nodes

deconstruct_keys (keys)

Source

# File lib/prism/node.rb, line 690
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 }

inspect ()

Source

# File lib/prism/node.rb, line 734
def inspect
  InspectVisitor.compose(self)
end

def inspect -> String

operator ()

Source

# File lib/prism/node.rb, line 729
def operator
  operator_loc.slice
end

def operator: () -> String

operator_loc ()

Source

# File lib/prism/node.rb, line 716
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 ‘and` keyword or the `&&` operator.

left and right
     ^^^

save_operator_loc (repository)

Source

# File lib/prism/node.rb, line 724
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.

type ()

Source

# File lib/prism/node.rb, line 739
def type
  :and_node
end

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

Ruby Core © 1993–2024 Yukihiro Matsumoto
Licensed under the Ruby License.
Ruby Standard Library © contributors
Licensed under their own licenses.