summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorEzio Melotti <ezio.melotti@gmail.com>2012-11-18 21:14:42 (GMT)
committerEzio Melotti <ezio.melotti@gmail.com>2012-11-18 21:14:42 (GMT)
commit4a1fdcf07d4ee37ec003cd29be6b17e91d5db012 (patch)
treea9977543d3a4902576945079d4f6cfb8357bb3b0
parent3813c9efb7dd26d146e47e0e2691f4264627bd3a (diff)
downloadcpython-4a1fdcf07d4ee37ec003cd29be6b17e91d5db012.zip
cpython-4a1fdcf07d4ee37ec003cd29be6b17e91d5db012.tar.gz
cpython-4a1fdcf07d4ee37ec003cd29be6b17e91d5db012.tar.bz2
#7782: add a test for test_iter.
-rw-r--r--Lib/test/test_iter.py15
1 files changed, 15 insertions, 0 deletions
diff --git a/Lib/test/test_iter.py b/Lib/test/test_iter.py
index e424303..4d97183 100644
--- a/Lib/test/test_iter.py
+++ b/Lib/test/test_iter.py
@@ -876,6 +876,21 @@ class TestCase(unittest.TestCase):
except TypeError:
pass
+ def test_extending_list_with_iterator_does_not_segfault(self):
+ # The code to extend a list with an iterator has a fair
+ # amount of nontrivial logic in terms of guessing how
+ # much memory to allocate in advance, "stealing" refs,
+ # and then shrinking at the end. This is a basic smoke
+ # test for that scenario.
+ def gen():
+ for i in range(500):
+ yield i
+ lst = [0] * 500
+ for i in range(240):
+ lst.pop(0)
+ lst.extend(gen())
+ self.assertEqual(len(lst), 760)
+
def test_main():
run_unittest(TestCase)