class Prism::KeywordHashNode - Documentation for Ruby 4.0
Description: class Prism::KeywordHashNode: Represents a hash literal without opening and closing braces.
Keywords: ruby,class,Prism::KeywordHashNode

🔍

No recent searches

# class Prism::KeywordHashNode

Represents a hash literal without opening and closing braces.

    foo(a: b)
        ^^^^

### Attributes

elements [R]

attr_reader elements: Array[AssocNode | AssocSplatNode]

### Public Class Methods

new (source, node_id, location, flags, elements)
Source

    # File lib/prism/node.rb, line 12138
    def initialize(source, node_id, location, flags, elements)
      @source = source
      @node_id = node_id
      @location = location
      @flags = flags
      @elements = elements
    end

Initialize a new `KeywordHashNode` node.

type ()
Source

    # File lib/prism/node.rb, line 12205
    def self.type
      :keyword_hash_node
    end

Return a symbol representation of this node type. See `Node::type`.

### Public Instance Methods

=== (other)
Source

    # File lib/prism/node.rb, line 12211
    def ===(other)
      other.is_a?(KeywordHashNode) &&
        (flags === other.flags) &&
        (elements.length == other.elements.length) &&
        elements.zip(other.elements).all? { |left, right| left === right }
    end

Implements case-equality for the node. This is effectively == but without comparing the value of locations. Locations are checked only for presence.

accept (visitor)
Source

    # File lib/prism/node.rb, line 12147
    def accept(visitor)
      visitor.visit_keyword_hash_node(self)
    end

def accept: (`Visitor` visitor) -> void

child_nodes ()
Source

    # File lib/prism/node.rb, line 12152
    def child_nodes
      [*elements]
    end

def `child_nodes`: () -> Array

Also aliased as: deconstruct
comment_targets ()
Source

    # File lib/prism/node.rb, line 12169
    def comment_targets
      [*elements] #: Array[Prism::node | Location]
    end

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

compact_child_nodes ()
Source

    # File lib/prism/node.rb, line 12164
    def compact_child_nodes
      [*elements]
    end

def `compact_child_nodes`: () -> Array

copy (node_id: self.node_id, location: self.location, flags: self.flags, elements: self.elements)
Source

    # File lib/prism/node.rb, line 12174
    def copy(node_id: self.node_id, location: self.location, flags: self.flags, elements: self.elements)
      KeywordHashNode.new(source, node_id, location, flags, elements)
    end

def copy: (?node_id: `Integer`, ?location: `Location`, ?flags: `Integer`, ?elements: Array[AssocNode | AssocSplatNode]) -> `KeywordHashNode`

deconstruct ()

def deconstruct: () -> Array

Alias for: child_nodes
deconstruct_keys (keys)
Source

    # File lib/prism/node.rb, line 12182
    def deconstruct_keys(keys)
      { node_id: node_id, location: location, elements: elements }
    end

def `deconstruct_keys`: (Array keys) -> { node_id: `Integer`, location: `Location`, elements: Array[AssocNode | AssocSplatNode] }

each_child_node () { |node| ... }
Source

    # File lib/prism/node.rb, line 12157
    def each_child_node
      return to_enum(:each_child_node) unless block_given?

      elements.each { |node| yield node }
    end

def `each_child_node`: () { (Prism::node) -> void } -> void | () -> Enumerator

inspect ()
Source

    # File lib/prism/node.rb, line 12195
    def inspect
      InspectVisitor.compose(self)
    end

def inspect -> `String`

symbol_keys? ()
Source

    # File lib/prism/node.rb, line 12187
    def symbol_keys?
      flags.anybits?(KeywordHashNodeFlags::SYMBOL_KEYS)
    end

def symbol_keys?: () -> bool

type ()
Source

    # File lib/prism/node.rb, line 12200
    def type
      :keyword_hash_node
    end

Return a symbol representation of this node type. See `Node#type`.