dependency-trees 0.0.4 → 0.0.5

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: a95942acda2903ecafc6c223b9e8c5716e171b793555f35e4e55c06bee826896
-  data.tar.gz: 8bff4a9cb8a3d22beabcec9c13c5f376743b50e59c58b9b4af96e102150388f4
+  metadata.gz: d7bece88844a0b550c9d20a760c4117baf3855b23691d6cf2587b93826468ed4
+  data.tar.gz: 16a7a5f35a91a69189e84f89a00bb48c9f60fc1ca22ac5ab54b33086c3b19b89
 SHA512:
-  metadata.gz: 391abe1bc060f9903662e9018541bc56c570f32bc7ad36ca92415269cf1034661a5a585e05c995ea2aa0bd551ab0ef887a4b16caf2296e61ec6b20d703799b56
-  data.tar.gz: 804a67f7345afd4a70fc34569c3ddd52d497d718cb74dd0fcf482867ce834ea3ef13183fe5bd62f61ee714a860fc0a783e0fbb78219ff43d7e1cf199a7f427f9
+  metadata.gz: c22a3aca65a95892ee610ed02a8675b7f80eb04da6f2983e2fce6f4eb9c4acc61e91da06d14ebe5d8448fd377ffe92204fe9bb6f73db637c5874aec8fc2b0632
+  data.tar.gz: c4f58e0936b57cc19f286f3f43fd70c5be86eed731ef08b498abd88a4f523ab3763172393ad77f2ab4e279e7570fbf12e87f76d0d3c7250be02d488fc42bd0a1

data/dependency-trees.gemspec

@@ -1,6 +1,6 @@
 Gem::Specification.new do |s|
   s.name                  = 'dependency-trees'
-  s.version               = '0.0.4'
+  s.version               = '0.0.5'
   s.summary               = 'Tool for better visualizing and managing dependencies'
   s.authors               = ['Karol Selak']
   s.required_ruby_version = Gem::Requirement.new(">= 2.3.0")

data/lib/dependency-trees.rb

@@ -1 +1,5 @@
-require 'ids_of_all_dependencies.rb'
+require 'dependency_tree'
+require 'ids_of_all_dependencies'
+require 'ids_of_all_dependencies_nested'
+require 'ids_of_all_direct_dependencies'
+require 'nullify_dependencies'

data/lib/dependency_tree.rb

