class Bundler::Molinillo::DependencyGraph::Vertex

Parent:: Object

A vertex in a {DependencyGraph} that encapsulates a {#name} and a {#payload}

Attributes

explicit_requirements[R]

@return [Array<Object>] the explicit requirements that required

this vertex

incoming_edges[RW]

@return [Array<Edge>] the edges of {#graph} that have `self` as their

{Edge#destination}

name[RW]

@return [String] the name of the vertex

outgoing_edges[RW]

@return [Array<Edge>] the edges of {#graph} that have `self` as their

{Edge#origin}

payload[RW]

@return [Object] the payload the vertex holds

root[RW]

@return [Boolean] whether the vertex is considered a root vertex

root?[RW]

@return [Boolean] whether the vertex is considered a root vertex

Public Class Methods

new(name, payload) Show source

# File lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb, line 25
def initialize(name, payload)
  @name = name.frozen? ? name : name.dup.freeze
  @payload = payload
  @explicit_requirements = []
  @outgoing_edges = []
  @incoming_edges = []
end

Initializes a vertex with the given name and payload. @param [String] name see {#name} @param [Object] payload see {#payload}

Public Instance Methods

==(other) Show source

# File lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb, line 84
def ==(other)
  return true if equal?(other)
  shallow_eql?(other) &&
    successors.to_set == other.successors.to_set
end

@return [Boolean] whether the two vertices are equal, determined

by a recursive traversal of each {Vertex#successors}

Also aliased as: eql?

ancestor?(other) Show source

# File lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb, line 129
def ancestor?(other)
  other.path_to?(self)
end

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

Also aliased as: is_reachable_from?

descendent?(other)

Alias for: path_to?

eql?(other)

Alias for: ==

hash() Show source

# File lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb, line 103
def hash
  name.hash
end

@return [Fixnum] a hash for the vertex based upon its {#name}

inspect() Show source

# File lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb, line 78
def inspect
  "#{self.class}:#{name}(#{payload.inspect})"
end

@return [String] a string suitable for debugging

is_reachable_from?(other)

Alias for: ancestor?

path_to?(other) Show source

# File lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb, line 110
def path_to?(other)
  _path_to?(other)
end

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

Also aliased as: descendent?

predecessors() Show source

# File lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb, line 49
def predecessors
  incoming_edges.map(&:origin)
end

@return [Array<Vertex>] the vertices of {#graph} that have an edge with

`self` as their {Edge#destination}

recursive_predecessors() Show source

# File lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb, line 55
def recursive_predecessors
  vertices = predecessors
  vertices += Compatibility.flat_map(vertices, &:recursive_predecessors)
  vertices.uniq!
  vertices
end

@return [Array<Vertex>] the vertices of {#graph} where `self` is a

{#descendent?}

recursive_successors() Show source

# File lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb, line 70
def recursive_successors
  vertices = successors
  vertices += Compatibility.flat_map(vertices, &:recursive_successors)
  vertices.uniq!
  vertices
end

@return [Array<Vertex>] the vertices of {#graph} where `self` is an

{#ancestor?}

requirements() Show source

# File lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb, line 35
def requirements
  (incoming_edges.map(&:requirement) + explicit_requirements).uniq
end

@return [Array<Object>] all of the requirements that required

this vertex

shallow_eql?(other) Show source

# File lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb, line 93
def shallow_eql?(other)
  return true if equal?(other)
  other &&
    name == other.name &&
    payload == other.payload
end

@param [Vertex] other the other vertex to compare to @return [Boolean] whether the two vertices are equal, determined

solely by {#name} and {#payload} equality

successors() Show source

# File lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb, line 64
def successors
  outgoing_edges.map(&:destination)
end

@return [Array<Vertex>] the vertices of {#graph} that have an edge with

`self` as their {Edge#origin}

Protected Instance Methods

_path_to?(other, visited = Set.new) Show source

# File lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb, line 119
def _path_to?(other, visited = Set.new)
  return false unless visited.add?(self)
  return true if equal?(other)
  successors.any? { |v| v._path_to?(other, visited) }
end

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

Ruby Core © 1993–2017 Yukihiro Matsumoto
Licensed under the Ruby License.
Ruby Standard Library © contributors
Licensed under their own licenses.