dependz 0.1.0 → 0.1.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: ba1ff616b07b924ecd59632333c81870cd3fce36f47298518680c3dd02c7813a
-  data.tar.gz: ab5a62a85de8b63999037543f34ffb19530d45e36294ac7a1c9630ffb7de4bf9
+  metadata.gz: e21b5e4e8fdca0c6c7fa61925190624b2a1525cd91a98b51f24bc8fb01d21802
+  data.tar.gz: 56e0f76d74df8e7fea3fa77a8b581f5031efe9df235a32a28139f12246768566
 SHA512:
-  metadata.gz: 1373b544c115690a4d486fa36ec8f589721c972e27c4fc9a1a82e152be93b2a642b6409c753db05a38ba97f83b4c346c7ab6b75869196d715a8c29cc1b51a69f
-  data.tar.gz: 7a9595047c8a975b60acbfed1f780f6c889b6132cbd9b8dea466a5484b422e657f14e39e58fd9698be2f237cff6f84366f1d5034bdd6899cfdb7e44a63a4051f
+  metadata.gz: 9f13e19f30b940a67c2b55c338be23e687ea1bb12bc3cf1120ae8cc1eda38f74ed2daefc517c1295483599b45afe978c89fb6e412fdf4b41fdef0010d5f06a18
+  data.tar.gz: 1f7829d9f1c088e851e1ba25504265d6dec134ee61fade400d4173b14875292e80620489ae9202395901f5b9ebf6d6cec8a323add784fad0ed4d9c7769ffe3f2

data/lib/dependz.rb

@@ -7,7 +7,7 @@ require 'dependz/add'
 require 'dependz/base'
 require 'dependz/sort_item'
 require 'dependz/list'
-require 'dependz/sort_level'
+require 'dependz/sort_depth'
 
 module Dependz
   class Client
@@ -15,6 +15,6 @@ module Dependz
     include Add
     include SortItem
     include List
-    include SortLevel
+    include SortDepth
   end
 end

data/lib/dependz/sort_depth.rb

@@ -0,0 +1,60 @@
+# frozen_string_literal: true
+
+require 'rgl/traversal'
+
+module Dependz
+  module SortDepth
+    def sort_depth
+      depth_of_all_item = roots
+                          .map { |root| calculate_depth_from_root(dag, root) }
+                          .reduce { |acc, depths| acc.merge(depths) { |_key, a, b| [a, b].max } }
+
+      format(depth_of_all_item)
+    end
+
+    private
+
+    def format(depth_mapping)
+      depth_mapping.each_with_object([]) do |item_depth, result|
+        item  = item_depth[0]
+        depth = item_depth[1] - 1
+
+        if result[depth].nil?
+          result[depth] = [item]
+        else
+          result[depth].push(item)
+        end
+      end
+    end
+
+    def calculate_depth_from_root(dag, root)
+      @depth = 0
+      @depth_map = {}
+
+      visitor = dfs_visitor(dag)
+      dag.reverse.depth_first_visit(root, visitor) { |x| }
+
+      @depth_map
+    end
+
+    def dfs_visitor(dag)
+      RGL::DFSVisitor.new(dag.reverse).tap do |visitor|
+        visitor.set_examine_vertex_event_handler do |v|
+          @depth += 1
+          @depth_map[v] = @depth
+        end
+
+        visitor.set_finish_vertex_event_handler do |_v|
+          @depth -= 1
+        end
+      end
+    end
+
+    def roots
+      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.1.0
+  version: 0.1.2
 platform: ruby
 authors:
 - Rundong Gao
@@ -24,7 +24,8 @@ dependencies:
     - - "~>"
       - !ruby/object:Gem::Version
         version: '0.5'
-description: Topoligical sorting for dependent relations
+description: A ruby gem for concurrent tasks scheduling and resolving dependencies
+  based on directed acyclic graphs and modified topological sorting algorithm.
 email: asphinx423@gmail.com
 executables: []
 extensions: []
@@ -34,8 +35,8 @@ files:
 - lib/dependz/add.rb
 - lib/dependz/base.rb
 - lib/dependz/list.rb
+- lib/dependz/sort_depth.rb
 - lib/dependz/sort_item.rb
-- lib/dependz/sort_level.rb
 homepage: https://github.com/RundongGao/depends
 licenses:
 - MIT

data/lib/dependz/sort_level.rb

@@ -1,54 +0,0 @@
-# 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