Class: Bundler::Molinillo::DependencyGraph::Vertex

Inherits:

Object

• Object
• Bundler::Molinillo::DependencyGraph::Vertex

Defined in:

lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb

Overview

A vertex in a Bundler::Molinillo::DependencyGraph that encapsulates a #name and a #payload

Instance Attribute Summary

• #explicit_requirements ⇒ Array<Object> readonly

  The explicit requirements that required this vertex.

• #incoming_edges ⇒ Array<Edge>

  The edges of #graph that have ‘self` as their Edge#destination.

• #name ⇒ String

  The name of the vertex.

• #outgoing_edges ⇒ Array<Edge>

  The edges of #graph that have ‘self` as their Edge#origin.

• #payload ⇒ Object

  The payload the vertex holds.

• #root ⇒ Boolean (also: #root?)

  Whether the vertex is considered a root vertex.

Instance Method Summary

• #==(other) ⇒ Boolean (also: #eql?)

  Whether the two vertices are equal, determined by a recursive traversal of each #successors.

• #ancestor?(other) ⇒ Boolean (also: #is_reachable_from?)

  Is there a path from ‘other` to `self` following edges in the dependency graph?.

• #hash ⇒ Fixnum

  A hash for the vertex based upon its #name.

• #initialize(name, payload) ⇒ Vertex constructor

  Initializes a vertex with the given name and payload.

• #inspect ⇒ String

  A string suitable for debugging.

• #path_to?(other) ⇒ Boolean (also: #descendent?)

  Is there a path from ‘self` to `other` following edges in the dependency graph?.

• #predecessors ⇒ Array<Vertex>

  The vertices of #graph that have an edge with ‘self` as their Edge#destination.

• #recursive_predecessors ⇒ Set<Vertex>

  The vertices of #graph where ‘self` is a #descendent?.

• #recursive_successors ⇒ Set<Vertex>

  The vertices of #graph where ‘self` is an #ancestor?.

• #requirements ⇒ Array<Object>

  All of the requirements that required this vertex.

• #shallow_eql?(other) ⇒ Boolean

  Whether the two vertices are equal, determined solely by #name and #payload equality.

• #successors ⇒ Array<Vertex>

  The vertices of #graph that have an edge with ‘self` as their Edge#origin.

Constructor Details

#initialize(name, payload) ⇒ Vertex

Initializes a vertex with the given name and payload.

# 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

Instance Attribute Details

#explicit_requirements ⇒ Array<Object> (readonly)

# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb', line 16

def explicit_requirements
  @explicit_requirements
end

#incoming_edges ⇒ Array<Edge>

# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb', line 45

def incoming_edges
  @incoming_edges
end

#name ⇒ String

# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb', line 9

def name
  @name
end

#outgoing_edges ⇒ Array<Edge>

# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb', line 41

def outgoing_edges
  @outgoing_edges
end

#payload ⇒ Object

# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb', line 12

def payload
  @payload
end

#root ⇒ Boolean Also known as: root?

# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb', line 19

def root
  @root
end

Instance Method Details

#==(other) ⇒ Boolean Also known as: eql?

# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb', line 106

def ==(other)
  return true if equal?(other)
  shallow_eql?(other) &&
    successors.to_set == other.successors.to_set
end

#ancestor?(other) ⇒ Boolean Also known as: is_reachable_from?

Is there a path from ‘other` to `self` following edges in the dependency graph?

# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb', line 151

def ancestor?(other)
  other.path_to?(self)
end

#hash ⇒ Fixnum

# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb', line 125

def hash
  name.hash
end

#inspect ⇒ String

# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb', line 100

def inspect
  "#{self.class}:#{name}(#{payload.inspect})"
end

#path_to?(other) ⇒ Boolean Also known as: descendent?

Is there a path from ‘self` to `other` following edges in the dependency graph?

# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb', line 132

def path_to?(other)
  _path_to?(other)
end

#predecessors ⇒ Array<Vertex>

# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb', line 49

def predecessors
  incoming_edges.map(&:origin)
end

#recursive_predecessors ⇒ Set<Vertex>

# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb', line 55

def recursive_predecessors
  _recursive_predecessors
end

#recursive_successors ⇒ Set<Vertex>

# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb', line 81

def recursive_successors
  _recursive_successors
end

#requirements ⇒ Array<Object>

# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb', line 35

def requirements
  (incoming_edges.map(&:requirement) + explicit_requirements).uniq
end

#shallow_eql?(other) ⇒ Boolean

# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb', line 115

def shallow_eql?(other)
  return true if equal?(other)
  other &&
    name == other.name &&
    payload == other.payload
end

#successors ⇒ Array<Vertex>

# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph/vertex.rb', line 75

def successors
  outgoing_edges.map(&:destination)
end