class Prism::AssocNode
^^^^^^
{ a => b }
Represents a hash key/value pair.
def self.type
def self.type :assoc_node end
def ===(other)
Implements case-equality for the node. This is effectively == but without
def ===(other) other.is_a?(AssocNode) && (key === other.key) && (value === other.value) && (operator_loc.nil? == other.operator_loc.nil?) end
def accept(visitor)
def accept(visitor) visitor.visit_assoc_node(self) end
def child_nodes
def child_nodes [key, value] end
def comment_targets
def comment_targets [key, value, *operator_loc] #: Array[Prism::node | Location] end
def compact_child_nodes
def compact_child_nodes [key, value] end
def copy(node_id: self.node_id, location: self.location, flags: self.flags, key: self.key, value: self.value, operator_loc: self.operator_loc)
def copy(node_id: self.node_id, location: self.location, flags: self.flags, key: self.key, value: self.value, operator_loc: self.operator_loc) AssocNode.new(source, node_id, location, flags, key, value, operator_loc) end
def deconstruct_keys(keys)
def deconstruct_keys(keys) { node_id: node_id, location: location, key: key, value: value, operator_loc: operator_loc } end
def initialize(source, node_id, location, flags, key, value, operator_loc)
def initialize(source, node_id, location, flags, key, value, operator_loc) @source = source @node_id = node_id @location = location @flags = flags @key = key @value = value @operator_loc = operator_loc end
def inspect
def inspect InspectVisitor.compose(self) end
def operator
def operator operator_loc&.slice end
def operator_loc
{ foo => bar }
The location of the `=>` operator, if present.
def operator_loc location = @operator_loc case location when nil nil when Location location else @operator_loc = Location.new(source, location >> 32, location & 0xFFFFFFFF) end end
def type
def type :assoc_node end