2002-04-26 16:40:56 -03:00
|
|
|
import unittest
|
|
|
|
|
2002-07-23 16:04:11 -03:00
|
|
|
from test import test_support
|
2002-04-26 16:40:56 -03:00
|
|
|
|
|
|
|
class G:
|
|
|
|
'Sequence using __getitem__'
|
|
|
|
def __init__(self, seqn):
|
|
|
|
self.seqn = seqn
|
|
|
|
def __getitem__(self, i):
|
|
|
|
return self.seqn[i]
|
|
|
|
|
|
|
|
class I:
|
|
|
|
'Sequence using iterator protocol'
|
|
|
|
def __init__(self, seqn):
|
|
|
|
self.seqn = seqn
|
|
|
|
self.i = 0
|
|
|
|
def __iter__(self):
|
|
|
|
return self
|
|
|
|
def next(self):
|
|
|
|
if self.i >= len(self.seqn): raise StopIteration
|
|
|
|
v = self.seqn[self.i]
|
|
|
|
self.i += 1
|
|
|
|
return v
|
|
|
|
|
|
|
|
class Ig:
|
|
|
|
'Sequence using iterator protocol defined with a generator'
|
|
|
|
def __init__(self, seqn):
|
|
|
|
self.seqn = seqn
|
|
|
|
self.i = 0
|
|
|
|
def __iter__(self):
|
|
|
|
for val in self.seqn:
|
|
|
|
yield val
|
|
|
|
|
|
|
|
class X:
|
|
|
|
'Missing __getitem__ and __iter__'
|
|
|
|
def __init__(self, seqn):
|
|
|
|
self.seqn = seqn
|
|
|
|
self.i = 0
|
|
|
|
def next(self):
|
|
|
|
if self.i >= len(self.seqn): raise StopIteration
|
|
|
|
v = self.seqn[self.i]
|
|
|
|
self.i += 1
|
|
|
|
return v
|
|
|
|
|
|
|
|
class E:
|
|
|
|
'Test propagation of exceptions'
|
|
|
|
def __init__(self, seqn):
|
|
|
|
self.seqn = seqn
|
|
|
|
self.i = 0
|
|
|
|
def __iter__(self):
|
|
|
|
return self
|
|
|
|
def next(self):
|
|
|
|
3/0
|
|
|
|
|
|
|
|
class N:
|
|
|
|
'Iterator missing next()'
|
|
|
|
def __init__(self, seqn):
|
|
|
|
self.seqn = seqn
|
|
|
|
self.i = 0
|
|
|
|
def __iter__(self):
|
|
|
|
return self
|
|
|
|
|
|
|
|
class EnumerateTestCase(unittest.TestCase):
|
|
|
|
|
|
|
|
enum = enumerate
|
2003-05-28 11:05:34 -03:00
|
|
|
seq, res = 'abc', [(0,'a'), (1,'b'), (2,'c')]
|
2002-04-26 16:40:56 -03:00
|
|
|
|
|
|
|
def test_basicfunction(self):
|
2003-05-28 11:05:34 -03:00
|
|
|
self.assertEqual(type(self.enum(self.seq)), self.enum)
|
|
|
|
e = self.enum(self.seq)
|
2002-04-26 16:40:56 -03:00
|
|
|
self.assertEqual(iter(e), e)
|
2003-05-28 11:05:34 -03:00
|
|
|
self.assertEqual(list(self.enum(self.seq)), self.res)
|
2002-04-26 16:40:56 -03:00
|
|
|
self.enum.__doc__
|
|
|
|
|
|
|
|
def test_getitemseqn(self):
|
2003-05-28 11:05:34 -03:00
|
|
|
self.assertEqual(list(self.enum(G(self.seq))), self.res)
|
2002-04-26 16:40:56 -03:00
|
|
|
e = self.enum(G(''))
|
|
|
|
self.assertRaises(StopIteration, e.next)
|
|
|
|
|
|
|
|
def test_iteratorseqn(self):
|
2003-05-28 11:05:34 -03:00
|
|
|
self.assertEqual(list(self.enum(I(self.seq))), self.res)
|
2002-04-26 16:40:56 -03:00
|
|
|
e = self.enum(I(''))
|
|
|
|
self.assertRaises(StopIteration, e.next)
|
|
|
|
|
|
|
|
def test_iteratorgenerator(self):
|
2003-05-28 11:05:34 -03:00
|
|
|
self.assertEqual(list(self.enum(Ig(self.seq))), self.res)
|
2002-04-26 16:40:56 -03:00
|
|
|
e = self.enum(Ig(''))
|
|
|
|
self.assertRaises(StopIteration, e.next)
|
|
|
|
|
|
|
|
def test_noniterable(self):
|
2003-05-28 11:05:34 -03:00
|
|
|
self.assertRaises(TypeError, self.enum, X(self.seq))
|
2002-04-26 16:40:56 -03:00
|
|
|
|
|
|
|
def test_illformediterable(self):
|
2003-05-28 11:05:34 -03:00
|
|
|
self.assertRaises(TypeError, list, self.enum(N(self.seq)))
|
2002-04-26 16:40:56 -03:00
|
|
|
|
|
|
|
def test_exception_propagation(self):
|
2003-05-28 11:05:34 -03:00
|
|
|
self.assertRaises(ZeroDivisionError, list, self.enum(E(self.seq)))
|
|
|
|
|
|
|
|
def test_argumentcheck(self):
|
|
|
|
self.assertRaises(TypeError, self.enum) # no arguments
|
|
|
|
self.assertRaises(TypeError, self.enum, 1) # wrong type (not iterable)
|
|
|
|
self.assertRaises(TypeError, self.enum, 'abc', 2) # too many arguments
|
|
|
|
|
|
|
|
def test_tuple_reuse(self):
|
|
|
|
# Tests an implementation detail where tuple is reused
|
|
|
|
# whenever nothing else holds a reference to it
|
2003-11-16 12:17:49 -04:00
|
|
|
self.assertEqual(len(set(map(id, list(enumerate(self.seq))))), len(self.seq))
|
|
|
|
self.assertEqual(len(set(map(id, enumerate(self.seq)))), min(1,len(self.seq)))
|
2002-04-26 16:40:56 -03:00
|
|
|
|
|
|
|
class MyEnum(enumerate):
|
|
|
|
pass
|
|
|
|
|
|
|
|
class SubclassTestCase(EnumerateTestCase):
|
|
|
|
|
|
|
|
enum = MyEnum
|
|
|
|
|
2003-05-28 11:05:34 -03:00
|
|
|
class TestEmpty(EnumerateTestCase):
|
|
|
|
|
|
|
|
seq, res = '', []
|
|
|
|
|
|
|
|
class TestBig(EnumerateTestCase):
|
|
|
|
|
|
|
|
seq = range(10,20000,2)
|
|
|
|
res = zip(range(20000), seq)
|
|
|
|
|
2003-11-06 10:06:48 -04:00
|
|
|
class TestReversed(unittest.TestCase):
|
|
|
|
|
|
|
|
def test_simple(self):
|
|
|
|
class A:
|
|
|
|
def __getitem__(self, i):
|
|
|
|
if i < 5:
|
|
|
|
return str(i)
|
|
|
|
raise StopIteration
|
|
|
|
def __len__(self):
|
|
|
|
return 5
|
|
|
|
for data in 'abc', range(5), tuple(enumerate('abc')), A(), xrange(1,17,5):
|
|
|
|
self.assertEqual(list(data)[::-1], list(reversed(data)))
|
|
|
|
self.assertRaises(TypeError, reversed, {})
|
|
|
|
|
|
|
|
def test_xrange_optimization(self):
|
|
|
|
x = xrange(1)
|
|
|
|
self.assertEqual(type(reversed(x)), type(iter(x)))
|
2003-05-28 11:05:34 -03:00
|
|
|
|
2004-02-08 06:49:42 -04:00
|
|
|
def test_double_reverse(self):
|
|
|
|
s = 'hello'
|
|
|
|
self.assertEqual(list(reversed(reversed(s))), list(s))
|
|
|
|
|
2003-05-28 11:05:34 -03:00
|
|
|
def test_main(verbose=None):
|
2003-11-06 10:06:48 -04:00
|
|
|
testclasses = (EnumerateTestCase, SubclassTestCase, TestEmpty, TestBig,
|
|
|
|
TestReversed)
|
2003-05-28 11:05:34 -03:00
|
|
|
test_support.run_unittest(*testclasses)
|
|
|
|
|
|
|
|
# verify reference counting
|
|
|
|
import sys
|
|
|
|
if verbose and hasattr(sys, "gettotalrefcount"):
|
|
|
|
counts = [None] * 5
|
|
|
|
for i in xrange(len(counts)):
|
|
|
|
test_support.run_unittest(*testclasses)
|
|
|
|
counts[i] = sys.gettotalrefcount()
|
|
|
|
print counts
|
2002-04-26 16:40:56 -03:00
|
|
|
|
|
|
|
if __name__ == "__main__":
|
2003-05-28 11:05:34 -03:00
|
|
|
test_main(verbose=True)
|