Results for: "fnmatch"

Iterates over strongly connected components in a graph. The graph is represented by node and each_child.

node is the first node. each_child should have call method which takes a node argument and yields for each child node.

Return value is unspecified.

TSort.each_strongly_connected_component_from is a class method and it doesn’t need a class to represent a graph which includes TSort.

graph = {1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}
each_child = lambda {|n, &b| graph[n].each(&b) }
TSort.each_strongly_connected_component_from(1, each_child) {|scc|
  p scc
}
#=> [4]
#   [2, 3]
#   [1]

1.0 ^^^

1i ^^

1r ^^

foo(*bar) ^^^^

def foo((bar, *baz)); end ^^^^

def foo(); bar(); end ^

A list of statements.

Wonky heredoc tab/spaces rules. github.com/ruby/prism/blob/v1.3.0/src/prism.c#L10548-L10558

1.0
^^^

1i

Visit the interpolated content of the string-like node.

1r
^^

foo(*bar)
    ^^^^

def foo((bar, *baz)); end
              ^^^^

def foo(*); bar(*); end
                ^

A list of statements.

Pattern constants get wrapped in another layer of :const.