Represents a node that is implicitly being added to the tree but doesn’t correspond directly to a node in the source.
{ foo: }
^^^^
{ Foo: }
^^^^
foo in { bar: }
^^^^
attr_reader value: Prism::node
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 8776
def initialize(source, value, location)
@source = source
@location = location
@value = value
end
def initialize: (Prism::node value, Location location) -> void
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 8847
def self.type
:implicit_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 8853
def ===(other)
other.is_a?(ImplicitNode) &&
(value === other.value)
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 8783
def accept(visitor)
visitor.visit_implicit_node(self)
end
def accept: (Visitor visitor) -> void
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 8788
def child_nodes
[value]
end
def child_nodes: () -> Array[nil | Node]
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 8798
def comment_targets
[value] #: Array[Prism::node | Location]
end
def comment_targets: () -> Array[Node | Location]
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 8793
def compact_child_nodes
[value]
end
def compact_child_nodes: () -> Array
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 8803
def copy(value: self.value, location: self.location)
ImplicitNode.new(source, value, location)
end
def copy: (?value: Prism::node, ?location: Location) -> ImplicitNode
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 8811
def deconstruct_keys(keys)
{ value: value, location: location }
end
def deconstruct_keys: (Array keys) -> { value: Prism::node, location: Location }
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 8819
def inspect
InspectVisitor.compose(self)
end
def inspect -> String
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 8837
def type
:implicit_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