@@ -0,0 +1,144 @@
+require 'id_hash'
+
+module DependencyTree
+  class Tree < Hash
+    def initialize(hash={})
+      hash.each do |key, value|
+        self[key] = value
+      end
+    end
+
+    def ids_tree
+      self_cloned = self.deep_tree_clone
+      self_cloned.delete_key_recursive(:instance)
+    end
+
+    def status_tree
+      self_cloned = self.deep_tree_clone
+
+      self_cloned.do_recursive do |tree|
+        begin
+          tree[:instance].reload
+          tree[:status] = 'present'
+        rescue ActiveRecord::RecordNotFound => e
+          tree[:status] = 'removed'
+        end
+
+        tree.delete(:instance)
+      end
+    end
+
+    def status_tree_condensed
+      result = status_tree.do_recursive do |tree|
+        tree.each do |name, array|
+          next unless array.class == Array
+
+          new_array = array.map do |subtree|
+            next subtree.root_duplicate_summary if subtree[:duplicate]
+            next subtree if subtree.class != Tree || subtree.size > 2
+
+            subtree.root_summary
+          end
+
+          array.clear
+          array.concat(new_array)
+        end
+      end
+
+      result.do_recursive do |tree|
+        tree[:_] = tree.root_summary
+        tree.delete(:id)
+        tree.delete(:status)
+        tree.delete(:class)
+        tree.last_to_beginning!
+      end
+    end
+
+    def last_to_beginning!
+      arr = self.to_a
+      arr.unshift(arr.pop)
+      self.clear
+      self.merge!(arr.to_h)
+    end
+
+    def root_summary
+      "#{self[:class]}, id #{self[:id]}, #{self[:status]}"
+    end
+
+    def root_duplicate_summary
+      root_summary + ", duplicate"
+    end
+
+    def deep_tree_clone
+      hash = self.clone.map do |key, array|
+        next [key, array] unless array.class == Array
+
+        new_array = array.map do |subtree|
+          if subtree.class == Tree
+            subtree.deep_tree_clone
+          else
+            subtree
+          end
+        end
+
+        [key, new_array]
+      end
+
+      Tree.new(hash)
+    end
+
+    def delete_key_recursive(key)
+      call_method_recursive(:delete, key)
+    end
+
+    def call_method_recursive(method, *args, &block)
+      do_recursive do |tree|
+        tree.send(method, *args, &block)
+      end
+    end
+
+    def do_recursive(&block)
+      block.call(self)
+
+      self.each do |key, array|
+        next unless array.is_a? Array
+
+        array.each do |subtree|
+          subtree.do_recursive(&block) if subtree.is_a? Tree
+        end
+      end
+
+      self
+    end
+  end
+
+  def dependency_tree(depth = Float::INFINITY, hash_for_duplication_check = IdHash.new)
+    is_duplicate = hash_for_duplication_check[self.class]&.include?(id)
+    hash_for_duplication_check.add(self.class, id)
+    shoud_go_deeper = depth > 0 && !is_duplicate
+    result = shoud_go_deeper ? get_associations_for_tree(depth, hash_for_duplication_check) : Tree.new
+    result[:id] = id
+    result[:instance] = self
+    result[:duplicate] = true if is_duplicate
+    result
+  end
+
+  private
+
+  def get_associations_for_tree(depth, hash_for_duplication_check)
+    result = Tree.new
+
+    self.class.reflect_on_all_associations.map do |association|
+      next if association.macro == :belongs_to
+
+      symbol = association.name
+      self.send(association.name).sort_by(&:id).map do |associated_object|
+        result[symbol] = [] if result[symbol].nil?
+        result[symbol] << associated_object.dependency_tree(depth - 1, hash_for_duplication_check)
+        result[:class] = association.klass.name.underscore.to_sym
+      end
+    end
+
+    result
+  end
+end

data/lib/ids_of_all_dependencies.rb

@@ -1,206 +1,9 @@
 require 'id_hash'
 
