Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://ruby-syntax-tree.github.io/syntax_tree/SyntaxTree/BareAssocHash.html below:

class SyntaxTree::BareAssocHash - RDoc Documentation

1. SyntaxTree::
2. BareAssocHash

BareAssocHash represents a hash of contents being passed as a method argument (and therefore has omitted braces). It’s very similar to an AssocListFromArgs node.

method(key1: value1, key2: value2)

def initialize(assocs:, location:)
  @assocs = assocs
  @location = location
  @comments = []
end

def ===(other)
  other.is_a?(BareAssocHash) && ArrayMatch.call(assocs, other.assocs)
end

def accept(visitor)
  visitor.visit_bare_assoc_hash(self)
end

def child_nodes
  assocs
end

def copy(assocs: nil, location: nil)
  node =
    BareAssocHash.new(
      assocs: assocs || self.assocs,
      location: location || self.location
    )

  node.comments.concat(comments.map(&:copy))
  node
end

def deconstruct_keys(_keys)
  { assocs: assocs, location: location, comments: comments }
end

def format(q)
  q.seplist(assocs) { |assoc| q.format(assoc) }
end

def format_key(q, key)
  @key_formatter ||=
    case q.parents.take(3).last
    when Break, Next, ReturnNode
      HashKeyFormatter::Identity.new
    else
      HashKeyFormatter.for(self)
    end

  @key_formatter.format_key(q, key)
end

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4