hierarchy-tree 0.2.0 → 0.3.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 5c2620a107d595da64c5854efec9c90f4ebada54e79ea851e35cd698dd31cb7e
-  data.tar.gz: 3957eb61b1debe9dcff8049d89947a60b594b348f3e65b31f25615d4bb56a8de
+  metadata.gz: 6644c370fbd994c645135ec56cd7aa19c6586cf7da38136e929b1bac2edd0ddf
+  data.tar.gz: 938f28a4313baa9ba0dabfdbfed06dd32022fbf79177b2bbdf537233593d15ee
 SHA512:
-  metadata.gz: cfe0cdf719a378c501ac89db2df73349f9af3b131c39947e0ad3b9126032ca2898997fad85f4ae532b30fa11062e84fbc339c5a7d6e2cd7f092d486426a84040
-  data.tar.gz: 0b3677fe95dd795eb1ba93671e9878df59e712d4378c0a638cb62765f7bc49fef2e8ab8e91133934723afb2b91149a6984b25353d383911d7d516bd6539dd9bf
+  metadata.gz: 4e3f81dad78bfb864c73153cdebfb2ad3978f1caa70ad2996c2125ce7d88fd2ecf4a362e6c2920877f7e23cfe129f51055f0f945e647392c8f66d69ac3b5c67e
+  data.tar.gz: 790d3534a9798da8fea30a5d44252e57f6d5f00f3fbdac7700502a3c2860a2427e9b97594a926c32cab800eaa3b2d86df8107ab5d675fcb48bd3274ed330bf4c

data/lib/hierarchy_tree.rb

@@ -2,29 +2,104 @@ require 'active_record'
 require 'active_support/core_ext/object/inclusion.rb'
 
 ################ Debug ################
-# rm hierarchy-tree-X.Y.Z.gem
+# gem cleanup hierarchy-tree
+# rm hierarchy-tree-0.3.1.gem
 # gem build hierarchy_tree
-# gem install hierarchy-tree-X.Y.Z.gem
+# gem install hierarchy-tree-0.3.1.gem
 # ruby -Itest test/test_hierarchy_tree.rb
 
 class Hierarchy
-  # Return the full hierarchy starting from the provided class
+  # Return the full hierarchy as associations starting from the provided class
   def self.associations(klass)
     build_hierarchy(class: klass)
   end
 
-  # Return the full hierarchy starting from the provided class
+  # Return the full hierarchy as classes starting from the provided class
   def self.classes(klass)
     build_hierarchy(class: klass, classes?: true)
   end
 
-  # Return an array o
+  # Return the array of children classes
   def self.classes_list(klass)
     @classes_list = []
     build_descendants(klass)
     @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:)
+    return [] if from.to_s == to.to_s
+
+    queue = [{ class: from.to_s, path: [] }]
+    visited = { from.to_s => [] }
+    paths = []
+
+    while queue.any?
+      current = queue.shift
+      current_class = current[:class]
+      current_path = current[:path]
+
+      current_class.constantize.reflect_on_all_associations(:belongs_to).each do |relation|
+        next_class = relation.klass.to_s
+        next_path = current_path + [relation.name]
+
+        paths << hashify(next_path) if next_class == to.to_s
+
+        if next_path == next_path.uniq # Non-looped path
+          visited[next_class] = next_path
+          queue.push({ class: next_class, path: next_path })
+        end
+      end
+    end
+
+    paths
+  end
+
+  # 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:)
+    return if from == to
+
+    queue = [{ class: from, path: [] }]
+    visited = [from]
+
+    while queue.any?
+      current = queue.shift
+      current_class = current[:class]
+      current_path = current[:path]
+
+      current_class.reflect_on_all_associations(:belongs_to).each do |relation|
+        next_class = relation.klass
+        next_path = current_path + [relation.name]
+
+        return hashify(next_path) if next_class.to_s == to.to_s
+
+        if visited.exclude?(next_class)
+          visited << next_class
+          queue.push({ class: next_class, path: next_path })
+        end
+      end
+    end
+  end
+
+  # Return the ancestors associations by navigating through :belongs_to
+  # Starting from the "from" class towards the "to" class
+  # Using DFS - Depth First Search, thus finding the Deepest Path (more likely)
+  def self.ancestors_dfs(from:, to:, descendants: [])
+    return if from.to_s == to.to_s and descendants == [] # Base case
+    return 'loop' if from.in? descendants # Avoids cycle
+
+    descendants.push(from)
+
+    from.reflect_on_all_associations(:belongs_to).map do |relation|
+      return relation.name if relation.klass.to_s == to.to_s # Path is found
+      path = ancestors_dfs(from: relation.klass, to: to, descendants: descendants)
+      return { relation.name => path } if valid_path?(path, to.model_name.param_key.to_sym)
+    end.compact.first
+  end
+
   def self.loop?(klass)
     @cache = {}
     false if dfs_hierarchy(class: klass, classes?: false)
@@ -105,4 +180,25 @@ class Hierarchy
     end
     true
   end
+
+  def self.hashify(array)
+    if array.length == 1
+      array.first
+    else
+      { array.first => hashify(array.drop(1)) }
+    end
+  end
+
+  def self.valid_path?(path, target)
+    return true if path == target
+
+    case path
+    when Array
+      path.any? { |sub_path| valid_path?(sub_path, target) }
+    when Hash
+      path.values.any? { |value| valid_path?(value, target) }
+    else
+      false
+    end
+  end
 end

metadata

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