Results for: "match"

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`

@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)

@!visibility private

@param [String] name @param [Object] payload @param [Array<String>] parent_names @param [Object] requirement the requirement that is requiring the child @return [void]

Detaches the {#vertex_named} ‘name` {Vertex} from the graph, recursively removing any non-root vertices that were orphaned in the process @param [String] name @return [Array<Vertex>] the vertices which have been detached

Removes a possibility from ‘self` @return [PossibilityState] a state with a single possibility,

the possibility that was removed from `self`

Determines whether the given ‘requirement` is satisfied by the given `spec`, in the context of the current `activated` dependency graph.

@param [Object] requirement @param [DependencyGraph] activated the current dependency graph in the

resolution process.

@param [Object] spec @return [Boolean] whether ‘requirement` is satisfied by `spec` in the

context of the current `activated` dependency graph.

Sets the minimum and maximum supported protocol versions. See min_version= and max_version=.