dependz 0.0.1 → 0.1.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 2d5f3e96944577b4d8351f07bcc7c211512882b86eed15fc6bf8a002fc51e101
-  data.tar.gz: d5abc3939a18b2e432ff644060d6f99ef325c8b08e34675ebfb057e0b323beb5
+  metadata.gz: ba1ff616b07b924ecd59632333c81870cd3fce36f47298518680c3dd02c7813a
+  data.tar.gz: ab5a62a85de8b63999037543f34ffb19530d45e36294ac7a1c9630ffb7de4bf9
 SHA512:
-  metadata.gz: 2ef84921a4dfe830971bf9c1808306bba3ef59d142a2f39e689ad0985fe0ae1f8a8ed8254b158f051fa7fc73a50da5a7d82002c2203e3679357a91d028af04ef
-  data.tar.gz: 56a02358759536311fd169792fc5e1533d58a0bd97c6899508c24f17feb832a5447746d0b0a7b52a558996bc638066ae2f4089b0cc0f9d4b419661a878086402
+  metadata.gz: 1373b544c115690a4d486fa36ec8f589721c972e27c4fc9a1a82e152be93b2a642b6409c753db05a38ba97f83b4c346c7ab6b75869196d715a8c29cc1b51a69f
+  data.tar.gz: 7a9595047c8a975b60acbfed1f780f6c889b6132cbd9b8dea466a5484b422e657f14e39e58fd9698be2f237cff6f84366f1d5034bdd6899cfdb7e44a63a4051f

data/lib/dependz.rb

@@ -3,25 +3,18 @@
 require 'rgl/adjacency'
 require 'rgl/topsort'
 
-class Dependz
-  class CircularDependenceError < StandardError; end
-
-  def initialize
-    @dag = RGL::DirectedAdjacencyGraph.new
-  end
-
-  def add(depends_by:, depends_on:)
-    new_dag = @dag.dup
-    new_dag.add_edge(depends_by, depends_on)
-
-    raise CircularDependenceError unless new_dag.cycles.empty?
-
-    @dag = new_dag
-
-    self
-  end
-
-  def sort
-    @dag.topsort_iterator.to_a.reverse
+require 'dependz/add'
+require 'dependz/base'
+require 'dependz/sort_item'
+require 'dependz/list'
+require 'dependz/sort_level'
+
+module Dependz
+  class Client
+    include Base
+    include Add
+    include SortItem
+    include List
+    include SortLevel
   end
 end

data/lib/dependz/add.rb

@@ -0,0 +1,33 @@
+# frozen_string_literal: true
+
+module Dependz
+  class CircularDependenceError < StandardError; end
+
+  module Add
+    def add(depend_by:, depend_on:)
+      forms = depend_by.is_a?(Array) ? depend_by : [depend_by]
+      tos = depend_on.is_a?(Array) ? depend_on : [depend_on]
+
+      forms.each do |from|
+        tos.each do |to|
+          add_dependency(from, to)
+        end
+      end
+
+      self
+    end
+
+    private
+
+    def add_dependency(from, to)
+      new_dag = @dag.dup
+      new_dag.add_edge(from, to)
+
+      raise CircularDependenceError unless new_dag.cycles.empty?
+
+      @dag = new_dag
+
+      self
+    end
+  end
+end

data/lib/dependz/base.rb

@@ -0,0 +1,11 @@
+# frozen_string_literal: true
+
+module Dependz
+  module Base
+    attr_reader :dag
+
+    def initialize
+      @dag = RGL::DirectedAdjacencyGraph.new
+    end
+  end
+end

data/lib/dependz/list.rb

@@ -0,0 +1,14 @@
+# frozen_string_literal: true
+
+module Dependz
+  module List
+    def list
+      dag.edges.map do |edge|
+        {
+          depend_by: edge.to_a[0],
+          depend_on: edge.to_a[1]
+        }
+      end
+    end
+  end
+end

data/lib/dependz/sort_item.rb

@@ -0,0 +1,9 @@
+# frozen_string_literal: true
+
+module Dependz
+  module SortItem
+    def sort_item
+      dag.topsort_iterator.to_a.reverse
+    end
+  end
+end

data/lib/dependz/sort_level.rb

@@ -0,0 +1,54 @@
+# frozen_string_literal: true
+
+require 'rgl/traversal'
+
+module Dependz
+  module SortLevel
+    def sort_level
+      @level_map = {}
+
+      roots(dag).each do |root|
+        @level = 0
+        visitor = dfs_visitor(dag)
+        dag.reverse.depth_first_visit(root, visitor) { |x| }
+      end
+
+      @level_map.each_with_object([]) do |item_with_level, result|
+        item  = item_with_level[0]
+        level = item_with_level[1] - 1
+
+        if result[level].nil?
+          result[level] = [item]
+        else
+          result[level].push(item)
+        end
+      end
+    end
+
+    private
+
+    def dfs_visitor(dag)
+      RGL::DFSVisitor.new(dag.reverse).tap do |visitor|
+        visitor.set_examine_vertex_event_handler do |v|
+          @level += 1
+          if @level_map[v].nil?
+            @level_map[v] = @level
+          else
+            @level_map[v] = @level if @level_map[v] < @level
+          end
+        end
+
+        visitor.set_finish_vertex_event_handler do |_v|
+          @level -= 1
+        end
+      end
+    end
+
+    def roots(_dag)
+      depend_ons = list.map { |d| d[:depend_on] }.uniq
+      depend_bys = list.map { |d| d[:depend_by] }.uniq
+
+      depend_ons.reject { |head| depend_bys.include?(head) }
+    end
+  end
+end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: dependz
 version: !ruby/object:Gem::Version
-  version: 0.0.1
+  version: 0.1.0
 platform: ruby
 authors:
 - Rundong Gao
@@ -24,14 +24,18 @@ dependencies:
     - - "~>"
       - !ruby/object:Gem::Version
         version: '0.5'
-description: Store dependencies in a graph struct, and sort them in topological order.
-  No dpends_by will come be before it's depends_on.
+description: Topoligical sorting for dependent relations
 email: asphinx423@gmail.com
 executables: []
 extensions: []
 extra_rdoc_files: []
 files:
 - lib/dependz.rb
+- lib/dependz/add.rb
+- lib/dependz/base.rb
+- lib/dependz/list.rb
+- lib/dependz/sort_item.rb
+- lib/dependz/sort_level.rb
 homepage: https://github.com/RundongGao/depends
 licenses:
 - MIT