beckermj/vaguerent
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Remove implementations no longer required

Browse Source
This commit is contained in:
Chris Roberts 2021-10-22 16:09:53 -07:00 committed by Paul Hinze
parent 481d7185a7
commit d1974d9a00
No known key found for this signature in database
GPG Key ID: B69DEDF2D55501C0
3 changed files with 0 additions and 127 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
plugins/commands/serve/mappers/internal.rb
View File

@ -3,7 +3,6 @@ module VagrantPlugins
class Mappers
module Internal
autoload :Graph, Vagrant.source_root.join("plugins/commands/serve/mappers/internal/graph").to_s
autoload :Stack, Vagrant.source_root.join("plugins/commands/serve/mappers/internal/stack").to_s
end
end
end

81
plugins/commands/serve/mappers/internal/graph/topological.rb
View File

@ -1,81 +0,0 @@
module VagrantPlugins
module CommandServe
class Mappers
module Internal
class Graph
# Provides topological sorting of a Graph
class Topological
class NoRootError < StandardError; end
class CycleError < StandardError; end
attr_reader :graph
# Create a new topological sorting instance
#
# @param graph [Graph] Graph used for sorting
def initialize(graph:)
@graph = graph.copy
@m = Mutex.new
end
# Generate a topological sorted path of the defined
# graph.
#
# @return [Array<Vertex>]
# @raises [NoRootError, CycleError]
def sort
@m.synchronize do
s = Stack.new
graph.vertices.each do |v|
s.push(v) if graph.edges_in(v).size < 1
end
if s.size < 1
raise NoRootError,
"graph does not contain any root vertices"
end
kahn(s)
end
end
protected
# Sort the graph vertices using Kahn's algorithm
#
# @param s [Stack] Stack to hold vertices
# @return [Array<Vertex>]
# @raises [CycleError]
def kahn(s)
p = Queue.new
while s.size > 0
v = s.pop
p.push(v)
graph.edges_out(v).each do |next_v|
graph.remove_edge(v, next_v)
if graph.edges_in(next_v).size < 1
s.push(next_v)
end
end
end
graph.vertices.each do |v|
if graph.edges_in(v).size > 1 || graph.edges_out(v).size > 1
raise CycleError,
"graph contains at least one cycle"
end
end
Array.new.tap do |path|
while p.size > 0
path << p.pop
end
end
end
end
end
end
end
end
end

45
plugins/commands/serve/mappers/internal/stack.rb
View File

@ -1,45 +0,0 @@
module VagrantPlugins
module CommandServe
class Mappers
module Internal
# Simple stack implementation
class Stack
def initialize
@data = []
@m = Mutex.new
end
def include?(v)
@m.synchronize do
@data.include?(v)
end
end
def pop
@m.synchronize do
@data.pop
end
end
def push(v)
@m.synchronize do
@data.push(v)
end
end
def size
@m.synchronize do
@data.size
end
end
def values
@m.synchronize do
@data.dup
end
end
end
end
end
end
end