class Prism::LocalVariableOperatorWriteNode

Represents assigning to a local variable using an operator that isn’t ‘=`.

target += value
^^^^^^^^^^^^^^^

Attributes

binary_operator[R]

attr_reader binary_operator: Symbol

depth[R]

attr_reader depth: Integer

name[R]

attr_reader name: Symbol

value[R]

attr_reader value: Prism::node

Public Class Methods

new(source, name_loc, binary_operator_loc, value, name, binary_operator, depth, location) click to toggle source

def initialize: (Location name_loc, Location binary_operator_loc, Prism::node value, Symbol name, Symbol binary_operator, Integer depth, Location location) -> void

# File prism/node.rb, line 11960
def initialize(source, name_loc, binary_operator_loc, value, name, binary_operator, depth, location)
  @source = source
  @location = location
  @name_loc = name_loc
  @binary_operator_loc = binary_operator_loc
  @value = value
  @name = name
  @binary_operator = binary_operator
  @depth = depth
end

type() click to toggle source

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 12059
def self.type
  :local_variable_operator_write_node
end

Public Instance Methods

===(other) click to toggle source

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 12065
def ===(other)
  other.is_a?(LocalVariableOperatorWriteNode) &&
    (name_loc.nil? == other.name_loc.nil?) &&
    (binary_operator_loc.nil? == other.binary_operator_loc.nil?) &&
    (value === other.value) &&
    (name === other.name) &&
    (binary_operator === other.binary_operator) &&
    (depth === other.depth)
end

accept(visitor) click to toggle source

def accept: (Visitor visitor) -> void

# File prism/node.rb, line 11972
def accept(visitor)
  visitor.visit_local_variable_operator_write_node(self)
end

binary_operator_loc() click to toggle source

attr_reader binary_operator_loc: Location

# File prism/node.rb, line 12012
def binary_operator_loc
  location = @binary_operator_loc
  return location if location.is_a?(Location)
  @binary_operator_loc = Location.new(source, location >> 32, location & 0xFFFFFFFF)
end

child_nodes() click to toggle source

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

# File prism/node.rb, line 11977
def child_nodes
  [value]
end

Also aliased as: deconstruct

comment_targets() click to toggle source

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

# File prism/node.rb, line 11987
def comment_targets
  [name_loc, binary_operator_loc, value] #: Array[Prism::node | Location]
end

compact_child_nodes() click to toggle source

def compact_child_nodes: () -> Array

# File prism/node.rb, line 11982
def compact_child_nodes
  [value]
end

copy(name_loc: self.name_loc, binary_operator_loc: self.binary_operator_loc, value: self.value, name: self.name, binary_operator: self.binary_operator, depth: self.depth, location: self.location) click to toggle source

def copy: (?name_loc: Location, ?binary_operator_loc: Location, ?value: Prism::node, ?name: Symbol, ?binary_operator: Symbol, ?depth: Integer, ?location: Location) -> LocalVariableOperatorWriteNode

# File prism/node.rb, line 11992
def copy(name_loc: self.name_loc, binary_operator_loc: self.binary_operator_loc, value: self.value, name: self.name, binary_operator: self.binary_operator, depth: self.depth, location: self.location)
  LocalVariableOperatorWriteNode.new(source, name_loc, binary_operator_loc, value, name, binary_operator, depth, location)
end

deconstruct()

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

Alias for: child_nodes

deconstruct_keys(keys) click to toggle source

def deconstruct_keys: (Array keys) -> { name_loc: Location, binary_operator_loc: Location, value: Prism::node, name: Symbol, binary_operator: Symbol, depth: Integer, location: Location }

# File prism/node.rb, line 12000
def deconstruct_keys(keys)
  { name_loc: name_loc, binary_operator_loc: binary_operator_loc, value: value, name: name, binary_operator: binary_operator, depth: depth, location: location }
end

inspect() click to toggle source

def inspect -> String

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

name_loc() click to toggle source

attr_reader name_loc: Location

# File prism/node.rb, line 12005
def name_loc
  location = @name_loc
  return location if location.is_a?(Location)
  @name_loc = Location.new(source, location >> 32, location & 0xFFFFFFFF)
end

operator() click to toggle source

Returns the binary operator used to modify the receiver. This method is deprecated in favor of binary_operator.

# File prism/node_ext.rb, line 419
def operator
  deprecated("binary_operator")
  binary_operator
end

operator_loc() click to toggle source

Returns the location of the binary operator used to modify the receiver. This method is deprecated in favor of binary_operator_loc.

# File prism/node_ext.rb, line 426
def operator_loc
  deprecated("binary_operator_loc")
  binary_operator_loc
end

type() click to toggle source

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 12049
def type
  :local_variable_operator_write_node
end