Remove reference cycle breaking code. The GC now takes care of it.

nascheme · nascheme · commit b20e9dbf89cd · 2001-07-12T13:26:41.000Z
diff --git a/Lib/test/test_generators.py b/Lib/test/test_generators.py
@@ -484,8 +484,6 @@
 A->A B->G C->A D->G E->G F->A G->G H->G I->A J->G K->A L->A M->G
 merged A into G
 A->G B->G C->G D->G E->G F->G G->G H->G I->G J->G K->G L->G M->G
->>> for s in sets:  # XXX memory leak without this
-...    s.clear()
 """
 
 # Fun tests (for sufficiently warped notions of "fun").
@@ -614,7 +612,7 @@
 ...         yield i
 
 Print as many of these as you like -- *this* implementation is memory-
-efficient.  XXX Except that it leaks unless you clear the dict!
+efficient.
 
 >>> m235 = LazyList(m235())
 >>> for i in range(5):
@@ -625,8 +623,6 @@
 [200, 216, 225, 240, 243, 250, 256, 270, 288, 300, 320, 324, 360, 375, 384]
 [400, 405, 432, 450, 480, 486, 500, 512, 540, 576, 600, 625, 640, 648, 675]
 
->>> m235.clear()  # XXX memory leak without this
-
 
 Ye olde Fibonacci generator, LazyList style.
 
@@ -650,8 +646,6 @@
 >>> fib = LazyList(fibgen(1, 2))
 >>> firstn(iter(fib), 17)
 [1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584]
-
->>> fib.clear()  # XXX memory leak without this
 """
 
 # syntax_tests mostly provokes SyntaxErrors.  Also fiddling with #if 0
