Results for: "match"

No documentation available
No documentation available

Return the best specification that contains the file matching path amongst the specs that are not activated.

Returns a Ruby lighter-weight code representation of this specification, used for indexing only.

See to_ruby.

No documentation available
No documentation available

Return the best specification in the record that contains the file matching path amongst the specs that are not activated.

See the OpenSSL documentation for EVP_PKEY_new_raw_private_key()

No documentation available

Creates a self-signed certificate with an issuer and subject of subject and the given extensions for the key.

Add the install/update options to the option parser.

Default description for the gem install and update commands.

Add the –update-sources option

Corrects path (usually returned by ‘Gem::URI.parse().path` on Windows), that comes with a leading slash.

Extract platform given on the command line

No documentation available

Iterates over strongly connected component in the subgraph reachable from node.

Return value is unspecified.

each_strongly_connected_component_from doesn’t call tsort_each_node.

class G
  include TSort
  def initialize(g)
    @g = g
  end
  def tsort_each_child(n, &b) @g[n].each(&b) end
  def tsort_each_node(&b) @g.each_key(&b) end
end

graph = G.new({1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]})
graph.each_strongly_connected_component_from(2) {|scc| p scc }
#=> [4]
#   [2]

graph = G.new({1=>[2], 2=>[3, 4], 3=>[2], 4=>[]})
graph.each_strongly_connected_component_from(2) {|scc| p scc }
#=> [4]
#   [2, 3]

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]
No documentation available

1.0 ^^^

1i ^^

1r ^^

foo(*bar)

^^^^

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

^^^^

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

^

A list of statements.

1.0 ^^^

Search took: 5ms  ·  Total Results: 1903