class Prism::ImplicitNode

^^^^
foo in { bar: }
^^^^
{ Foo: }
^^^^
{ foo: }
Represents a node that is implicitly being added to the tree but doesn’t correspond directly to a node in the source.

def self.type

Return a symbol representation of this node type. See `Node::type`. 
def self.type
  :implicit_node
end

def ===(other)

comparing the value of locations. Locations are checked only for presence.
Implements case-equality for the node. This is effectively == but without 
def ===(other)
  other.is_a?(ImplicitNode) &&
    (value === other.value)
end

def accept(visitor)

def accept: (Visitor visitor) -> void 
def accept(visitor)
  visitor.visit_implicit_node(self)
end

def child_nodes

def child_nodes: () -> Array[Node?] 
def child_nodes
  [value]
end

def comment_targets

def comment_targets: () -> Array[Node | Location] 
def comment_targets
  [value] #: Array[Prism::node | Location]
end

def compact_child_nodes

def compact_child_nodes: () -> Array[Node] 
def compact_child_nodes
  [value]
end

def copy(node_id: self.node_id, location: self.location, flags: self.flags, value: self.value)

def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?value: LocalVariableReadNode | CallNode | ConstantReadNode | LocalVariableTargetNode) -> ImplicitNode 
def copy(node_id: self.node_id, location: self.location, flags: self.flags, value: self.value)
  ImplicitNode.new(source, node_id, location, flags, value)
end

def deconstruct_keys(keys)

def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, value: LocalVariableReadNode | CallNode | ConstantReadNode | LocalVariableTargetNode } 
def deconstruct_keys(keys)
  { node_id: node_id, location: location, value: value }
end

def initialize(source, node_id, location, flags, value)

Initialize a new ImplicitNode node. 
def initialize(source, node_id, location, flags, value)
  @source = source
  @node_id = node_id
  @location = location
  @flags = flags
  @value = value
end

def inspect

def inspect -> String 
def inspect
  InspectVisitor.compose(self)
end

def type

Return a symbol representation of this node type. See `Node#type`. 
def type
  :implicit_node
end