Results for: "pstore"

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.

Add local/remote options to the command line parser.

Add the –bulk-threshold option

Pushes a new {DependencyState}. If the {#specification_provider} says to {SpecificationProvider#allow_missing?} that particular requirement, and there are no possibilities for that requirement, then ‘state` is not pushed, and the vertex in {#activated} is removed, and we continue resolving the remaining requirements. @param [DependencyState] state @return [void]

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]

@!visibility private Enumerates each action in the log in reverse order @yield [Action]

Is there a path from ‘self` to `other` following edges in the dependency graph? @return whether there is a path following edges within this {#graph}

@param [Vertex] other the vertex to check if there’s a path to @param [Set<Vertex>] visited the vertices of {#graph} that have been visited @return [Boolean] whether there is a path to ‘other` from `self`

Ends the resolution process @return [void]

@param [Object] requirement @return [Object] the requirement that led to ‘requirement` being added

to the list of requirements.

@param [Object] underlying_error @return [Conflict] a {Conflict} that reflects the failure to activate

the {#possibility} in conjunction with the current {#state}

Indicates progress roughly once every second @return [void]

(see Gem::Resolver::Molinillo::SpecificationProvider#search_for)

(see Gem::Resolver::Molinillo::SpecificationProvider#dependencies_for)

(see Gem::Resolver::Molinillo::SpecificationProvider#name_for)

(see Gem::Resolver::Molinillo::SpecificationProvider#sort_dependencies)

Returns the form how EC::Point data is encoded as ASN.1.

See also point_conversion_form=.

Sets the form how EC::Point data is encoded as ASN.1 as defined in X9.62.

format can be one of these:

:compressed

Encoded as z||x, where z is an octet indicating which solution of the equation y is. z will be 0x02 or 0x03.

:uncompressed

Encoded as z||x||y, where z is an octet 0x04.

:hybrid

Encodes as z||x||y, where z is an octet indicating which solution of the equation y is. z will be 0x06 or 0x07.

See the OpenSSL documentation for EC_GROUP_set_point_conversion_form()