Class: Prism::BackReferenceReadNode

Inherits:
PrismNode
  • Object
show all
Defined in:
lib/prism/node.rb,
ext/prism/api_node.c

Overview

Represents reading a reference to a field in the previous match.

$'
^^

Instance Attribute Summary collapse

Class Method Summary collapse

Instance Method Summary collapse

Constructor Details

#initialize(name, location) ⇒ BackReferenceReadNode

def initialize: (name: Symbol, location: Location) -> void



1065
1066
1067
1068
# File 'lib/prism/node.rb', line 1065

def initialize(name, location)
  @name = name
  @location = location
end

Instance Attribute Details

#nameObject (readonly)

attr_reader name: Symbol



1062
1063
1064
# File 'lib/prism/node.rb', line 1062

def name
  @name
end

Class Method Details

.typeObject

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



1137
1138
1139
# File 'lib/prism/node.rb', line 1137

def self.type
  :back_reference_read_node
end

Instance Method Details

#accept(visitor) ⇒ Object

def accept: (visitor: Visitor) -> void



1071
1072
1073
# File 'lib/prism/node.rb', line 1071

def accept(visitor)
  visitor.visit_back_reference_read_node(self)
end

#child_nodesObject Also known as: deconstruct

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



1076
1077
1078
# File 'lib/prism/node.rb', line 1076

def child_nodes
  []
end

#comment_targetsObject

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



1086
1087
1088
# File 'lib/prism/node.rb', line 1086

def comment_targets
  []
end

#compact_child_nodesObject

def compact_child_nodes: () -> Array



1081
1082
1083
# File 'lib/prism/node.rb', line 1081

def compact_child_nodes
  []
end

#copy(**params) ⇒ Object

def copy: (**params) -> BackReferenceReadNode



1091
1092
1093
1094
1095
1096
# File 'lib/prism/node.rb', line 1091

def copy(**params)
  BackReferenceReadNode.new(
    params.fetch(:name) { name },
    params.fetch(:location) { location },
  )
end

#deconstruct_keys(keys) ⇒ Object

def deconstruct_keys: (keys: Array) -> Hash[Symbol, nil | Node | Array | String | Token | Array | Location]



1102
1103
1104
# File 'lib/prism/node.rb', line 1102

def deconstruct_keys(keys)
  { name: name, location: location }
end

#inspect(inspector = NodeInspector.new) ⇒ Object

def inspect(inspector: NodeInspector) -> String



1107
1108
1109
1110
1111
# File 'lib/prism/node.rb', line 1107

def inspect(inspector = NodeInspector.new)
  inspector << inspector.header(self)
  inspector << "└── name: #{name.inspect}\n"
  inspector.to_str
end

#typeObject

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



1127
1128
1129
# File 'lib/prism/node.rb', line 1127

def type
  :back_reference_read_node
end