Mark a possible bug as TODO to fix

Technologicat · Technologicat · commit a7da8e326a70 · 2019-10-30T22:48:36.000+02:00
diff --git a/unpythonic/syntax/letdo.py b/unpythonic/syntax/letdo.py
@@ -301,6 +301,7 @@ def find_deletes(tree, collect, **kw):
     names = []
     lines = []
     for j, expr in enumerate(tree.elts, start=1):
+        # TODO: do we need the recursion here? Won't this trigger false positives for nested do[] expressions?
         expr, newnames = find_localdefs.recurse_collect(expr)
         expr, deletednames = find_deletes.recurse_collect(expr)
         assert not (newnames and deletednames), "a do-item may have only local[] or delete[], not both"
