hierarchy-tree 0.3.4 → 0.3.5

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: ddb0de6ef3ff8b267337c4b212fb79cc61882daeabdeed87f24ed8c6e2cf57a2
-  data.tar.gz: 2f9edaf7700263b9cb0258c3b78254d2860d5483379898ddab7a05d9eefa0d09
+  metadata.gz: f05844c843379d26d0aa9bb076c0e0e12212992b39e289a3ec838478f365b273
+  data.tar.gz: be4a10778e5799065e9114422d74099b02d5ecd96fdde176376121a65555a7d9
 SHA512:
-  metadata.gz: a737550c58c67149a23afd9252bc5f357953c715b9a76274da6c6c6b599bdd5fa3a22bda025cbec8913ba48c7350d44a2fa384222533b7816fb8f385469fbd40
-  data.tar.gz: e2b5a61beed7165bb58e36edc90c86e27e0214fe85a27af2a2ea99cb3825c0c4916c8700b8b333d7fabf1431f0ba9eff4621f22c8afa3ec4fef4e6b4d6f9aeac
+  metadata.gz: 1802c4508846ee55aed45c163cf8ecb77fc1f1f0776094e91dd27794f6c366b97cf258f9351aec71c6e35f7647dcaaf6f1687f9e2c2853dcf753c16c0e036fd0
+  data.tar.gz: 6c7446063bf94384205133d78cc0a1fd9e3b24ced8b93572d552513b8868833f1d89953ae33718ebce1683b15eaddb957fdd8e4055319199b55fac863af6cb26

data/lib/hierarchy_tree.rb

@@ -3,9 +3,9 @@ require 'active_support/core_ext/object/inclusion.rb'
 
 ################ Debug ################
 # gem cleanup hierarchy-tree
-# rm hierarchy-tree-X.Y.Z.gem
+# rm hierarchy-tree-0.3.5.gem
 # gem build hierarchy_tree
-# gem install hierarchy-tree-X.Y.Z.gem
+# gem install hierarchy-tree-0.3.5.gem
 # ruby -Itest test/test_hierarchy_tree.rb
 
 class Hierarchy
@@ -26,6 +26,14 @@ class Hierarchy
     @classes_list
   end
 
+  # Return the array of children classes in a bottom up manner
+  # From leaf classes to upper classes
+  def self.bottom_up_classes(klass)
+    @classes_list = []
+    build_descendants(klass)
+    topological_sort([klass.to_s] + @classes_list)
+  end
+
   # Return all the possible ancestors associations by navigating through :belongs_to
   # Starting from the "from" class towards the "to" class
   def self.ancestors(from:, to:)
@@ -61,7 +69,7 @@ class Hierarchy
   # Return the ancestors associations by navigating through :belongs_to
   # Starting from the "from" class towards the "to" class
   # Using BFS - Breadth First Search, thus finding the Shortest Path
-  def self.ancestors_bfs(from:, to:)
+  def self.ancestors_bfs(from:, to:, classify: false)
     return if from == to
 
     queue = [{ class: from, path: [] }]
@@ -76,9 +84,14 @@ class Hierarchy
         next if relation.options[:polymorphic]
 
         next_class = relation.klass
-        next_path = current_path + [relation.name]
 
-        return hashify(next_path) if next_class.to_s == to.to_s
+        if classify # An array of classes
+          next_path = current_path + [relation.klass.to_s]
+          return next_path if next_class.to_s == to.to_s
+        else # A hash of associations
+          next_path = current_path + [relation.name]
+          return hashify(next_path) if next_class.to_s == to.to_s
+        end
 
         if visited.exclude?(next_class)
           visited << next_class
@@ -185,6 +198,27 @@ class Hierarchy
     true
   end
 
+  def self.topological_sort(classes)
+    dependencies = classes.to_h do |c|
+      [c, Hierarchy.ancestors_bfs(from: c.constantize, to: classes[0].constantize, classify: true)]
+    end
+
+    sorted_items = []
+    visited = {}
+
+    visit = lambda do |item|
+      unless visited[item]
+        visited[item] = true
+        dependencies[item]&.each { |dependency| visit.call(dependency) }
+        sorted_items.unshift(item)
+      end
+    end
+
+    classes.each { |item| visit.call(item) unless visited[item] }
+
+    sorted_items
+  end
+
   def self.hashify(array)
     if array.length == 1
       array.first

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: hierarchy-tree
 version: !ruby/object:Gem::Version
-  version: 0.3.4
+  version: 0.3.5
 platform: ruby
 authors:
 - Victor Cordeiro Costa
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2023-10-26 00:00:00.000000000 Z
+date: 2023-11-21 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: minitest