mirror of
https://github.com/RustPython/RustPython.git
synced 2026-10-29 03:04:38 +08:00
* Correct what the non-unix frame stack is for
The comment said non-unix threading builds have no stop-the-world.
CollectStopTheWorld is gated on `feature = "threading"` alone, and
sys._current_frames stops the world on both paths; the field is the
fallback a reader uses when there is no `top_iframe` to materialize from.
Assisted-by: Claude
* Seek by the whole file position on Windows
`SetFilePointer` answers with the low half of the new position and signals
failure with INVALID_SET_FILE_POINTER, which is also that half of a
position four gigabytes in; telling them apart takes the error code, which
this did not read, so such a seek was reported as an error. Deciding
seekability from it also called such a file unseekable.
`SetFilePointerEx` returns the whole position and a success flag of its
own, which also removes the transmute of the position into halves.
Assisted-by: Claude
* memoryview: tell a value of the wrong kind from one that does not fit
Assigning an item reported every packing failure as a TypeError, so
m[0] = 300 on a 'B' view said the value was the wrong type rather than out
of range. Packing now says which of the two it was, and whether the value's
own code raised, in which case that error is the answer as it is:
m[0] = 300 ValueError: invalid value for format 'B'
m[0] = "x" TypeError: invalid type for format 'B'
m[0] = <__index__ that raises> the raised error
`struct` reports both as `struct.error` and is unchanged; the kind travels
beside the exception for the caller that tells them apart.
Also: None was read as a deletion, so m[0] = None answered "cannot delete
memory" instead of packing it; and deleting through the mapping protocol
never reached the read-only check, which comes first.
Assisted-by: Claude
* Raise MemoryError for allocations sized by Python input
os.read, _RawIOBase.read, int.to_bytes, struct.pack, ctypes array
creation and the _ssl RAND functions sized a Vec from a Python-supplied
length with vec![], which calls handle_alloc_error and, under
panic = "abort", ends the process. They now allocate through
vm.new_zeroed_bytes and raise MemoryError.
itertools.product built its pools without checking that
len(iterables) * repeat is representable; it now raises OverflowError
"repeat argument too large" and reserves the pool and index vectors
fallibly. repeat is read as isize, so a negative one raises ValueError
"repeat argument cannot be negative" instead of the conversion's message.
_ssl.RAND_bytes and RAND_pseudo_bytes read n as i32, matching the int
they are declared with.
Assisted-by: Claude
* Collect with the count in the object header
A collection kept the count it was working with in a table keyed by the
object's address, and the objects it had proved reachable in a second one.
Between them they were hashed once per candidate and twice per edge in the
heap, which is where most of a collection over a live heap went.
The count now lives in `PyInner::gc_refs`, with `GcBits::COLLECTING` saying
it is meaningful, and reachability is `gc_refs == GC_REACHABLE` rather than
membership in a set. Step 5 splits the candidates and clears the bit in one
pass. gcbench, five interleaved pairs, median: a live heap of 423k objects
goes from 0.101s to 0.055s and a dead one from 0.402s to 0.383s.
The bits, generation, owner and count take eight bytes between them. A
64-bit header had those eight as the padding its alignment forces, so it is
unchanged at 48 bytes; a 32-bit header grows from 24 to 28.
Assisted-by: Claude
* Take an explicit thread stack size as a floor in debug builds
A debug build already started Python threads on 8 MiB rather than Rust's
2 MiB default, but an explicit threading.stack_size(N) went through
verbatim. test_threading asks for 256 KiB, and starting a thread on that
walked off the end of the stack: the guard page fault landed in the
prologue of ExecutingFrame::run.
Unoptimized, that prologue reserves 80,848 bytes where the optimized one
reserves 656 -- execute_instruction is #[inline(always)] and LLVM only
colors stack slots from opt-level 1, so the frame is the sum of all 200
instruction arms' temporaries rather than the largest. A Python call costs
88,672 bytes of native stack there, and threading's bootstrap is six
frames deep, so 256 KiB holds less than half of what starting a thread
takes.
The floor reaches thread::Builder only; threading.stack_size() still
answers with what was asked for, and release builds are unchanged.
Assisted-by: Claude
* Check the native stack on every frame entry
The C-stack guard ran on one frame entry in eight. That asks the margin to
cover eight frames rather than one, and it does not: an unoptimized frame
entered through native code takes 88,672 bytes against a debug margin of
262,144. A recursion whose steps re-enter that way -- `__add__` calling
itself, a sort key that sorts -- ran off the end of the stack instead of
raising RecursionError. On a debug build `class Add: __add__ = lambda s, o:
s + o; Add() + 1` segfaulted on the main thread; it now raises, as it does
under CPython and in release builds.
enter_iframe checked and then called enter_iframe_unchecked, which checked
again; it now leaves the check to the one call.
Measured on a call-dominated benchmark, five interleaved pairs: instructions
retired go up 0.17%, about four per call, which is the stack pointer read
and the compare.
Assisted-by: Claude
* Take an iterable's length hint when a list is filled from it
`map_py_iter` read `__length_hint__` only to pass it to `PyIterIter`, and
returned an empty vector when the hint was `isize::MAX` or more. Collecting
through `PyResult` dropped the iterator's lower bound, so nothing reserved
the room the hint asked for.
`list()`, `list.extend()` and `list.__iadd__()` now reserve it and report a
hint they cannot honour as `MemoryError`; a hint that leaves no room for the
elements the list already holds is passed over, as `list_extend()` does.
`tuple()` and the other callers keep filling up without reserving.
`length_hint_opt` errors other than the `TypeError` it already turns into
`None` now reach the caller instead of being dropped.
`__iadd__` and `inplace_concat` went through `extract_cloned`, which reads
`__len__` and not `__length_hint__`; both call `PyList::extend` now, the way
`list_inplace_concat()` calls `list_extend()`.
The tuple, list and dict fast paths of `extract_elements_inner` reserve their
known length, which the `collect()` they used dropped.
Assisted-by: Claude
* Drop map.__length_hint__
`map_methods` has no `__length_hint__`, so `operator.length_hint()` on a map
answers 0, not the length of what it draws from.
The method walked into the length hint of every iterator it holds, and a
chain of maps 10000 long overflowed the native stack answering for the
outermost one. It also took the longest of its iterators, where a map stops
at the shortest.
Assisted-by: Claude
* Ask for a length hint where each caller asks for it
`map_py_iter` asked the iterable it was handed, for every caller, and reported
what asking raised. Only some callers ask it: `list_extend()` and
`_PyBytes_FromIterator()` ask the iterable, `PySequence_Tuple()` asks the
iterator, and the bytearray constructor asks nothing. `tuple()`, `min()`,
`max()`, `collections.deque()` and `f(*x)` raised for an iterable whose
`__len__` or `__length_hint__` does, where they answer.
Which object is asked is now the caller's to say. `sorted()` asks the iterable,
being `PySequence_List()`.
`bytes_from_object()` stood in for `PyBytes_FromObject()`, for
`bytearray_extend()` and for the bytearray constructor, which do not agree on
this: the first two ask, the last does not. It is split, and assigning to a
bytearray slice takes the constructor's side with `PyByteArray_FromObject()`.
`list.extend()` counted what it held before the iterable had been asked, where
`list_extend()` reads `Py_SIZE(self)` after. A `__length_hint__` that adds to
the list made the overflow guard read a count too small and raise `MemoryError`
where nothing is wrong; one that empties it made the guard skip a reservation
that cannot be served.
Assisted-by: Claude
* Settle product's pool count before it reads its arguments
`product_new()` checks `repeat` and works out `npools` before it calls
`PySequence_Tuple()` on any argument, and fills the pools `npools` times.
The pools were filled by repeating the arguments `repeat` times instead, which
walks that many steps even with no arguments to repeat: `product(repeat=2**62)`
counted up to it rather than answering `[()]`. The count was also worked out
after the arguments had been read, so a repeat too large to serve ran their
code first.
Assisted-by: Claude
* Let the bool format answer with the error its value raised
`pack_single()` leaves `'?'` to `PyObject_IsTrue()` and returns what that
raised. Packing classified the error instead, so a `ValueError` from a
`__bool__` came back as "memoryview: invalid value for format '?'".
Assisted-by: Claude
* Release a cell's old value after the lock
`PyCell::set` dropped what it replaced while still holding the mutex guarding
the cell contents. A `__del__` running from that drop and reading the same cell
waited on a lock its own caller held, so `del it` on a closure variable whose
value has such a `__del__` deadlocked.
The replaced value is now released once the guard is gone, as `Py_XSETREF`
stores before it decrefs.
Assisted-by: Claude
* Have a set iterator hold the set it iterates
The iterator kept only a reference to the inner hash table, so in
`it = iter(A(*args))` the `A()` temporary was the last owner and died as the
call returned, before `it` was bound. A `__del__` reading `it` there saw an
unbound name and its error was printed and ignored.
The iterator now holds the set object, as `si_set` does, and releases it once
exhausted. That release happens after the lock is dropped, where
`setiter_iternext()` puts its `Py_DECREF(so)` past `Py_END_CRITICAL_SECTION()`,
so a `__del__` that iterates again does not wait on a lock the call holds.
Assisted-by: Claude
* Release an exhausted iterator's container after the lock
`PositionIterInternal::_next` overwrote its `IterStatus::Active` while the
caller still held the mutex around it. Dropping the container there ran any
`__del__` under that lock, and a `__del__` that iterated the same object again
blocked on it.
`exhaust()` now hands the container back instead of dropping it, and
`locked_step()` releases it after the guard. list, list_reverseiterator, tuple,
str, dict and its views and reverse views, bytes, bytearray, memoryview,
array, deque, and the enumerate and sequence iterators all go through it.
Assisted-by: Claude
* Unskip test_free_after_iterating
Assisted-by: Claude
* Stop listing test_set as an environment polluter
`check_free_after_iterating` no longer leaves an ignored exception behind, and
the job that reruns the listed tests ten times fails once one of them stops
polluting.
Assisted-by: Claude
* Drop winsound imports left unused
`TryFromBorrowedObject`, `exceptions`, and `ToWideString` have no reference in
the module, which fails the Windows clippy line under `-Dwarnings`.
Assisted-by: Claude
* Ask nothing where the caller takes no room
`map_py_iter` asked the iterator for a length hint on behalf of every caller
that does not reserve, and reported what asking raised. Those callers ask
nothing at all: `tuple()`, `f(*x)`, `bytearray(x)`, `min()`, `max()` and
`collections.deque()` answer for an iterator whose `__length_hint__` raises,
where they had been raising it.
The answer was also never spent. It reached `PyIterIter` for a `size_hint()`
the push loop does not read, so the lookup and any call it made were work
thrown away: `tuple()` over a generator drops 22% of its instructions, and 17%
over an iterator with a `__length_hint__` written in Python.
Assisted-by: Claude
* Stop asking an iterator how long it is to walk it
`PyIter::iter` and `PyIter::into_iter` asked for a length hint and reported
what asking raised. Nothing spent the answer: it reached `PyIterIter` for a
`size_hint()` that every caller either loops past or drops, since collecting
into a `Result` reports no lower bound.
23 operations answered for an iterator whose `__length_hint__` raises, where
they had been raising it: `set`, `frozenset` and the nine `set` methods that
take an iterable, `dict.fromkeys` and the dict view operators, `array` and
`array.extend`, `all`, `any`, `sum`, `io.writelines`, `math.fsum`,
`math.prod`, and `csv.writerow` and `writerows`.
Over a generator, `set()` drops 16% of its instructions and `all()` 23%.
`str.join` and `bytes.join` do ask, reaching their elements through
`PySequence_Fast()`, which fills a list from the iterator. They take
`iter_sized()`, which is now the only way to ask. `iter_without_hint` is gone,
its callers being what `iter` already does.
Assisted-by: Claude
* Name the matrix jobs rather than let the matrix name them
A generated job name lists every value in the matrix entry, so `cargo check`
carried the booleans its dependencies and `skip_ssl` keys expand to, and the
snippets job carried its test arguments and timeout. Adding or removing a key
renames the check, which drops it from the required list until that list is
edited to match. Emptying `env_polluting_tests` renamed three checks this way.
`Run rust tests` and `clippy` keep the names they had. `cargo check` drops the
booleans from six of its nine, and the snippets job drops its arguments and
timeout from all three.
Assisted-by: Claude
* Keep a sequence iterator active when an element raises
`PositionIterInternal::_next` exhausted the iterator for any non-`Return`
result, so an error from `__getitem__` ended the walk. `iter_iternext()`
lets go of its sequence for `IndexError` and `StopIteration` alone, and
`PyIterReturn::from_getitem_result` has already turned the first of those
into the second, so only `StopIteration` exhausts now.
Both deque iterators keep exhausting on their own mutation guard, which
`deque_iternext()` does by zeroing the counter before it raises; they
share one step function for it, and the message it raises is lowercased
to match the three other sites in the module.
Assisted-by: Claude
* Name the caller in the bytes conversion TypeError
An object with no iteration protocol reached `PyObject_GetIter`'s "not
iterable" message, and `bytearray.extend()` reported bytes. Each entry
point now checks for the protocol first and names itself:
bytes(object()) cannot convert 'object' object to bytes
bytearray(object()) cannot convert 'object' object to bytearray
bytearray().extend(object()) can't extend bytearray with object
Assisted-by: Claude
* Take a strong count too large to hold as reachable
`start_gc_refs` clipped a count at `GC_REACHABLE - 1`, a number the
per-reference subtraction could still walk down to zero and collect a
live object. It now stores `GC_REACHABLE`, and `subtract_gc_ref` leaves
that value alone.
Assisted-by: Claude
* Raise AssertionError where a snippet asserts False
`assert False` is removed under `-O`, which the snippet suite may run.
Assisted-by: Claude
* Keep raising for a collection that moved under its iterator
A deque, set or dict iterator raised once and then read as spent. The
guard is sticky: `deque_iternext()` looks at the deque's state before the
count it keeps, and `dictiter_iternextkey()` and `setiter_iternext()`
write a size no collection can have, so every later call finds the same
thing and raises again. `dequereviter_next()` is the one exception,
looking at its count first, so it runs out after the first raise.
Both deque iterators now carry `dequeiterobject.counter` rather than
reading a length back from the deque, and the dict and set iterators
compare the size they captured against the collection's own every time
they are asked how much is left, which is what makes that answer nothing
from the moment the collection changes rather than only once the
iterator has raised.
The set's message is capitalized to match `setiter_iternext()`.
Measured against 3.14.6, for each of deque, reversed deque, set, dict
and a reversed dict view: the hint after the change, the error, the hint
after the error, and what a later call answers.
Assisted-by: Claude
* Give apt-get update a deadline to fail on
The step waits on `apt-get update`, which has no deadline of its own, so
a source that takes the connection and then stops answering holds the
job until the workflow's own timeout. The retry that disables the
Microsoft and azure-cli sources runs only when the update exits
non-zero, which a held connection never does; three jobs on this branch
sat on this step for 20 minutes to five and a half hours.
Each attempt is now bounded, and the transports are given a timeout, so
a source that stops answering reaches the retry.
Assisted-by: Claude
1191 lines
38 KiB
Python
Vendored
1191 lines
38 KiB
Python
Vendored
# Test iterators.
|
|
|
|
import sys
|
|
import unittest
|
|
from test.support import cpython_only
|
|
from test.support.os_helper import TESTFN, unlink
|
|
from test.support import check_free_after_iterating, ALWAYS_EQ, NEVER_EQ
|
|
from test.support import BrokenIter
|
|
import pickle
|
|
import collections.abc
|
|
import functools
|
|
import contextlib
|
|
import builtins
|
|
import traceback
|
|
|
|
# Test result of triple loop (too big to inline)
|
|
TRIPLETS = [(0, 0, 0), (0, 0, 1), (0, 0, 2),
|
|
(0, 1, 0), (0, 1, 1), (0, 1, 2),
|
|
(0, 2, 0), (0, 2, 1), (0, 2, 2),
|
|
|
|
(1, 0, 0), (1, 0, 1), (1, 0, 2),
|
|
(1, 1, 0), (1, 1, 1), (1, 1, 2),
|
|
(1, 2, 0), (1, 2, 1), (1, 2, 2),
|
|
|
|
(2, 0, 0), (2, 0, 1), (2, 0, 2),
|
|
(2, 1, 0), (2, 1, 1), (2, 1, 2),
|
|
(2, 2, 0), (2, 2, 1), (2, 2, 2)]
|
|
|
|
# Helper classes
|
|
|
|
class BasicIterClass:
|
|
def __init__(self, n):
|
|
self.n = n
|
|
self.i = 0
|
|
def __next__(self):
|
|
res = self.i
|
|
if res >= self.n:
|
|
raise StopIteration
|
|
self.i = res + 1
|
|
return res
|
|
def __iter__(self):
|
|
return self
|
|
|
|
class IteratingSequenceClass:
|
|
def __init__(self, n):
|
|
self.n = n
|
|
def __iter__(self):
|
|
return BasicIterClass(self.n)
|
|
|
|
class IteratorProxyClass:
|
|
def __init__(self, i):
|
|
self.i = i
|
|
def __next__(self):
|
|
return next(self.i)
|
|
def __iter__(self):
|
|
return self
|
|
|
|
class SequenceClass:
|
|
def __init__(self, n):
|
|
self.n = n
|
|
def __getitem__(self, i):
|
|
if 0 <= i < self.n:
|
|
return i
|
|
else:
|
|
raise IndexError
|
|
|
|
class SequenceProxyClass:
|
|
def __init__(self, s):
|
|
self.s = s
|
|
def __getitem__(self, i):
|
|
return self.s[i]
|
|
|
|
class UnlimitedSequenceClass:
|
|
def __getitem__(self, i):
|
|
return i
|
|
|
|
class DefaultIterClass:
|
|
pass
|
|
|
|
class NoIterClass:
|
|
def __getitem__(self, i):
|
|
return i
|
|
__iter__ = None
|
|
|
|
class BadIterableClass:
|
|
def __iter__(self):
|
|
raise ZeroDivisionError
|
|
|
|
class CallableIterClass:
|
|
def __init__(self):
|
|
self.i = 0
|
|
def __call__(self):
|
|
i = self.i
|
|
self.i = i + 1
|
|
if i > 100:
|
|
raise IndexError # Emergency stop
|
|
return i
|
|
|
|
class EmptyIterClass:
|
|
def __len__(self):
|
|
return 0
|
|
def __getitem__(self, i):
|
|
raise StopIteration
|
|
|
|
# Main test suite
|
|
|
|
class TestCase(unittest.TestCase):
|
|
|
|
# Helper to check that an iterator returns a given sequence
|
|
def check_iterator(self, it, seq, pickle=True):
|
|
if pickle:
|
|
self.check_pickle(it, seq)
|
|
res = []
|
|
while 1:
|
|
try:
|
|
val = next(it)
|
|
except StopIteration:
|
|
break
|
|
res.append(val)
|
|
self.assertEqual(res, seq)
|
|
|
|
# Helper to check that a for loop generates a given sequence
|
|
def check_for_loop(self, expr, seq, pickle=True):
|
|
if pickle:
|
|
self.check_pickle(iter(expr), seq)
|
|
res = []
|
|
for val in expr:
|
|
res.append(val)
|
|
self.assertEqual(res, seq)
|
|
|
|
# Helper to check picklability
|
|
def check_pickle(self, itorg, seq):
|
|
for proto in range(pickle.HIGHEST_PROTOCOL + 1):
|
|
d = pickle.dumps(itorg, proto)
|
|
it = pickle.loads(d)
|
|
# Cannot assert type equality because dict iterators unpickle as list
|
|
# iterators.
|
|
# self.assertEqual(type(itorg), type(it))
|
|
self.assertTrue(isinstance(it, collections.abc.Iterator))
|
|
self.assertEqual(list(it), seq)
|
|
|
|
it = pickle.loads(d)
|
|
try:
|
|
next(it)
|
|
except StopIteration:
|
|
continue
|
|
d = pickle.dumps(it, proto)
|
|
it = pickle.loads(d)
|
|
self.assertEqual(list(it), seq[1:])
|
|
|
|
# Test basic use of iter() function
|
|
def test_iter_basic(self):
|
|
self.check_iterator(iter(range(10)), list(range(10)))
|
|
|
|
# Test that iter(iter(x)) is the same as iter(x)
|
|
def test_iter_idempotency(self):
|
|
seq = list(range(10))
|
|
it = iter(seq)
|
|
it2 = iter(it)
|
|
self.assertTrue(it is it2)
|
|
|
|
# Test that for loops over iterators work
|
|
def test_iter_for_loop(self):
|
|
self.check_for_loop(iter(range(10)), list(range(10)))
|
|
|
|
# Test several independent iterators over the same list
|
|
def test_iter_independence(self):
|
|
seq = range(3)
|
|
res = []
|
|
for i in iter(seq):
|
|
for j in iter(seq):
|
|
for k in iter(seq):
|
|
res.append((i, j, k))
|
|
self.assertEqual(res, TRIPLETS)
|
|
|
|
# Test triple list comprehension using iterators
|
|
def test_nested_comprehensions_iter(self):
|
|
seq = range(3)
|
|
res = [(i, j, k)
|
|
for i in iter(seq) for j in iter(seq) for k in iter(seq)]
|
|
self.assertEqual(res, TRIPLETS)
|
|
|
|
# Test triple list comprehension without iterators
|
|
def test_nested_comprehensions_for(self):
|
|
seq = range(3)
|
|
res = [(i, j, k) for i in seq for j in seq for k in seq]
|
|
self.assertEqual(res, TRIPLETS)
|
|
|
|
# Test a class with __iter__ in a for loop
|
|
def test_iter_class_for(self):
|
|
self.check_for_loop(IteratingSequenceClass(10), list(range(10)))
|
|
|
|
# Test a class with __iter__ with explicit iter()
|
|
def test_iter_class_iter(self):
|
|
self.check_iterator(iter(IteratingSequenceClass(10)), list(range(10)))
|
|
|
|
# Test for loop on a sequence class without __iter__
|
|
def test_seq_class_for(self):
|
|
self.check_for_loop(SequenceClass(10), list(range(10)))
|
|
|
|
# Test iter() on a sequence class without __iter__
|
|
def test_seq_class_iter(self):
|
|
self.check_iterator(iter(SequenceClass(10)), list(range(10)))
|
|
|
|
def test_mutating_seq_class_iter_pickle(self):
|
|
orig = SequenceClass(5)
|
|
for proto in range(pickle.HIGHEST_PROTOCOL + 1):
|
|
# initial iterator
|
|
itorig = iter(orig)
|
|
d = pickle.dumps((itorig, orig), proto)
|
|
it, seq = pickle.loads(d)
|
|
seq.n = 7
|
|
self.assertIs(type(it), type(itorig))
|
|
self.assertEqual(list(it), list(range(7)))
|
|
|
|
# running iterator
|
|
next(itorig)
|
|
d = pickle.dumps((itorig, orig), proto)
|
|
it, seq = pickle.loads(d)
|
|
seq.n = 7
|
|
self.assertIs(type(it), type(itorig))
|
|
self.assertEqual(list(it), list(range(1, 7)))
|
|
|
|
# empty iterator
|
|
for i in range(1, 5):
|
|
next(itorig)
|
|
d = pickle.dumps((itorig, orig), proto)
|
|
it, seq = pickle.loads(d)
|
|
seq.n = 7
|
|
self.assertIs(type(it), type(itorig))
|
|
self.assertEqual(list(it), list(range(5, 7)))
|
|
|
|
# exhausted iterator
|
|
self.assertRaises(StopIteration, next, itorig)
|
|
d = pickle.dumps((itorig, orig), proto)
|
|
it, seq = pickle.loads(d)
|
|
seq.n = 7
|
|
self.assertTrue(isinstance(it, collections.abc.Iterator))
|
|
self.assertEqual(list(it), [])
|
|
|
|
def test_mutating_seq_class_exhausted_iter(self):
|
|
a = SequenceClass(5)
|
|
exhit = iter(a)
|
|
empit = iter(a)
|
|
for x in exhit: # exhaust the iterator
|
|
next(empit) # not exhausted
|
|
a.n = 7
|
|
self.assertEqual(list(exhit), [])
|
|
self.assertEqual(list(empit), [5, 6])
|
|
self.assertEqual(list(a), [0, 1, 2, 3, 4, 5, 6])
|
|
|
|
def test_reduce_mutating_builtins_iter(self):
|
|
# This is a reproducer of issue #101765
|
|
# where iter `__reduce__` calls could lead to a segfault or SystemError
|
|
# depending on the order of C argument evaluation, which is undefined
|
|
|
|
# Backup builtins
|
|
builtins_dict = builtins.__dict__
|
|
orig = {"iter": iter, "reversed": reversed}
|
|
|
|
def run(builtin_name, item, sentinel=None):
|
|
it = iter(item) if sentinel is None else iter(item, sentinel)
|
|
|
|
class CustomStr:
|
|
def __init__(self, name, iterator):
|
|
self.name = name
|
|
self.iterator = iterator
|
|
def __hash__(self):
|
|
return hash(self.name)
|
|
def __eq__(self, other):
|
|
# Here we exhaust our iterator, possibly changing
|
|
# its `it_seq` pointer to NULL
|
|
# The `__reduce__` call should correctly get
|
|
# the pointers after this call
|
|
list(self.iterator)
|
|
return other == self.name
|
|
|
|
# del is required here
|
|
# to not prematurely call __eq__ from
|
|
# the hash collision with the old key
|
|
del builtins_dict[builtin_name]
|
|
builtins_dict[CustomStr(builtin_name, it)] = orig[builtin_name]
|
|
|
|
return it.__reduce__()
|
|
|
|
types = [
|
|
(EmptyIterClass(),),
|
|
(bytes(8),),
|
|
(bytearray(8),),
|
|
((1, 2, 3),),
|
|
(lambda: 0, 0),
|
|
(tuple[int],) # GenericAlias
|
|
]
|
|
|
|
try:
|
|
run_iter = functools.partial(run, "iter")
|
|
# The returned value of `__reduce__` should not only be valid
|
|
# but also *empty*, as `it` was exhausted during `__eq__`
|
|
# i.e "xyz" returns (iter, ("",))
|
|
self.assertEqual(run_iter("xyz"), (orig["iter"], ("",)))
|
|
self.assertEqual(run_iter([1, 2, 3]), (orig["iter"], ([],)))
|
|
|
|
# _PyEval_GetBuiltin is also called for `reversed` in a branch of
|
|
# listiter_reduce_general
|
|
self.assertEqual(
|
|
run("reversed", orig["reversed"](list(range(8)))),
|
|
(reversed, ([],))
|
|
)
|
|
|
|
for case in types:
|
|
self.assertEqual(run_iter(*case), (orig["iter"], ((),)))
|
|
finally:
|
|
# Restore original builtins
|
|
for key, func in orig.items():
|
|
# need to suppress KeyErrors in case
|
|
# a failed test deletes the key without setting anything
|
|
with contextlib.suppress(KeyError):
|
|
# del is required here
|
|
# to not invoke our custom __eq__ from
|
|
# the hash collision with the old key
|
|
del builtins_dict[key]
|
|
builtins_dict[key] = func
|
|
|
|
# Test a new_style class with __iter__ but no next() method
|
|
def test_new_style_iter_class(self):
|
|
class IterClass(object):
|
|
def __iter__(self):
|
|
return self
|
|
self.assertRaises(TypeError, iter, IterClass())
|
|
|
|
# Test two-argument iter() with callable instance
|
|
def test_iter_callable(self):
|
|
self.check_iterator(iter(CallableIterClass(), 10), list(range(10)), pickle=True)
|
|
|
|
# Test two-argument iter() with function
|
|
def test_iter_function(self):
|
|
def spam(state=[0]):
|
|
i = state[0]
|
|
state[0] = i+1
|
|
return i
|
|
self.check_iterator(iter(spam, 10), list(range(10)), pickle=False)
|
|
|
|
# Test two-argument iter() with function that raises StopIteration
|
|
def test_iter_function_stop(self):
|
|
def spam(state=[0]):
|
|
i = state[0]
|
|
if i == 10:
|
|
raise StopIteration
|
|
state[0] = i+1
|
|
return i
|
|
self.check_iterator(iter(spam, 20), list(range(10)), pickle=False)
|
|
|
|
def test_iter_function_concealing_reentrant_exhaustion(self):
|
|
# gh-101892: Test two-argument iter() with a function that
|
|
# exhausts its associated iterator but forgets to either return
|
|
# a sentinel value or raise StopIteration.
|
|
HAS_MORE = 1
|
|
NO_MORE = 2
|
|
|
|
def exhaust(iterator):
|
|
"""Exhaust an iterator without raising StopIteration."""
|
|
list(iterator)
|
|
|
|
def spam():
|
|
# Touching the iterator with exhaust() below will call
|
|
# spam() once again so protect against recursion.
|
|
if spam.is_recursive_call:
|
|
return NO_MORE
|
|
spam.is_recursive_call = True
|
|
exhaust(spam.iterator)
|
|
return HAS_MORE
|
|
|
|
spam.is_recursive_call = False
|
|
spam.iterator = iter(spam, NO_MORE)
|
|
with self.assertRaises(StopIteration):
|
|
next(spam.iterator)
|
|
|
|
# Test exception propagation through function iterator
|
|
def test_exception_function(self):
|
|
def spam(state=[0]):
|
|
i = state[0]
|
|
state[0] = i+1
|
|
if i == 10:
|
|
raise RuntimeError
|
|
return i
|
|
res = []
|
|
try:
|
|
for x in iter(spam, 20):
|
|
res.append(x)
|
|
except RuntimeError:
|
|
self.assertEqual(res, list(range(10)))
|
|
else:
|
|
self.fail("should have raised RuntimeError")
|
|
|
|
# Test exception propagation through sequence iterator
|
|
def test_exception_sequence(self):
|
|
class MySequenceClass(SequenceClass):
|
|
def __getitem__(self, i):
|
|
if i == 10:
|
|
raise RuntimeError
|
|
return SequenceClass.__getitem__(self, i)
|
|
res = []
|
|
try:
|
|
for x in MySequenceClass(20):
|
|
res.append(x)
|
|
except RuntimeError:
|
|
self.assertEqual(res, list(range(10)))
|
|
else:
|
|
self.fail("should have raised RuntimeError")
|
|
|
|
# Test for StopIteration from __getitem__
|
|
def test_stop_sequence(self):
|
|
class MySequenceClass(SequenceClass):
|
|
def __getitem__(self, i):
|
|
if i == 10:
|
|
raise StopIteration
|
|
return SequenceClass.__getitem__(self, i)
|
|
self.check_for_loop(MySequenceClass(20), list(range(10)), pickle=False)
|
|
|
|
# Test a big range
|
|
def test_iter_big_range(self):
|
|
self.check_for_loop(iter(range(10000)), list(range(10000)))
|
|
|
|
# Test an empty list
|
|
def test_iter_empty(self):
|
|
self.check_for_loop(iter([]), [])
|
|
|
|
# Test a tuple
|
|
def test_iter_tuple(self):
|
|
self.check_for_loop(iter((0,1,2,3,4,5,6,7,8,9)), list(range(10)))
|
|
|
|
# Test a range
|
|
def test_iter_range(self):
|
|
self.check_for_loop(iter(range(10)), list(range(10)))
|
|
|
|
# Test a string
|
|
def test_iter_string(self):
|
|
self.check_for_loop(iter("abcde"), ["a", "b", "c", "d", "e"])
|
|
|
|
# Test a directory
|
|
def test_iter_dict(self):
|
|
dict = {}
|
|
for i in range(10):
|
|
dict[i] = None
|
|
self.check_for_loop(dict, list(dict.keys()))
|
|
|
|
# Test a file
|
|
def test_iter_file(self):
|
|
f = open(TESTFN, "w", encoding="utf-8")
|
|
try:
|
|
for i in range(5):
|
|
f.write("%d\n" % i)
|
|
finally:
|
|
f.close()
|
|
f = open(TESTFN, "r", encoding="utf-8")
|
|
try:
|
|
self.check_for_loop(f, ["0\n", "1\n", "2\n", "3\n", "4\n"], pickle=False)
|
|
self.check_for_loop(f, [], pickle=False)
|
|
finally:
|
|
f.close()
|
|
try:
|
|
unlink(TESTFN)
|
|
except OSError:
|
|
pass
|
|
|
|
# Test list()'s use of iterators.
|
|
def test_builtin_list(self):
|
|
self.assertEqual(list(SequenceClass(5)), list(range(5)))
|
|
self.assertEqual(list(SequenceClass(0)), [])
|
|
self.assertEqual(list(()), [])
|
|
|
|
d = {"one": 1, "two": 2, "three": 3}
|
|
self.assertEqual(list(d), list(d.keys()))
|
|
|
|
self.assertRaises(TypeError, list, list)
|
|
self.assertRaises(TypeError, list, 42)
|
|
|
|
f = open(TESTFN, "w", encoding="utf-8")
|
|
try:
|
|
for i in range(5):
|
|
f.write("%d\n" % i)
|
|
finally:
|
|
f.close()
|
|
f = open(TESTFN, "r", encoding="utf-8")
|
|
try:
|
|
self.assertEqual(list(f), ["0\n", "1\n", "2\n", "3\n", "4\n"])
|
|
f.seek(0, 0)
|
|
self.assertEqual(list(f),
|
|
["0\n", "1\n", "2\n", "3\n", "4\n"])
|
|
finally:
|
|
f.close()
|
|
try:
|
|
unlink(TESTFN)
|
|
except OSError:
|
|
pass
|
|
|
|
# Test tuples()'s use of iterators.
|
|
def test_builtin_tuple(self):
|
|
self.assertEqual(tuple(SequenceClass(5)), (0, 1, 2, 3, 4))
|
|
self.assertEqual(tuple(SequenceClass(0)), ())
|
|
self.assertEqual(tuple([]), ())
|
|
self.assertEqual(tuple(()), ())
|
|
self.assertEqual(tuple("abc"), ("a", "b", "c"))
|
|
|
|
d = {"one": 1, "two": 2, "three": 3}
|
|
self.assertEqual(tuple(d), tuple(d.keys()))
|
|
|
|
self.assertRaises(TypeError, tuple, list)
|
|
self.assertRaises(TypeError, tuple, 42)
|
|
|
|
f = open(TESTFN, "w", encoding="utf-8")
|
|
try:
|
|
for i in range(5):
|
|
f.write("%d\n" % i)
|
|
finally:
|
|
f.close()
|
|
f = open(TESTFN, "r", encoding="utf-8")
|
|
try:
|
|
self.assertEqual(tuple(f), ("0\n", "1\n", "2\n", "3\n", "4\n"))
|
|
f.seek(0, 0)
|
|
self.assertEqual(tuple(f),
|
|
("0\n", "1\n", "2\n", "3\n", "4\n"))
|
|
finally:
|
|
f.close()
|
|
try:
|
|
unlink(TESTFN)
|
|
except OSError:
|
|
pass
|
|
|
|
# Test filter()'s use of iterators.
|
|
def test_builtin_filter(self):
|
|
self.assertEqual(list(filter(None, SequenceClass(5))),
|
|
list(range(1, 5)))
|
|
self.assertEqual(list(filter(None, SequenceClass(0))), [])
|
|
self.assertEqual(list(filter(None, ())), [])
|
|
self.assertEqual(list(filter(None, "abc")), ["a", "b", "c"])
|
|
|
|
d = {"one": 1, "two": 2, "three": 3}
|
|
self.assertEqual(list(filter(None, d)), list(d.keys()))
|
|
|
|
self.assertRaises(TypeError, filter, None, list)
|
|
self.assertRaises(TypeError, filter, None, 42)
|
|
|
|
class Boolean:
|
|
def __init__(self, truth):
|
|
self.truth = truth
|
|
def __bool__(self):
|
|
return self.truth
|
|
bTrue = Boolean(True)
|
|
bFalse = Boolean(False)
|
|
|
|
class Seq:
|
|
def __init__(self, *args):
|
|
self.vals = args
|
|
def __iter__(self):
|
|
class SeqIter:
|
|
def __init__(self, vals):
|
|
self.vals = vals
|
|
self.i = 0
|
|
def __iter__(self):
|
|
return self
|
|
def __next__(self):
|
|
i = self.i
|
|
self.i = i + 1
|
|
if i < len(self.vals):
|
|
return self.vals[i]
|
|
else:
|
|
raise StopIteration
|
|
return SeqIter(self.vals)
|
|
|
|
seq = Seq(*([bTrue, bFalse] * 25))
|
|
self.assertEqual(list(filter(lambda x: not x, seq)), [bFalse]*25)
|
|
self.assertEqual(list(filter(lambda x: not x, iter(seq))), [bFalse]*25)
|
|
|
|
# Test max() and min()'s use of iterators.
|
|
def test_builtin_max_min(self):
|
|
self.assertEqual(max(SequenceClass(5)), 4)
|
|
self.assertEqual(min(SequenceClass(5)), 0)
|
|
self.assertEqual(max(8, -1), 8)
|
|
self.assertEqual(min(8, -1), -1)
|
|
|
|
d = {"one": 1, "two": 2, "three": 3}
|
|
self.assertEqual(max(d), "two")
|
|
self.assertEqual(min(d), "one")
|
|
self.assertEqual(max(d.values()), 3)
|
|
self.assertEqual(min(iter(d.values())), 1)
|
|
|
|
f = open(TESTFN, "w", encoding="utf-8")
|
|
try:
|
|
f.write("medium line\n")
|
|
f.write("xtra large line\n")
|
|
f.write("itty-bitty line\n")
|
|
finally:
|
|
f.close()
|
|
f = open(TESTFN, "r", encoding="utf-8")
|
|
try:
|
|
self.assertEqual(min(f), "itty-bitty line\n")
|
|
f.seek(0, 0)
|
|
self.assertEqual(max(f), "xtra large line\n")
|
|
finally:
|
|
f.close()
|
|
try:
|
|
unlink(TESTFN)
|
|
except OSError:
|
|
pass
|
|
|
|
# Test map()'s use of iterators.
|
|
def test_builtin_map(self):
|
|
self.assertEqual(list(map(lambda x: x+1, SequenceClass(5))),
|
|
list(range(1, 6)))
|
|
|
|
d = {"one": 1, "two": 2, "three": 3}
|
|
self.assertEqual(list(map(lambda k, d=d: (k, d[k]), d)),
|
|
list(d.items()))
|
|
dkeys = list(d.keys())
|
|
expected = [(i < len(d) and dkeys[i] or None,
|
|
i,
|
|
i < len(d) and dkeys[i] or None)
|
|
for i in range(3)]
|
|
|
|
f = open(TESTFN, "w", encoding="utf-8")
|
|
try:
|
|
for i in range(10):
|
|
f.write("xy" * i + "\n") # line i has len 2*i+1
|
|
finally:
|
|
f.close()
|
|
f = open(TESTFN, "r", encoding="utf-8")
|
|
try:
|
|
self.assertEqual(list(map(len, f)), list(range(1, 21, 2)))
|
|
finally:
|
|
f.close()
|
|
try:
|
|
unlink(TESTFN)
|
|
except OSError:
|
|
pass
|
|
|
|
# Test zip()'s use of iterators.
|
|
def test_builtin_zip(self):
|
|
self.assertEqual(list(zip()), [])
|
|
self.assertEqual(list(zip(*[])), [])
|
|
self.assertEqual(list(zip(*[(1, 2), 'ab'])), [(1, 'a'), (2, 'b')])
|
|
|
|
self.assertRaises(TypeError, zip, None)
|
|
self.assertRaises(TypeError, zip, range(10), 42)
|
|
self.assertRaises(TypeError, zip, range(10), zip)
|
|
|
|
self.assertEqual(list(zip(IteratingSequenceClass(3))),
|
|
[(0,), (1,), (2,)])
|
|
self.assertEqual(list(zip(SequenceClass(3))),
|
|
[(0,), (1,), (2,)])
|
|
|
|
d = {"one": 1, "two": 2, "three": 3}
|
|
self.assertEqual(list(d.items()), list(zip(d, d.values())))
|
|
|
|
# Generate all ints starting at constructor arg.
|
|
class IntsFrom:
|
|
def __init__(self, start):
|
|
self.i = start
|
|
|
|
def __iter__(self):
|
|
return self
|
|
|
|
def __next__(self):
|
|
i = self.i
|
|
self.i = i+1
|
|
return i
|
|
|
|
f = open(TESTFN, "w", encoding="utf-8")
|
|
try:
|
|
f.write("a\n" "bbb\n" "cc\n")
|
|
finally:
|
|
f.close()
|
|
f = open(TESTFN, "r", encoding="utf-8")
|
|
try:
|
|
self.assertEqual(list(zip(IntsFrom(0), f, IntsFrom(-100))),
|
|
[(0, "a\n", -100),
|
|
(1, "bbb\n", -99),
|
|
(2, "cc\n", -98)])
|
|
finally:
|
|
f.close()
|
|
try:
|
|
unlink(TESTFN)
|
|
except OSError:
|
|
pass
|
|
|
|
self.assertEqual(list(zip(range(5))), [(i,) for i in range(5)])
|
|
|
|
# Classes that lie about their lengths.
|
|
class NoGuessLen5:
|
|
def __getitem__(self, i):
|
|
if i >= 5:
|
|
raise IndexError
|
|
return i
|
|
|
|
class Guess3Len5(NoGuessLen5):
|
|
def __len__(self):
|
|
return 3
|
|
|
|
class Guess30Len5(NoGuessLen5):
|
|
def __len__(self):
|
|
return 30
|
|
|
|
def lzip(*args):
|
|
return list(zip(*args))
|
|
|
|
self.assertEqual(len(Guess3Len5()), 3)
|
|
self.assertEqual(len(Guess30Len5()), 30)
|
|
self.assertEqual(lzip(NoGuessLen5()), lzip(range(5)))
|
|
self.assertEqual(lzip(Guess3Len5()), lzip(range(5)))
|
|
self.assertEqual(lzip(Guess30Len5()), lzip(range(5)))
|
|
|
|
expected = [(i, i) for i in range(5)]
|
|
for x in NoGuessLen5(), Guess3Len5(), Guess30Len5():
|
|
for y in NoGuessLen5(), Guess3Len5(), Guess30Len5():
|
|
self.assertEqual(lzip(x, y), expected)
|
|
|
|
def test_unicode_join_endcase(self):
|
|
|
|
# This class inserts a Unicode object into its argument's natural
|
|
# iteration, in the 3rd position.
|
|
class OhPhooey:
|
|
def __init__(self, seq):
|
|
self.it = iter(seq)
|
|
self.i = 0
|
|
|
|
def __iter__(self):
|
|
return self
|
|
|
|
def __next__(self):
|
|
i = self.i
|
|
self.i = i+1
|
|
if i == 2:
|
|
return "fooled you!"
|
|
return next(self.it)
|
|
|
|
f = open(TESTFN, "w", encoding="utf-8")
|
|
try:
|
|
f.write("a\n" + "b\n" + "c\n")
|
|
finally:
|
|
f.close()
|
|
|
|
f = open(TESTFN, "r", encoding="utf-8")
|
|
# Nasty: string.join(s) can't know whether unicode.join() is needed
|
|
# until it's seen all of s's elements. But in this case, f's
|
|
# iterator cannot be restarted. So what we're testing here is
|
|
# whether string.join() can manage to remember everything it's seen
|
|
# and pass that on to unicode.join().
|
|
try:
|
|
got = " - ".join(OhPhooey(f))
|
|
self.assertEqual(got, "a\n - b\n - fooled you! - c\n")
|
|
finally:
|
|
f.close()
|
|
try:
|
|
unlink(TESTFN)
|
|
except OSError:
|
|
pass
|
|
|
|
# Test iterators with 'x in y' and 'x not in y'.
|
|
def test_in_and_not_in(self):
|
|
for sc5 in IteratingSequenceClass(5), SequenceClass(5):
|
|
for i in range(5):
|
|
self.assertIn(i, sc5)
|
|
for i in "abc", -1, 5, 42.42, (3, 4), [], {1: 1}, 3-12j, sc5:
|
|
self.assertNotIn(i, sc5)
|
|
|
|
self.assertIn(ALWAYS_EQ, IteratorProxyClass(iter([1])))
|
|
self.assertIn(ALWAYS_EQ, SequenceProxyClass([1]))
|
|
self.assertNotIn(ALWAYS_EQ, IteratorProxyClass(iter([NEVER_EQ])))
|
|
self.assertNotIn(ALWAYS_EQ, SequenceProxyClass([NEVER_EQ]))
|
|
self.assertIn(NEVER_EQ, IteratorProxyClass(iter([ALWAYS_EQ])))
|
|
self.assertIn(NEVER_EQ, SequenceProxyClass([ALWAYS_EQ]))
|
|
|
|
self.assertRaises(TypeError, lambda: 3 in 12)
|
|
self.assertRaises(TypeError, lambda: 3 not in map)
|
|
self.assertRaises(ZeroDivisionError, lambda: 3 in BadIterableClass())
|
|
|
|
d = {"one": 1, "two": 2, "three": 3, 1j: 2j}
|
|
for k in d:
|
|
self.assertIn(k, d)
|
|
self.assertNotIn(k, d.values())
|
|
for v in d.values():
|
|
self.assertIn(v, d.values())
|
|
self.assertNotIn(v, d)
|
|
for k, v in d.items():
|
|
self.assertIn((k, v), d.items())
|
|
self.assertNotIn((v, k), d.items())
|
|
|
|
f = open(TESTFN, "w", encoding="utf-8")
|
|
try:
|
|
f.write("a\n" "b\n" "c\n")
|
|
finally:
|
|
f.close()
|
|
f = open(TESTFN, "r", encoding="utf-8")
|
|
try:
|
|
for chunk in "abc":
|
|
f.seek(0, 0)
|
|
self.assertNotIn(chunk, f)
|
|
f.seek(0, 0)
|
|
self.assertIn((chunk + "\n"), f)
|
|
finally:
|
|
f.close()
|
|
try:
|
|
unlink(TESTFN)
|
|
except OSError:
|
|
pass
|
|
|
|
# Test iterators with operator.countOf (PySequence_Count).
|
|
def test_countOf(self):
|
|
from operator import countOf
|
|
self.assertEqual(countOf([1,2,2,3,2,5], 2), 3)
|
|
self.assertEqual(countOf((1,2,2,3,2,5), 2), 3)
|
|
self.assertEqual(countOf("122325", "2"), 3)
|
|
self.assertEqual(countOf("122325", "6"), 0)
|
|
|
|
self.assertRaises(TypeError, countOf, 42, 1)
|
|
self.assertRaises(TypeError, countOf, countOf, countOf)
|
|
|
|
d = {"one": 3, "two": 3, "three": 3, 1j: 2j}
|
|
for k in d:
|
|
self.assertEqual(countOf(d, k), 1)
|
|
self.assertEqual(countOf(d.values(), 3), 3)
|
|
self.assertEqual(countOf(d.values(), 2j), 1)
|
|
self.assertEqual(countOf(d.values(), 1j), 0)
|
|
|
|
f = open(TESTFN, "w", encoding="utf-8")
|
|
try:
|
|
f.write("a\n" "b\n" "c\n" "b\n")
|
|
finally:
|
|
f.close()
|
|
f = open(TESTFN, "r", encoding="utf-8")
|
|
try:
|
|
for letter, count in ("a", 1), ("b", 2), ("c", 1), ("d", 0):
|
|
f.seek(0, 0)
|
|
self.assertEqual(countOf(f, letter + "\n"), count)
|
|
finally:
|
|
f.close()
|
|
try:
|
|
unlink(TESTFN)
|
|
except OSError:
|
|
pass
|
|
|
|
# Test iterators with operator.indexOf (PySequence_Index).
|
|
def test_indexOf(self):
|
|
from operator import indexOf
|
|
self.assertEqual(indexOf([1,2,2,3,2,5], 1), 0)
|
|
self.assertEqual(indexOf((1,2,2,3,2,5), 2), 1)
|
|
self.assertEqual(indexOf((1,2,2,3,2,5), 3), 3)
|
|
self.assertEqual(indexOf((1,2,2,3,2,5), 5), 5)
|
|
self.assertRaises(ValueError, indexOf, (1,2,2,3,2,5), 0)
|
|
self.assertRaises(ValueError, indexOf, (1,2,2,3,2,5), 6)
|
|
|
|
self.assertEqual(indexOf("122325", "2"), 1)
|
|
self.assertEqual(indexOf("122325", "5"), 5)
|
|
self.assertRaises(ValueError, indexOf, "122325", "6")
|
|
|
|
self.assertRaises(TypeError, indexOf, 42, 1)
|
|
self.assertRaises(TypeError, indexOf, indexOf, indexOf)
|
|
self.assertRaises(ZeroDivisionError, indexOf, BadIterableClass(), 1)
|
|
|
|
f = open(TESTFN, "w", encoding="utf-8")
|
|
try:
|
|
f.write("a\n" "b\n" "c\n" "d\n" "e\n")
|
|
finally:
|
|
f.close()
|
|
f = open(TESTFN, "r", encoding="utf-8")
|
|
try:
|
|
fiter = iter(f)
|
|
self.assertEqual(indexOf(fiter, "b\n"), 1)
|
|
self.assertEqual(indexOf(fiter, "d\n"), 1)
|
|
self.assertEqual(indexOf(fiter, "e\n"), 0)
|
|
self.assertRaises(ValueError, indexOf, fiter, "a\n")
|
|
finally:
|
|
f.close()
|
|
try:
|
|
unlink(TESTFN)
|
|
except OSError:
|
|
pass
|
|
|
|
iclass = IteratingSequenceClass(3)
|
|
for i in range(3):
|
|
self.assertEqual(indexOf(iclass, i), i)
|
|
self.assertRaises(ValueError, indexOf, iclass, -1)
|
|
|
|
# Test iterators with file.writelines().
|
|
def test_writelines(self):
|
|
f = open(TESTFN, "w", encoding="utf-8")
|
|
|
|
try:
|
|
self.assertRaises(TypeError, f.writelines, None)
|
|
self.assertRaises(TypeError, f.writelines, 42)
|
|
|
|
f.writelines(["1\n", "2\n"])
|
|
f.writelines(("3\n", "4\n"))
|
|
f.writelines({'5\n': None})
|
|
f.writelines({})
|
|
|
|
# Try a big chunk too.
|
|
class Iterator:
|
|
def __init__(self, start, finish):
|
|
self.start = start
|
|
self.finish = finish
|
|
self.i = self.start
|
|
|
|
def __next__(self):
|
|
if self.i >= self.finish:
|
|
raise StopIteration
|
|
result = str(self.i) + '\n'
|
|
self.i += 1
|
|
return result
|
|
|
|
def __iter__(self):
|
|
return self
|
|
|
|
class Whatever:
|
|
def __init__(self, start, finish):
|
|
self.start = start
|
|
self.finish = finish
|
|
|
|
def __iter__(self):
|
|
return Iterator(self.start, self.finish)
|
|
|
|
f.writelines(Whatever(6, 6+2000))
|
|
f.close()
|
|
|
|
f = open(TESTFN, encoding="utf-8")
|
|
expected = [str(i) + "\n" for i in range(1, 2006)]
|
|
self.assertEqual(list(f), expected)
|
|
|
|
finally:
|
|
f.close()
|
|
try:
|
|
unlink(TESTFN)
|
|
except OSError:
|
|
pass
|
|
|
|
|
|
# Test iterators on RHS of unpacking assignments.
|
|
def test_unpack_iter(self):
|
|
a, b = 1, 2
|
|
self.assertEqual((a, b), (1, 2))
|
|
|
|
a, b, c = IteratingSequenceClass(3)
|
|
self.assertEqual((a, b, c), (0, 1, 2))
|
|
|
|
try: # too many values
|
|
a, b = IteratingSequenceClass(3)
|
|
except ValueError:
|
|
pass
|
|
else:
|
|
self.fail("should have raised ValueError")
|
|
|
|
try: # not enough values
|
|
a, b, c = IteratingSequenceClass(2)
|
|
except ValueError:
|
|
pass
|
|
else:
|
|
self.fail("should have raised ValueError")
|
|
|
|
try: # not iterable
|
|
a, b, c = len
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
self.fail("should have raised TypeError")
|
|
|
|
a, b, c = {1: 42, 2: 42, 3: 42}.values()
|
|
self.assertEqual((a, b, c), (42, 42, 42))
|
|
|
|
f = open(TESTFN, "w", encoding="utf-8")
|
|
lines = ("a\n", "bb\n", "ccc\n")
|
|
try:
|
|
for line in lines:
|
|
f.write(line)
|
|
finally:
|
|
f.close()
|
|
f = open(TESTFN, "r", encoding="utf-8")
|
|
try:
|
|
a, b, c = f
|
|
self.assertEqual((a, b, c), lines)
|
|
finally:
|
|
f.close()
|
|
try:
|
|
unlink(TESTFN)
|
|
except OSError:
|
|
pass
|
|
|
|
(a, b), (c,) = IteratingSequenceClass(2), {42: 24}
|
|
self.assertEqual((a, b, c), (0, 1, 42))
|
|
|
|
|
|
@cpython_only
|
|
def test_ref_counting_behavior(self):
|
|
class C(object):
|
|
count = 0
|
|
def __new__(cls):
|
|
cls.count += 1
|
|
return object.__new__(cls)
|
|
def __del__(self):
|
|
cls = self.__class__
|
|
assert cls.count > 0
|
|
cls.count -= 1
|
|
x = C()
|
|
self.assertEqual(C.count, 1)
|
|
del x
|
|
self.assertEqual(C.count, 0)
|
|
l = [C(), C(), C()]
|
|
self.assertEqual(C.count, 3)
|
|
try:
|
|
a, b = iter(l)
|
|
except ValueError:
|
|
pass
|
|
del l
|
|
self.assertEqual(C.count, 0)
|
|
|
|
|
|
# Make sure StopIteration is a "sink state".
|
|
# This tests various things that weren't sink states in Python 2.2.1,
|
|
# plus various things that always were fine.
|
|
|
|
def test_sinkstate_list(self):
|
|
# This used to fail
|
|
a = list(range(5))
|
|
b = iter(a)
|
|
self.assertEqual(list(b), list(range(5)))
|
|
a.extend(range(5, 10))
|
|
self.assertEqual(list(b), [])
|
|
|
|
def test_sinkstate_tuple(self):
|
|
a = (0, 1, 2, 3, 4)
|
|
b = iter(a)
|
|
self.assertEqual(list(b), list(range(5)))
|
|
self.assertEqual(list(b), [])
|
|
|
|
def test_sinkstate_string(self):
|
|
a = "abcde"
|
|
b = iter(a)
|
|
self.assertEqual(list(b), ['a', 'b', 'c', 'd', 'e'])
|
|
self.assertEqual(list(b), [])
|
|
|
|
def test_sinkstate_sequence(self):
|
|
# This used to fail
|
|
a = SequenceClass(5)
|
|
b = iter(a)
|
|
self.assertEqual(list(b), list(range(5)))
|
|
a.n = 10
|
|
self.assertEqual(list(b), [])
|
|
|
|
def test_sinkstate_callable(self):
|
|
# This used to fail
|
|
def spam(state=[0]):
|
|
i = state[0]
|
|
state[0] = i+1
|
|
if i == 10:
|
|
raise AssertionError("shouldn't have gotten this far")
|
|
return i
|
|
b = iter(spam, 5)
|
|
self.assertEqual(list(b), list(range(5)))
|
|
self.assertEqual(list(b), [])
|
|
|
|
def test_sinkstate_dict(self):
|
|
# XXX For a more thorough test, see towards the end of:
|
|
# http://mail.python.org/pipermail/python-dev/2002-July/026512.html
|
|
a = {1:1, 2:2, 0:0, 4:4, 3:3}
|
|
for b in iter(a), a.keys(), a.items(), a.values():
|
|
b = iter(a)
|
|
self.assertEqual(len(list(b)), 5)
|
|
self.assertEqual(list(b), [])
|
|
|
|
def test_sinkstate_yield(self):
|
|
def gen():
|
|
for i in range(5):
|
|
yield i
|
|
b = gen()
|
|
self.assertEqual(list(b), list(range(5)))
|
|
self.assertEqual(list(b), [])
|
|
|
|
def test_sinkstate_range(self):
|
|
a = range(5)
|
|
b = iter(a)
|
|
self.assertEqual(list(b), list(range(5)))
|
|
self.assertEqual(list(b), [])
|
|
|
|
def test_sinkstate_enumerate(self):
|
|
a = range(5)
|
|
e = enumerate(a)
|
|
b = iter(e)
|
|
self.assertEqual(list(b), list(zip(range(5), range(5))))
|
|
self.assertEqual(list(b), [])
|
|
|
|
def test_3720(self):
|
|
# Avoid a crash, when an iterator deletes its next() method.
|
|
class BadIterator(object):
|
|
def __iter__(self):
|
|
return self
|
|
def __next__(self):
|
|
del BadIterator.__next__
|
|
return 1
|
|
|
|
try:
|
|
for i in BadIterator() :
|
|
pass
|
|
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)
|
|
|
|
@cpython_only
|
|
def test_iter_overflow(self):
|
|
# Test for the issue 22939
|
|
it = iter(UnlimitedSequenceClass())
|
|
# Manually set `it_index` to PY_SSIZE_T_MAX-2 without a loop
|
|
it.__setstate__(sys.maxsize - 2)
|
|
self.assertEqual(next(it), sys.maxsize - 2)
|
|
self.assertEqual(next(it), sys.maxsize - 1)
|
|
with self.assertRaises(OverflowError):
|
|
next(it)
|
|
# Check that Overflow error is always raised
|
|
with self.assertRaises(OverflowError):
|
|
next(it)
|
|
|
|
def test_iter_neg_setstate(self):
|
|
it = iter(UnlimitedSequenceClass())
|
|
it.__setstate__(-42)
|
|
self.assertEqual(next(it), 0)
|
|
self.assertEqual(next(it), 1)
|
|
|
|
def test_free_after_iterating(self):
|
|
check_free_after_iterating(self, iter, SequenceClass, (0,))
|
|
|
|
def test_error_iter(self):
|
|
for typ in (DefaultIterClass, NoIterClass):
|
|
self.assertRaises(TypeError, iter, typ())
|
|
self.assertRaises(ZeroDivisionError, iter, BadIterableClass())
|
|
|
|
def test_exception_locations(self):
|
|
# The location of an exception raised from __init__ or
|
|
# __next__ should be the iterator expression
|
|
|
|
def init_raises():
|
|
try:
|
|
for x in BrokenIter(init_raises=True):
|
|
pass
|
|
except Exception as e:
|
|
return e
|
|
|
|
def next_raises():
|
|
try:
|
|
for x in BrokenIter(next_raises=True):
|
|
pass
|
|
except Exception as e:
|
|
return e
|
|
|
|
def iter_raises():
|
|
try:
|
|
for x in BrokenIter(iter_raises=True):
|
|
pass
|
|
except Exception as e:
|
|
return e
|
|
|
|
for func, expected in [(init_raises, "BrokenIter(init_raises=True)"),
|
|
(next_raises, "BrokenIter(next_raises=True)"),
|
|
(iter_raises, "BrokenIter(iter_raises=True)"),
|
|
]:
|
|
with self.subTest(func):
|
|
exc = func()
|
|
f = traceback.extract_tb(exc.__traceback__)[0]
|
|
indent = 16
|
|
co = func.__code__
|
|
self.assertEqual(f.lineno, co.co_firstlineno + 2)
|
|
self.assertEqual(f.end_lineno, co.co_firstlineno + 2)
|
|
self.assertEqual(f.line[f.colno - indent : f.end_colno - indent],
|
|
expected)
|
|
|
|
|
|
|
|
if __name__ == "__main__":
|
|
unittest.main()
|