autopep8

Technologicat · Technologicat · commit 2f30d2cd0529 · 2020-02-22T00:51:07.000+02:00
diff --git a/unpythonic/llist.py b/unpythonic/llist.py
@@ -144,22 +144,26 @@ def walker(head):
 class BinaryTreeIterator(ConsIterator):
     """Iterator for binary trees built from cons cells."""
     def __init__(self, root):
-#        def walker(cell):  # FP, call stack overflow for deep trees
-#            for x in (cell.car, cell.cdr):
-#                if isinstance(x, cons):
-#                    yield from walker(x)
-#                else:
-#                    yield x
+        #        def walker(cell):  # FP, call stack overflow for deep trees
+        #            for x in (cell.car, cell.cdr):
+        #                if isinstance(x, cons):
+        #                    yield from walker(x)
+        #                else:
+        #                    yield x
         def walker(cell):  # imperative, no call stack overflow (we keep our own data stack instead)
             stack = [cell]
             while stack:
                 cell = stack.pop()
                 a, d = cell.car, cell.cdr
                 ac, dc = isinstance(a, cons), isinstance(d, cons)
-                if not ac: yield a
-                if not dc: yield d
-                if dc: stack.append(d)
-                if ac: stack.append(a)  # LIFO
+                if not ac:
+                    yield a
+                if not dc:
+                    yield d
+                if dc:
+                    stack.append(d)
+                if ac:
+                    stack.append(a)  # LIFO
         super().__init__(root, walker)
 
 class JackOfAllTradesIterator(ConsIterator):
@@ -180,26 +184,30 @@ class JackOfAllTradesIterator(ConsIterator):
     the specific kind of cons structure you have.
     """
     def __init__(self, root):
-#        @gtrampolined
-#        def walker(cell):  # FP, tail-recursive in the cdr half only
-#            if isinstance(cell.car, cons):
-#                yield from walker(cell.car)
-#            else:
-#                yield cell.car
-#            if isinstance(cell.cdr, cons):
-#                return walker(cell.cdr)  # signal gtrampolined to tail-chain
-#            elif cell.cdr is not nil:
-#                yield cell.cdr
+        #        @gtrampolined
+        #        def walker(cell):  # FP, tail-recursive in the cdr half only
+        #            if isinstance(cell.car, cons):
+        #                yield from walker(cell.car)
+        #            else:
+        #                yield cell.car
+        #            if isinstance(cell.cdr, cons):
+        #                return walker(cell.cdr)  # signal gtrampolined to tail-chain
+        #            elif cell.cdr is not nil:
+        #                yield cell.cdr
         def walker(cell):
             stack = [cell]
             while stack:
                 cell = stack.pop()
                 a, d = cell.car, cell.cdr
                 ac, dc = isinstance(a, cons), isinstance(d, cons)
-                if not ac: yield a
-                if not dc and d is not nil: yield d
-                if dc: stack.append(d)
-                if ac: stack.append(a)  # LIFO
+                if not ac:
+                    yield a
+                if not dc and d is not nil:
+                    yield d
+                if dc:
+                    stack.append(d)
+                if ac:
+                    stack.append(a)  # LIFO
         super().__init__(root, walker)
 
 class cons:
