class Prism::ArgumentsNode

Experimental RBS support (using type sampling data from the type_fusion project). 

# sig/prism/node.rbs

class Prism::ArgumentsNode < Prism::Node
  
  type Prism__ArgumentsNode_accept_return_value = Array[Prism::SplatNode] | Array[Prism::LocalVariableReadNode] | Array[Prism::CallNode] | Array[Prism::StringNode] | Array[Prism::SymbolNode] | Array[Prism::KeywordHashNode] | Array[Prism::IntegerNode] | Array[Prism::DefNode] | Array[Prism::RegularExpressionNode] | Array[Prism::SelfNode]
  
  def accept: (Analyzer::Visitor visitor) -> Prism__ArgumentsNode_accept_return_value
  
  type Prism__ArgumentsNode_compact_child_nodes_return_value = Array[Prism::StringNode] | Array[Prism::ConstantReadNode] | Array[Prism::LocalVariableReadNode] | Array[Prism::SymbolNode] | Array[Prism::IntegerNode] | Array[Prism::InterpolatedSymbolNode] | Array[Prism::CallNode] | Array[Prism::InstanceVariableReadNode] | Array[Prism::TrueNode] | Array[Prism::ArrayNode]
  
  def compact_child_nodes: () -> Prism__ArgumentsNode_compact_child_nodes_return_value
  
  type Prism__ArgumentsNode_initialize_arguments = Array[Prism::LocalVariableReadNode] | Array[Prism::CallNode] | Array[Prism::OrNode] | Array[Prism::StringNode] | Array[Prism::SymbolNode] | Array[Prism::InterpolatedSymbolNode] | Array[Prism::ConstantPathNode] | Array[Prism::DefNode] | Array[Prism::TrueNode] | Array[Prism::SplatNode] | Array[Prism::SelfNode] | Array[Prism::IntegerNode]
  
  def initialize: (Integer flags, Prism__ArgumentsNode_initialize_arguments arguments, Prism::Location location) -> void
end

^^^^^^^^^^^^^
return foo, bar, baz
Represents a set of arguments to a method or a keyword.

def self.type

def self.type: () -> Symbol

class, but should be faster in a case statement or an array comparison.
Note that like #type, it will still be slower than using == for a single
splitting on the type of the node without having to do a long === chain.
Similar to #type, this method returns a symbol that you can use for 
def self.type
  :arguments_node
end

def accept(visitor)

Experimental RBS support (using type sampling data from the type_fusion project). 

type Prism__ArgumentsNode_accept_return_value = Array[Prism::SplatNode] | Array[Prism::LocalVariableReadNode] | Array[Prism::CallNode] | Array[Prism::StringNode] | Array[Prism::SymbolNode] | Array[Prism::KeywordHashNode] | Array[Prism::IntegerNode] | Array[Prism::DefNode] | Array[Prism::RegularExpressionNode] | Array[Prism::SelfNode]
type Prism__ArgumentsNode_accept_return_value =  | Prism::SymbolNode | Prism::LocalVariableReadNode | Prism::CallNode | Prism::ConstantReadNode

def accept: (Analyzer::Visitor visitor) -> Prism__ArgumentsNode_accept_return_value

This signature was generated using 21 samples from 1 application.

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

def child_nodes

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

def comment_targets

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

def compact_child_nodes

Experimental RBS support (using type sampling data from the type_fusion project). 

type Prism__ArgumentsNode_compact_child_nodes_return_value = Array[Prism::StringNode] | Array[Prism::ConstantReadNode] | Array[Prism::LocalVariableReadNode] | Array[Prism::SymbolNode] | Array[Prism::IntegerNode] | Array[Prism::InterpolatedSymbolNode] | Array[Prism::CallNode] | Array[Prism::InstanceVariableReadNode] | Array[Prism::TrueNode] | Array[Prism::ArrayNode]
type Prism__ArgumentsNode_compact_child_nodes_return_value =  | Prism::LocalVariableReadNode | Prism::InterpolatedSymbolNode | Prism::CallNode | Prism::KeywordHashNode | Prism::SymbolNode | Prism::SymbolNode | Prism::SymbolNode | Prism::ConstantReadNode | Prism::KeywordHashNode

def compact_child_nodes: () -> Prism__ArgumentsNode_compact_child_nodes_return_value

This signature was generated using 26 samples from 1 application.

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

def contains_keyword_splat?

def contains_keyword_splat?: () -> bool 
def contains_keyword_splat?
  flags.anybits?(ArgumentsNodeFlags::CONTAINS_KEYWORD_SPLAT)
end

def copy(**params)

def copy: (**params) -> ArgumentsNode 
def copy(**params)
  ArgumentsNode.new(
    params.fetch(:flags) { flags },
    params.fetch(:arguments) { arguments },
    params.fetch(:location) { location },
  )
end

def deconstruct_keys(keys)

def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, arguments: Array[Node], location: Location } 
def deconstruct_keys(keys)
  { flags: flags, arguments: arguments, location: location }
end

def initialize(flags, arguments, location)

Experimental RBS support (using type sampling data from the type_fusion project). 

type Prism__ArgumentsNode_initialize_arguments = Array[Prism::LocalVariableReadNode] | Array[Prism::CallNode] | Array[Prism::OrNode] | Array[Prism::StringNode] | Array[Prism::SymbolNode] | Array[Prism::InterpolatedSymbolNode] | Array[Prism::ConstantPathNode] | Array[Prism::DefNode] | Array[Prism::TrueNode] | Array[Prism::SplatNode] | Array[Prism::SelfNode] | Array[Prism::IntegerNode]
type Prism__ArgumentsNode_initialize_arguments = Prism::LocalVariableReadNode |  | Prism::IntegerNode | Prism::StringNode | Prism::SplatNode | Prism::LocalVariableReadNode | Prism::CallNode | Prism::KeywordHashNode | Prism::ForwardingArgumentsNode | Prism::InterpolatedStringNode | Prism::SymbolNode | Prism::SymbolNode | Prism::SymbolNode

def initialize: (Integer flags, Prism__ArgumentsNode_initialize_arguments arguments, Prism::Location location) -> void

This signature was generated using 39 samples from 1 application.

def initialize: (Integer flags, Array[Node] arguments, Location location) -> void 
def initialize(flags, arguments, location)
  @newline = false
  @flags = flags
  @arguments = arguments
  @location = location
end

def inspect(inspector = NodeInspector.new)

def inspect(NodeInspector inspector) -> String 
def inspect(inspector = NodeInspector.new)
  inspector << inspector.header(self)
  flags = [("contains_keyword_splat" if contains_keyword_splat?)].compact
  inspector << "├── flags: #{flags.empty? ? "∅" : flags.join(", ")}\n"
  inspector << "└── arguments: #{inspector.list("#{inspector.prefix}    ", arguments)}"
  inspector.to_str
end

def type

def type: () -> Symbol

keys will use a jump table.
you can take advantage of the fact that case statements with all symbol
it uses a single integer comparison, but also because if you're on CRuby
can use for comparison. This is faster than the other approaches because
Instead, you can call #type, which will return to you a symbol that you

method calls, and/or array allocations.
these approaches are relatively slow because of the constant lookups,
case statement and doing `case node; when cls1; when cls2; end`. Both of
calling `[cls1, cls2].include?(node.class)` or putting the node into a
classes to see what kind of behavior to perform. Usually this is done by
Sometimes you want to check an instance of a node against a list of 
def type
  :arguments_node
end