Class: Prism::KeywordHashNode
| Relationships & Source Files | |
| Super Chains via Extension / Inclusion / Inheritance | |
|
Class Chain:
self,
PrismNode
|
|
|
Instance Chain:
self,
PrismNode
|
|
| Inherits: |
PrismNode
|
| Defined in: | lib/prism/node.rb, ext/prism/api_node.c |
Overview
Represents a hash literal without opening and closing braces.
foo(a: b)
^^^^
Class Method Summary
-
.new(source, node_id, location, flags, elements) ⇒ KeywordHashNode
constructor
Initialize a new
KeywordHashNodenode. -
.type
Return a symbol representation of this node type.
Instance Attribute Summary
-
#elements
readonly
attr_reader elements: Array[AssocNode | AssocSplatNode].
-
#symbol_keys? ⇒ Boolean
readonly
def symbol_keys?: () -> bool.
Instance Method Summary
-
#===(other)
Implements case-equality for the node.
-
#accept(visitor)
def accept: (Visitor visitor) -> void.
-
#child_nodes
(also: #deconstruct)
def child_nodes: () -> Array[nil | Node].
-
#comment_targets
def comment_targets: () -> Array[Node | Location].
-
#compact_child_nodes
def compact_child_nodes: () -> Array.
-
#copy(node_id: self.node_id, location: self.location, flags: self.flags, elements: self.elements)
def copy: (?node_id: Integer, ?location:
Location, ?flags: Integer, ?elements: Array[AssocNode | AssocSplatNode]) ->KeywordHashNode. -
#deconstruct
Alias for #child_nodes.
- #deconstruct_keys(keys)
-
#inspect
def inspect -> String.
-
#type
Return a symbol representation of this node type.
Constructor Details
.new(source, node_id, location, flags, elements) ⇒ KeywordHashNode
Initialize a new KeywordHashNode node.
Class Method Details
.type
Return a symbol representation of this node type. See Node::type.
# File 'lib/prism/node.rb', line 9991
def self.type :keyword_hash_node end
Instance Attribute Details
#elements (readonly)
attr_reader elements: Array[AssocNode | AssocSplatNode]
# File 'lib/prism/node.rb', line 9979
attr_reader :elements
#symbol_keys? ⇒ Boolean (readonly)
def symbol_keys?: () -> bool
# File 'lib/prism/node.rb', line 9974
def symbol_keys? flags.anybits?(KeywordHashNodeFlags::SYMBOL_KEYS) end
Instance Method Details
#===(other)
Implements case-equality for the node. This is effectively == but without comparing the value of locations. Locations are checked only for presence.
#accept(visitor)
def accept: (Visitor visitor) -> void
# File 'lib/prism/node.rb', line 9941
def accept(visitor) visitor.visit_keyword_hash_node(self) end
#child_nodes Also known as: #deconstruct
def child_nodes: () -> Array[nil | Node]
# File 'lib/prism/node.rb', line 9946
def child_nodes [*elements] end
#comment_targets
def comment_targets: () -> Array[Node | Location]
# File 'lib/prism/node.rb', line 9956
def comment_targets [*elements] #: Array[Prism::node | Location] end
#compact_child_nodes
def compact_child_nodes: () -> Array
# File 'lib/prism/node.rb', line 9951
def compact_child_nodes [*elements] end
#copy(node_id: self.node_id, location: self.location, flags: self.flags, elements: self.elements)
def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?elements: Array[AssocNode | AssocSplatNode]) -> KeywordHashNode
#deconstruct
Alias for #child_nodes.
# File 'lib/prism/node.rb', line 9966
alias deconstruct child_nodes
#deconstruct_keys(keys)
# File 'lib/prism/node.rb', line 9969
def deconstruct_keys(keys) { node_id: node_id, location: location, elements: elements } end
#inspect
def inspect -> String
# File 'lib/prism/node.rb', line 9981
def inspect InspectVisitor.compose(self) end
#type
Return a symbol representation of this node type. See Node#type.
# File 'lib/prism/node.rb', line 9986
def type :keyword_hash_node end