WIP: fix revisit test case

Author: CBroz1

datajoint/table.py

@@ -512,6 +512,12 @@ def delete(
         deleted = set()
         visited_masters = set()
 
+        if force_masters and not force_parts:
+            logger.warn(
+                "force_masters=True implies force_parts=True. "
+                + "Ignoring force_parts=False."
+            )  # No need to reset, as force_masters will cascade to parts.
+
         def cascade(table):
             """service function to perform cascading deletes recursively."""
             max_attempts = 50

tests/schema_simple.py

@@ -125,18 +125,18 @@ class H(dj.Part):
         id_h :int
         """
 
-    class I(dj.Part): 
-        definition = """ # test force_masters revisit part
+    class M(dj.Part):
+        definition = """ # test force_masters revisit
         -> E
-        id_i :int
+        id_m :int
         ---
-        -> H
+        -> E.H
         """
 
     def make(self, key):
         random.seed(str(key))
         l_contents = list(L().fetch("KEY"))
-        part_f, part_g, part_h, part_i = E.F(), E.G(), E.H(), E.I()
+        part_f, part_g, part_h, part_m = E.F(), E.G(), E.H(), E.M()
         bc_references = list((B.C() & key).fetch("KEY"))
         random.shuffle(bc_references)
 
@@ -148,8 +148,9 @@ def make(self, key):
         )
         g_inserts = [dict(key, id_g=i, **ref) for i, ref in enumerate(l_contents)]
         part_g.insert(g_inserts)
-        part_h.insert(dict(key, id_h=i) for i in range(4))
-        part_i.insert(dict(key, id_i=i, **random.choice(g_inserts)) for i in range(4))
+        h_inserts = [dict(key, id_h=i) for i in range(4)]
+        part_h.insert(h_inserts)
+        part_m.insert(dict(key, id_i=i, **random.choice(h_inserts)) for i in range(4))
 
 
 class F(dj.Manual):