-module SymbolsOfAllDirectDependencies
-  def symbols_of_all_direct_dependencies
-    self.class.reflect_on_all_associations.map do |association|
-      next if association.macro == :belongs_to
-
-      association.name
-    end.compact
-  end
-end
-
-module IdsOfAllDirectDependencies
-  include SymbolsOfAllDirectDependencies
-
-  def ids_of_all_direct_dependencies
-    result = IdHash.new
-
-    self.class.reflect_on_all_associations.map do |association|
-      next if association.macro == :belongs_to
-
-      symbol = association.klass.name.underscore.to_sym
-      self.send(association.name).map do |associated_object|
-        result.add(symbol, associated_object.id)
-      end
-    end
-
-    result
-  end
-end
-
-module IdsOfAllDependenciesNested
-  def ids_of_all_dependencies_nested(depth = Float::INFINITY)
-    result = depth > 0 ? get_associations(depth) : {}
-    result[:id] = id
-    result = result[:id] if result.size == 1
-    result
-  end
-
-  private
-
-  def get_associations(depth)
-    result = {}
-
-    self.class.reflect_on_all_associations.map do |association|
-      next if association.macro == :belongs_to
-
-      symbol = association.klass.name.underscore.to_sym
-      self.send(association.name).sort_by(&:id).map do |associated_object|
-        result[symbol] = [] if result[symbol].nil?
-        result[symbol] << associated_object.ids_of_all_dependencies_nested(depth - 1)
-      end
-    end
-
-    result
-  end
-end
-
-module DependencyTree
-  class Tree < Hash
-    def initialize(hash={})
-      hash.each do |key, value|
-        self[key] = value
-      end
-    end
-
-    def ids_tree
-      self_cloned = self.deep_tree_clone
-      self_cloned.delete_key_recursive(:instance)
-    end
-
-    def status_tree
-      self_cloned = self.deep_tree_clone
-
-      self_cloned.do_recursive do |tree|
-        begin
-          tree[:instance].reload
-          tree[:status] = 'present'
-        rescue ActiveRecord::RecordNotFound => e
-          tree[:status] = 'removed'
-        end
-
-        tree.delete(:instance)
-      end
-    end
-
-    def status_tree_condensed
-      result = status_tree.do_recursive do |tree|
-        tree.each do |name, array|
-          next unless array.class == Array
-
-          new_array = array.map do |subtree|
-            next subtree.root_duplicate_summary if subtree[:duplicate]
-            next subtree if subtree.class != Tree || subtree.size > 2
-
-            subtree.root_summary
-          end
-
-          array.clear
-          array.concat(new_array)
-        end
-      end
-
-      result.do_recursive do |tree|
-        tree[:_] = tree.root_summary
-        tree.delete(:id)
-        tree.delete(:status)
-        tree.last_to_beginning!
-      end
-    end
-
-    def last_to_beginning!
-      arr = self.to_a
-      arr.unshift(arr.pop)
-      self.clear
-      self.merge!(arr.to_h)
-    end
-
-    def root_summary
-      "id #{self[:id]}, #{self[:status]}"
-    end
-
-    def root_duplicate_summary
-      root_summary + ", duplicate"
-    end
-
-    def deep_tree_clone
-      hash = self.clone.map do |key, array|
-        next [key, array] unless array.class == Array
-
-        new_array = array.map do |subtree|
-          if subtree.class == Tree
-            subtree.deep_tree_clone
-          else
-            subtree
-          end
-        end
-
-        [key, new_array]
-      end
-
-      Tree.new(hash)
-    end
-
-    def delete_key_recursive(key)
-      call_method_recursive(:delete, key)
-    end
-
-    def call_method_recursive(method, *args, &block)
-      do_recursive do |tree|
-        tree.send(method, *args, &block)
-      end
-    end
-
-    def do_recursive(&block)
-      block.call(self)
-
-      self.each do |key, array|
-        next unless array.is_a? Array
-
-        array.each do |subtree|
-          subtree.do_recursive(&block) if subtree.is_a? Tree
-        end
-      end
-
-      self
-    end
-  end
-
-  def dependency_tree(depth = Float::INFINITY, hash_for_duplication_check = IdHash.new)
-    is_duplicate = hash_for_duplication_check[self.class]&.include?(id)
-    hash_for_duplication_check.add(self.class, id)
-    shoud_go_deeper = depth > 0 && !is_duplicate
-    result = shoud_go_deeper ? get_associations_for_tree(depth, hash_for_duplication_check) : Tree.new
-    result[:id] = id
-    result[:instance] = self
-    result[:duplicate] = true if is_duplicate
-    result
-  end
-
-  private
-
-  def get_associations_for_tree(depth, hash_for_duplication_check)
-    result = Tree.new
-
-    self.class.reflect_on_all_associations.map do |association|
-      next if association.macro == :belongs_to
-
-      symbol = association.klass.name.underscore.to_sym
-      self.send(association.name).sort_by(&:id).map do |associated_object|
-        result[symbol] = [] if result[symbol].nil?
-        result[symbol] << associated_object.dependency_tree(depth - 1, hash_for_duplication_check)
-      end
-    end
-
-    result
-  end
-end
-
 module IdsOfAllDependencies
-  include IdsOfAllDependenciesNested
-  include IdsOfAllDirectDependencies
-  include DependencyTree
+  def self.get_model(name)
+    self.subclasses.find{ |m| m.name == name.to_s.camelcase }
+  end
 
   def ids_of_all_dependencies(to_filter=nil, filtering_strategy=:with_parents)
     ids_of_all_dependencies_with_filtered(to_filter, filtering_strategy)[:main]
@@ -302,7 +105,7 @@ module IdsOfAllDependencies
   def move_wrongly_assigned_to_main(to_filter, id_hash)
     id_hash[:filtered_out].each do |model_symbol, array|
       array.clone.each do |id|
