From 69b34bfe9c3e5da1d7336a607ab56f1c3a178dca Mon Sep 17 00:00:00 2001 From: Raymond Hettinger Date: Tue, 30 Nov 2010 02:49:29 +0000 Subject: [PATCH] Issue #10323: Predictable final state for slice(). --- Lib/test/test_itertools.py | 5 +++++ Misc/NEWS | 4 ++++ Modules/itertoolsmodule.c | 7 ++++--- 3 files changed, 13 insertions(+), 3 deletions(-) diff --git a/Lib/test/test_itertools.py b/Lib/test/test_itertools.py index 06777a1ea61..fe6131abfed 100644 --- a/Lib/test/test_itertools.py +++ b/Lib/test/test_itertools.py @@ -788,6 +788,11 @@ class TestBasicOps(unittest.TestCase): self.assertRaises(ValueError, islice, range(10), 1, 'a', 1) self.assertEqual(len(list(islice(count(), 1, 10, maxsize))), 1) + # Issue #10323: Less islice in a predictable state + c = count() + self.assertEqual(list(islice(c, 1, 3, 50)), [1]) + self.assertEqual(next(c), 3) + def test_takewhile(self): data = [1, 3, 5, 20, 2, 4, 6, 8] underten = lambda x: x<10 diff --git a/Misc/NEWS b/Misc/NEWS index 71cbc3267e7..320aaaa4a89 100644 --- a/Misc/NEWS +++ b/Misc/NEWS @@ -43,6 +43,10 @@ Core and Builtins Library ------- +- Issue #10323: itertools.islice() now consumes the minimum number of + inputs before stopping. Formerly, the final state of the underlying + iterator was undefined. + - Issue #10565: The collections.Iterator ABC now checks for both __iter__ and __next__. diff --git a/Modules/itertoolsmodule.c b/Modules/itertoolsmodule.c index ba8d6dfde3d..d5336f24294 100644 --- a/Modules/itertoolsmodule.c +++ b/Modules/itertoolsmodule.c @@ -1215,6 +1215,7 @@ islice_next(isliceobject *lz) { PyObject *item; PyObject *it = lz->it; + Py_ssize_t stop = lz->stop; Py_ssize_t oldnext; PyObject *(*iternext)(PyObject *); @@ -1226,7 +1227,7 @@ islice_next(isliceobject *lz) Py_DECREF(item); lz->cnt++; } - if (lz->stop != -1 && lz->cnt >= lz->stop) + if (stop != -1 && lz->cnt >= stop) return NULL; item = iternext(it); if (item == NULL) @@ -1234,8 +1235,8 @@ islice_next(isliceobject *lz) lz->cnt++; oldnext = lz->next; lz->next += lz->step; - if (lz->next < oldnext) /* Check for overflow */ - lz->next = lz->stop; + if (lz->next < oldnext || (stop != -1 && lz->next > stop)) + lz->next = stop; return item; }