slow removing ancestor(y) references

goal is to have all methods relative to ancestor_ids

if possible names will contain ancestor_ids

then, we may be able to configure this to have multiple parents

lib/ancestry/has_ancestry.rb

@@ -83,8 +83,8 @@ def has_ancestry options = {}
           self.counter_cache_column = options[:counter_cache]
         end
 
-        after_create :increase_parent_counter_cache, if: :has_parent?
-        after_destroy :decrease_parent_counter_cache, if: :has_parent?
+        after_create :increase_parent_counter_cache, if: :ancestor_ids?
+        after_destroy :decrease_parent_counter_cache, if: :ancestor_ids?
         after_update :update_parent_counter_cache
       end
 

lib/ancestry/instance_methods.rb

@@ -92,11 +92,13 @@ def _counter_cache_column
 
     # Ancestors
 
-    def ancestors?
+    # when field is removed, this will end up back at ancestors
+    def ancestor_ids?
       ancestor_ids.present?
     end
-    alias :has_parent? :ancestors?
-    alias :parent_id? :ancestors?
+    alias :ancestors? :ancestor_ids?
+    alias :has_parent? :ancestor_ids?
+    alias :parent_id? :ancestor_ids?
 
     def will_save_change_to_ancestor_ids?
       column = self.ancestry_base_class.ancestry_column.to_s

lib/ancestry/materialized_path.rb

@@ -82,7 +82,7 @@ def ordered_by_ancestry_and(order)
     module InstanceMethods
       # private (public so class methods can find it)
       # The ancestry value for this record's children (before save)
-      # This is technically child_ancestor_ids_was
+      # This is technically child_ancestor_ids_in_database
       def child_ancestor_ids
         # New records cannot have children
         raise Ancestry::AncestryException.new(I18n.t("ancestry.no_child_for_new_record")) if new_record?

test/concerns/tree_navigation_test.rb

@@ -13,7 +13,7 @@ def test_tree_navigation
         # Parent assertions
         assert_nil lvl0_node.parent_id
         assert_nil lvl0_node.parent
-        refute lvl0_node.parent_id?
+        refute lvl0_node.has_parent?
         # Root assertions
         assert_equal lvl0_node.id, lvl0_node.root_id
         assert_equal lvl0_node, lvl0_node.root
@@ -53,7 +53,7 @@ def test_tree_navigation
           # Parent assertions
           assert_equal lvl0_node.id, lvl1_node.parent_id
           assert_equal lvl0_node, lvl1_node.parent
-          assert lvl1_node.parent_id?
+          assert lvl1_node.has_parent?
           # Root assertions
           assert_equal lvl0_node.id, lvl1_node.root_id
           assert_equal lvl0_node, lvl1_node.root
@@ -93,7 +93,7 @@ def test_tree_navigation
             # Parent assertions
             assert_equal lvl1_node.id, lvl2_node.parent_id
             assert_equal lvl1_node, lvl2_node.parent
-            assert lvl2_node.parent_id?
+            assert lvl2_node.has_parent?
             # Root assertions
             assert_equal lvl0_node.id, lvl2_node.root_id
             assert_equal lvl0_node, lvl2_node.root