Prism::Node#breadth_first_search

breadth_first_search() { |node| ... }

# File tmp/rubies/ruby-3.4.1/lib/prism/node.rb, line 228
def breadth_first_search(&block)
  queue = [self] #: Array[Prism::node]

  while (node = queue.shift)
    return node if yield node
    queue.concat(node.compact_child_nodes)
  end

  nil
end

Returns the first node that matches the given block when visited in a depth-first search. This is useful for finding a node that matches a particular condition.

Example

node.breadth_first_search { |node| node.node_id == node_id }

See also #accept #cached_end_code_units_column .type #cached_end_code_units_offset also in 4.0

‹ prev#accept next ›#cached_end_code_units_column