class Prism::KeywordHashNode

Represents a hash literal without opening and closing braces.

foo(a: b)
    ^^^^

Attributes

elements[R]

attr_reader elements: Array

Public Class Methods

new(flags, elements, location) click to toggle source

def initialize: (flags: Integer, elements: Array, location: Location) -> void

# File lib/prism/node.rb, line 10411
def initialize(flags, elements, location)
  @flags = flags
  @elements = elements
  @location = location
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 lib/prism/node.rb, line 10492
def self.type
  :keyword_hash_node
end

Public Instance Methods

accept(visitor) click to toggle source

def accept: (visitor: Visitor) -> void

# File lib/prism/node.rb, line 10418
def accept(visitor)
  visitor.visit_keyword_hash_node(self)
end
child_nodes() click to toggle source

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

# File lib/prism/node.rb, line 10423
def child_nodes
  [*elements]
end
Also aliased as: deconstruct
comment_targets() click to toggle source

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

# File lib/prism/node.rb, line 10433
def comment_targets
  [*elements]
end
compact_child_nodes() click to toggle source

def compact_child_nodes: () -> Array

# File lib/prism/node.rb, line 10428
def compact_child_nodes
  [*elements]
end
copy(**params) click to toggle source

def copy: (**params) -> KeywordHashNode

# File lib/prism/node.rb, line 10438
def copy(**params)
  KeywordHashNode.new(
    params.fetch(:flags) { flags },
    params.fetch(:elements) { elements },
    params.fetch(:location) { location },
  )
end
deconstruct()

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

Alias for: child_nodes
deconstruct_keys(keys) click to toggle source

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

# File lib/prism/node.rb, line 10450
def deconstruct_keys(keys)
  { flags: flags, elements: elements, location: location }
end
inspect(inspector = NodeInspector.new) click to toggle source

def inspect(inspector: NodeInspector) -> String

# File lib/prism/node.rb, line 10460
def inspect(inspector = NodeInspector.new)
  inspector << inspector.header(self)
  flags = [("static_keys" if static_keys?)].compact
  inspector << "├── flags: #{flags.empty? ? "∅" : flags.join(", ")}\n"
  inspector << "└── elements: #{inspector.list("#{inspector.prefix}    ", elements)}"
  inspector.to_str
end
static_keys?() click to toggle source

def static_keys?: () -> bool

# File lib/prism/node.rb, line 10455
def static_keys?
  flags.anybits?(KeywordHashNodeFlags::STATIC_KEYS)
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 lib/prism/node.rb, line 10482
def type
  :keyword_hash_node
end