-        object = Model.get_model(model_symbol).find(id)
+        object = self.class.get_model(model_symbol).find(id)
         move_object_to_main_if_necessary(to_filter[model_symbol], id_hash, object)
       end
     end

data/lib/ids_of_all_dependencies_nested.rb

@@ -0,0 +1,26 @@
+module IdsOfAllDependenciesNested
+  def ids_of_all_dependencies_nested(depth = Float::INFINITY)
+    result = depth > 0 ? get_associations(depth) : {}
+    result[:id] = id
+    result = result[:id] if result.size == 1
+    result
+  end
+
+  private
+
+  def get_associations(depth)
+    result = {}
+
+    self.class.reflect_on_all_associations.map do |association|
+      next if association.macro == :belongs_to
+
+      symbol = association.klass.name.underscore.to_sym
+      self.send(association.name).sort_by(&:id).map do |associated_object|
+        result[symbol] = [] if result[symbol].nil?
+        result[symbol] << associated_object.ids_of_all_dependencies_nested(depth - 1)
+      end
+    end
+
+    result
+  end
+end

data/lib/ids_of_all_direct_dependencies.rb

@@ -0,0 +1,18 @@
+require 'id_hash'
+
+module IdsOfAllDirectDependencies
+  def ids_of_all_direct_dependencies
+    result = IdHash.new
+
+    self.class.reflect_on_all_associations.map do |association|
+      next if association.macro == :belongs_to
+
+      symbol = association.klass.name.underscore.to_sym
+      self.send(association.name).map do |associated_object|
+        result.add(symbol, associated_object.id)
+      end
+    end
+
+    result
+  end
+end

data/lib/nullify_dependencies.rb

@@ -0,0 +1,50 @@
+# frozen_string_literal: true
+
+module NullifyDependencies
+  def nullify_dependencies(dependencies_symbols_to_nullify)
+    dependencies_symbols_to_nullify.map do |symbol|
+      dependencies = self.send(symbol) # e.g. build.tags_for_that_this_build_is_last
+
+      dependencies.map do |entry|
+        foreign_key = self.class.reflect_on_association(symbol).foreign_key.to_sym
+        entry.update(foreign_key => nil) # e.g. tag.update(last_build_id: nil)
+        {
+          related_table: entry.class.table_name,
+          foreign_key: foreign_key,
+          parent_id: self.id,
+          related_id: entry.id
+        }
+      end
+    end.flatten
+  end
+  
+  def nullify_all_dependencies
+    nullify_dependencies(symbols_of_all_direct_dependencies)
+  end
+
+  def nullify_default_dependencies
+    nullify_dependencies(default_dependencies_symbols_to_nullify)
+  end
+
+  def default_dependencies_symbols_to_nullify
+    self.class.default_dependencies_symbols_to_nullify
+  end
+
+  def self.default_dependencies_symbols_to_nullify
+    raise "self.default_dependencies_symbols_to_nullify not implemented in the #{self.class} class"
+  end
+
+  def default_dependencies_to_nullify
+    default_dependencies_symbols_to_nullify.map do |symbol|
+      self.send(symbol).to_a
+    end.flatten(1)
+  end
+
+  def symbols_of_all_direct_dependencies
+    self.class.reflect_on_all_associations.map do |association|
+      next if association.macro == :belongs_to
+
+      association.name
+    end.compact
+  end
+end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: dependency-trees
 version: !ruby/object:Gem::Version
-  version: 0.0.4
+  version: 0.0.5
 platform: ruby
 authors:
 - Karol Selak
@@ -215,10 +215,16 @@ files:
 - Gemfile
 - dependency-trees-0.0.1.gem
 - dependency-trees-0.0.2.gem
+- dependency-trees-0.0.3.gem
+- dependency-trees-0.0.4.gem
 - dependency-trees.gemspec
 - lib/dependency-trees.rb
+- lib/dependency_tree.rb
 - lib/id_hash.rb
 - lib/ids_of_all_dependencies.rb
+- lib/ids_of_all_dependencies_nested.rb
+- lib/ids_of_all_direct_dependencies.rb
+- lib/nullify_dependencies.rb
 homepage: 
 licenses:
 - MIT