Class: Bundler::Molinillo::DependencyGraph::Vertex
- Inherits:
-
Object
- Object
- Bundler::Molinillo::DependencyGraph::Vertex
- Defined in:
- lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph.rb
Overview
A vertex in a Bundler::Molinillo::DependencyGraph that encapsulates a #name and a #payload
Instance Attribute Summary collapse
-
#explicit_requirements ⇒ Arrary<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 collapse
-
#==(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 ⇒ Array<Vertex>
The vertices of #graph where ‘self` is a #descendent?.
-
#recursive_successors ⇒ Array<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
-
#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.
192 193 194 195 196 197 198 |
# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph.rb', line 192 def initialize(name, payload) @name = name @payload = payload @explicit_requirements = [] @outgoing_edges = [] @incoming_edges = [] end |
Instance Attribute Details
#explicit_requirements ⇒ Arrary<Object> (readonly)
Returns the explicit requirements that required this vertex.
183 184 185 |
# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph.rb', line 183 def explicit_requirements @explicit_requirements end |
#incoming_edges ⇒ Array<Edge>
Returns the edges of #graph that have ‘self` as their Edge#destination.
212 213 214 |
# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph.rb', line 212 def incoming_edges @incoming_edges end |
#name ⇒ String
Returns the name of the vertex.
176 177 178 |
# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph.rb', line 176 def name @name end |
#outgoing_edges ⇒ Array<Edge>
Returns the edges of #graph that have ‘self` as their Edge#origin.
208 209 210 |
# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph.rb', line 208 def outgoing_edges @outgoing_edges end |
#payload ⇒ Object
Returns the payload the vertex holds.
179 180 181 |
# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph.rb', line 179 def payload @payload end |
#root ⇒ Boolean Also known as: root?
Returns whether the vertex is considered a root vertex.
186 187 188 |
# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph.rb', line 186 def root @root end |
Instance Method Details
#==(other) ⇒ Boolean Also known as: eql?
Returns whether the two vertices are equal, determined by a recursive traversal of each #successors.
251 252 253 254 |
# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph.rb', line 251 def ==(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?
284 285 286 |
# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph.rb', line 284 def ancestor?(other) other.path_to?(self) end |
#hash ⇒ Fixnum
Returns a hash for the vertex based upon its #name.
268 269 270 |
# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph.rb', line 268 def hash name.hash end |
#inspect ⇒ String
Returns a string suitable for debugging.
245 246 247 |
# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph.rb', line 245 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?
275 276 277 |
# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph.rb', line 275 def path_to?(other) equal?(other) || successors.any? { |v| v.path_to?(other) } end |
#predecessors ⇒ Array<Vertex>
Returns the vertices of #graph that have an edge with ‘self` as their Edge#destination.
216 217 218 |
# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph.rb', line 216 def predecessors incoming_edges.map(&:origin) end |
#recursive_predecessors ⇒ Array<Vertex>
Returns the vertices of #graph where ‘self` is a #descendent?.
222 223 224 225 226 227 |
# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph.rb', line 222 def recursive_predecessors vertices = predecessors vertices += vertices.map(&:recursive_predecessors).flatten(1) vertices.uniq! vertices end |
#recursive_successors ⇒ Array<Vertex>
Returns the vertices of #graph where ‘self` is an #ancestor?.
237 238 239 240 241 242 |
# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph.rb', line 237 def recursive_successors vertices = successors vertices += vertices.map(&:recursive_successors).flatten(1) vertices.uniq! vertices end |
#requirements ⇒ Array<Object>
Returns all of the requirements that required this vertex.
202 203 204 |
# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph.rb', line 202 def requirements incoming_edges.map(&:requirement) + explicit_requirements end |
#shallow_eql?(other) ⇒ Boolean
259 260 261 262 263 |
# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph.rb', line 259 def shallow_eql?(other) other && name == other.name && payload == other.payload end |
#successors ⇒ Array<Vertex>
Returns the vertices of #graph that have an edge with ‘self` as their Edge#origin.
231 232 233 |
# File 'lib/bundler/vendor/molinillo/lib/molinillo/dependency_graph.rb', line 231 def successors outgoing_edges.map(&:destination) end |