Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 1 | """Unit tests for collections.py.""" |
| 2 | |
Christian Heimes | 25bb783 | 2008-01-11 16:17:00 +0000 | [diff] [blame] | 3 | import unittest, doctest |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 4 | import inspect |
Benjamin Peterson | ee8712c | 2008-05-20 21:35:26 +0000 | [diff] [blame] | 5 | from test import support |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 6 | from collections import namedtuple, Counter, OrderedDict |
| 7 | from test import mapping_tests |
Georg Brandl | c28e1fa | 2008-06-10 19:20:26 +0000 | [diff] [blame] | 8 | import pickle, copy |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 9 | from random import randrange, shuffle |
Raymond Hettinger | 4d2073a | 2009-01-20 03:41:22 +0000 | [diff] [blame] | 10 | import operator |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 11 | from collections import Hashable, Iterable, Iterator |
| 12 | from collections import Sized, Container, Callable |
| 13 | from collections import Set, MutableSet |
| 14 | from collections import Mapping, MutableMapping |
| 15 | from collections import Sequence, MutableSequence |
Guido van Rossum | d05eb00 | 2007-11-21 22:26:24 +0000 | [diff] [blame] | 16 | from collections import ByteString |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 17 | |
Georg Brandl | c28e1fa | 2008-06-10 19:20:26 +0000 | [diff] [blame] | 18 | TestNT = namedtuple('TestNT', 'x y z') # type used for pickle tests |
Guido van Rossum | d8faa36 | 2007-04-27 19:54:29 +0000 | [diff] [blame] | 19 | |
| 20 | class TestNamedTuple(unittest.TestCase): |
| 21 | |
| 22 | def test_factory(self): |
Guido van Rossum | 8ce8a78 | 2007-11-01 19:42:39 +0000 | [diff] [blame] | 23 | Point = namedtuple('Point', 'x y') |
Guido van Rossum | d8faa36 | 2007-04-27 19:54:29 +0000 | [diff] [blame] | 24 | self.assertEqual(Point.__name__, 'Point') |
| 25 | self.assertEqual(Point.__doc__, 'Point(x, y)') |
| 26 | self.assertEqual(Point.__slots__, ()) |
| 27 | self.assertEqual(Point.__module__, __name__) |
| 28 | self.assertEqual(Point.__getitem__, tuple.__getitem__) |
Christian Heimes | faf2f63 | 2008-01-06 16:59:19 +0000 | [diff] [blame] | 29 | self.assertEqual(Point._fields, ('x', 'y')) |
Guido van Rossum | 8ce8a78 | 2007-11-01 19:42:39 +0000 | [diff] [blame] | 30 | |
| 31 | self.assertRaises(ValueError, namedtuple, 'abc%', 'efg ghi') # type has non-alpha char |
| 32 | self.assertRaises(ValueError, namedtuple, 'class', 'efg ghi') # type has keyword |
| 33 | self.assertRaises(ValueError, namedtuple, '9abc', 'efg ghi') # type starts with digit |
| 34 | |
| 35 | self.assertRaises(ValueError, namedtuple, 'abc', 'efg g%hi') # field with non-alpha char |
| 36 | self.assertRaises(ValueError, namedtuple, 'abc', 'abc class') # field has keyword |
| 37 | self.assertRaises(ValueError, namedtuple, 'abc', '8efg 9ghi') # field starts with digit |
Christian Heimes | 0449f63 | 2007-12-15 01:27:15 +0000 | [diff] [blame] | 38 | self.assertRaises(ValueError, namedtuple, 'abc', '_efg ghi') # field with leading underscore |
Guido van Rossum | 8ce8a78 | 2007-11-01 19:42:39 +0000 | [diff] [blame] | 39 | self.assertRaises(ValueError, namedtuple, 'abc', 'efg efg ghi') # duplicate field |
| 40 | |
| 41 | namedtuple('Point0', 'x1 y2') # Verify that numbers are allowed in names |
Christian Heimes | 0449f63 | 2007-12-15 01:27:15 +0000 | [diff] [blame] | 42 | namedtuple('_', 'a b c') # Test leading underscores in a typename |
Guido van Rossum | d8faa36 | 2007-04-27 19:54:29 +0000 | [diff] [blame] | 43 | |
Benjamin Peterson | e9bbc8b | 2008-09-28 02:06:32 +0000 | [diff] [blame] | 44 | nt = namedtuple('nt', 'the quick brown fox') # check unicode input |
| 45 | self.assert_("u'" not in repr(nt._fields)) |
| 46 | nt = namedtuple('nt', ('the', 'quick')) # check unicode input |
| 47 | self.assert_("u'" not in repr(nt._fields)) |
| 48 | |
Christian Heimes | faf2f63 | 2008-01-06 16:59:19 +0000 | [diff] [blame] | 49 | self.assertRaises(TypeError, Point._make, [11]) # catch too few args |
| 50 | self.assertRaises(TypeError, Point._make, [11, 22, 33]) # catch too many args |
| 51 | |
Benjamin Peterson | a86f2c0 | 2009-02-10 02:41:10 +0000 | [diff] [blame] | 52 | def test_name_fixer(self): |
| 53 | for spec, renamed in [ |
Raymond Hettinger | 5614524 | 2009-04-02 22:31:59 +0000 | [diff] [blame^] | 54 | [('efg', 'g%hi'), ('efg', '_1')], # field with non-alpha char |
| 55 | [('abc', 'class'), ('abc', '_1')], # field has keyword |
| 56 | [('8efg', '9ghi'), ('_0', '_1')], # field starts with digit |
| 57 | [('abc', '_efg'), ('abc', '_1')], # field with leading underscore |
| 58 | [('abc', 'efg', 'efg', 'ghi'), ('abc', 'efg', '_2', 'ghi')], # duplicate field |
| 59 | [('abc', '', 'x'), ('abc', '_1', 'x')], # fieldname is a space |
Benjamin Peterson | a86f2c0 | 2009-02-10 02:41:10 +0000 | [diff] [blame] | 60 | ]: |
| 61 | self.assertEqual(namedtuple('NT', spec, rename=True)._fields, renamed) |
| 62 | |
Guido van Rossum | d8faa36 | 2007-04-27 19:54:29 +0000 | [diff] [blame] | 63 | def test_instance(self): |
Guido van Rossum | 8ce8a78 | 2007-11-01 19:42:39 +0000 | [diff] [blame] | 64 | Point = namedtuple('Point', 'x y') |
Guido van Rossum | d8faa36 | 2007-04-27 19:54:29 +0000 | [diff] [blame] | 65 | p = Point(11, 22) |
| 66 | self.assertEqual(p, Point(x=11, y=22)) |
| 67 | self.assertEqual(p, Point(11, y=22)) |
| 68 | self.assertEqual(p, Point(y=22, x=11)) |
| 69 | self.assertEqual(p, Point(*(11, 22))) |
| 70 | self.assertEqual(p, Point(**dict(x=11, y=22))) |
| 71 | self.assertRaises(TypeError, Point, 1) # too few args |
| 72 | self.assertRaises(TypeError, Point, 1, 2, 3) # too many args |
| 73 | self.assertRaises(TypeError, eval, 'Point(XXX=1, y=2)', locals()) # wrong keyword argument |
| 74 | self.assertRaises(TypeError, eval, 'Point(x=1)', locals()) # missing keyword argument |
| 75 | self.assertEqual(repr(p), 'Point(x=11, y=22)') |
| 76 | self.assert_('__dict__' not in dir(p)) # verify instance has no dict |
| 77 | self.assert_('__weakref__' not in dir(p)) |
Christian Heimes | faf2f63 | 2008-01-06 16:59:19 +0000 | [diff] [blame] | 78 | self.assertEqual(p, Point._make([11, 22])) # test _make classmethod |
Christian Heimes | 0449f63 | 2007-12-15 01:27:15 +0000 | [diff] [blame] | 79 | self.assertEqual(p._fields, ('x', 'y')) # test _fields attribute |
| 80 | self.assertEqual(p._replace(x=1), (1, 22)) # test _replace method |
| 81 | self.assertEqual(p._asdict(), dict(x=11, y=22)) # test _asdict method |
Thomas Wouters | 1b7f891 | 2007-09-19 03:06:30 +0000 | [diff] [blame] | 82 | |
Guido van Rossum | 3d392eb | 2007-11-16 00:35:22 +0000 | [diff] [blame] | 83 | try: |
Christian Heimes | faf2f63 | 2008-01-06 16:59:19 +0000 | [diff] [blame] | 84 | p._replace(x=1, error=2) |
| 85 | except ValueError: |
Guido van Rossum | 3d392eb | 2007-11-16 00:35:22 +0000 | [diff] [blame] | 86 | pass |
| 87 | else: |
Christian Heimes | faf2f63 | 2008-01-06 16:59:19 +0000 | [diff] [blame] | 88 | self._fail('Did not detect an incorrect fieldname') |
Guido van Rossum | 3d392eb | 2007-11-16 00:35:22 +0000 | [diff] [blame] | 89 | |
Thomas Wouters | 1b7f891 | 2007-09-19 03:06:30 +0000 | [diff] [blame] | 90 | # verify that field string can have commas |
Guido van Rossum | 8ce8a78 | 2007-11-01 19:42:39 +0000 | [diff] [blame] | 91 | Point = namedtuple('Point', 'x, y') |
| 92 | p = Point(x=11, y=22) |
| 93 | self.assertEqual(repr(p), 'Point(x=11, y=22)') |
| 94 | |
| 95 | # verify that fieldspec can be a non-string sequence |
| 96 | Point = namedtuple('Point', ('x', 'y')) |
Thomas Wouters | 1b7f891 | 2007-09-19 03:06:30 +0000 | [diff] [blame] | 97 | p = Point(x=11, y=22) |
| 98 | self.assertEqual(repr(p), 'Point(x=11, y=22)') |
Guido van Rossum | d8faa36 | 2007-04-27 19:54:29 +0000 | [diff] [blame] | 99 | |
| 100 | def test_tupleness(self): |
Guido van Rossum | 8ce8a78 | 2007-11-01 19:42:39 +0000 | [diff] [blame] | 101 | Point = namedtuple('Point', 'x y') |
Guido van Rossum | d8faa36 | 2007-04-27 19:54:29 +0000 | [diff] [blame] | 102 | p = Point(11, 22) |
| 103 | |
| 104 | self.assert_(isinstance(p, tuple)) |
| 105 | self.assertEqual(p, (11, 22)) # matches a real tuple |
| 106 | self.assertEqual(tuple(p), (11, 22)) # coercable to a real tuple |
| 107 | self.assertEqual(list(p), [11, 22]) # coercable to a list |
| 108 | self.assertEqual(max(p), 22) # iterable |
| 109 | self.assertEqual(max(*p), 22) # star-able |
| 110 | x, y = p |
| 111 | self.assertEqual(p, (x, y)) # unpacks like a tuple |
| 112 | self.assertEqual((p[0], p[1]), (11, 22)) # indexable like a tuple |
| 113 | self.assertRaises(IndexError, p.__getitem__, 3) |
| 114 | |
| 115 | self.assertEqual(p.x, x) |
| 116 | self.assertEqual(p.y, y) |
| 117 | self.assertRaises(AttributeError, eval, 'p.z', locals()) |
| 118 | |
Thomas Wouters | 1b7f891 | 2007-09-19 03:06:30 +0000 | [diff] [blame] | 119 | def test_odd_sizes(self): |
Guido van Rossum | 8ce8a78 | 2007-11-01 19:42:39 +0000 | [diff] [blame] | 120 | Zero = namedtuple('Zero', '') |
Thomas Wouters | 1b7f891 | 2007-09-19 03:06:30 +0000 | [diff] [blame] | 121 | self.assertEqual(Zero(), ()) |
Christian Heimes | faf2f63 | 2008-01-06 16:59:19 +0000 | [diff] [blame] | 122 | self.assertEqual(Zero._make([]), ()) |
Christian Heimes | 99170a5 | 2007-12-19 02:07:34 +0000 | [diff] [blame] | 123 | self.assertEqual(repr(Zero()), 'Zero()') |
| 124 | self.assertEqual(Zero()._asdict(), {}) |
| 125 | self.assertEqual(Zero()._fields, ()) |
| 126 | |
Guido van Rossum | 8ce8a78 | 2007-11-01 19:42:39 +0000 | [diff] [blame] | 127 | Dot = namedtuple('Dot', 'd') |
Thomas Wouters | 1b7f891 | 2007-09-19 03:06:30 +0000 | [diff] [blame] | 128 | self.assertEqual(Dot(1), (1,)) |
Christian Heimes | faf2f63 | 2008-01-06 16:59:19 +0000 | [diff] [blame] | 129 | self.assertEqual(Dot._make([1]), (1,)) |
Christian Heimes | 99170a5 | 2007-12-19 02:07:34 +0000 | [diff] [blame] | 130 | self.assertEqual(Dot(1).d, 1) |
| 131 | self.assertEqual(repr(Dot(1)), 'Dot(d=1)') |
| 132 | self.assertEqual(Dot(1)._asdict(), {'d':1}) |
| 133 | self.assertEqual(Dot(1)._replace(d=999), (999,)) |
| 134 | self.assertEqual(Dot(1)._fields, ('d',)) |
Thomas Wouters | 1b7f891 | 2007-09-19 03:06:30 +0000 | [diff] [blame] | 135 | |
Georg Brandl | c28e1fa | 2008-06-10 19:20:26 +0000 | [diff] [blame] | 136 | # n = 5000 |
Christian Heimes | 99170a5 | 2007-12-19 02:07:34 +0000 | [diff] [blame] | 137 | n = 254 # SyntaxError: more than 255 arguments: |
| 138 | import string, random |
Georg Brandl | b533e26 | 2008-05-25 18:19:30 +0000 | [diff] [blame] | 139 | names = list(set(''.join([random.choice(string.ascii_letters) |
| 140 | for j in range(10)]) for i in range(n))) |
| 141 | n = len(names) |
Christian Heimes | 99170a5 | 2007-12-19 02:07:34 +0000 | [diff] [blame] | 142 | Big = namedtuple('Big', names) |
| 143 | b = Big(*range(n)) |
| 144 | self.assertEqual(b, tuple(range(n))) |
Christian Heimes | faf2f63 | 2008-01-06 16:59:19 +0000 | [diff] [blame] | 145 | self.assertEqual(Big._make(range(n)), tuple(range(n))) |
Christian Heimes | 99170a5 | 2007-12-19 02:07:34 +0000 | [diff] [blame] | 146 | for pos, name in enumerate(names): |
| 147 | self.assertEqual(getattr(b, name), pos) |
| 148 | repr(b) # make sure repr() doesn't blow-up |
| 149 | d = b._asdict() |
| 150 | d_expected = dict(zip(names, range(n))) |
| 151 | self.assertEqual(d, d_expected) |
| 152 | b2 = b._replace(**dict([(names[1], 999),(names[-5], 42)])) |
| 153 | b2_expected = list(range(n)) |
| 154 | b2_expected[1] = 999 |
| 155 | b2_expected[-5] = 42 |
| 156 | self.assertEqual(b2, tuple(b2_expected)) |
| 157 | self.assertEqual(b._fields, tuple(names)) |
Guido van Rossum | d8faa36 | 2007-04-27 19:54:29 +0000 | [diff] [blame] | 158 | |
Georg Brandl | c28e1fa | 2008-06-10 19:20:26 +0000 | [diff] [blame] | 159 | def test_pickle(self): |
| 160 | p = TestNT(x=10, y=20, z=30) |
| 161 | for module in (pickle,): |
| 162 | loads = getattr(module, 'loads') |
| 163 | dumps = getattr(module, 'dumps') |
| 164 | for protocol in -1, 0, 1, 2: |
| 165 | q = loads(dumps(p, protocol)) |
| 166 | self.assertEqual(p, q) |
| 167 | self.assertEqual(p._fields, q._fields) |
| 168 | |
| 169 | def test_copy(self): |
| 170 | p = TestNT(x=10, y=20, z=30) |
| 171 | for copier in copy.copy, copy.deepcopy: |
| 172 | q = copier(p) |
| 173 | self.assertEqual(p, q) |
| 174 | self.assertEqual(p._fields, q._fields) |
| 175 | |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 176 | class ABCTestCase(unittest.TestCase): |
| 177 | |
| 178 | def validate_abstract_methods(self, abc, *names): |
| 179 | methodstubs = dict.fromkeys(names, lambda s, *args: 0) |
| 180 | |
| 181 | # everything should work will all required methods are present |
| 182 | C = type('C', (abc,), methodstubs) |
| 183 | C() |
| 184 | |
| 185 | # instantiation should fail if a required method is missing |
| 186 | for name in names: |
| 187 | stubs = methodstubs.copy() |
| 188 | del stubs[name] |
| 189 | C = type('C', (abc,), stubs) |
| 190 | self.assertRaises(TypeError, C, name) |
| 191 | |
| 192 | |
| 193 | class TestOneTrickPonyABCs(ABCTestCase): |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 194 | |
| 195 | def test_Hashable(self): |
| 196 | # Check some non-hashables |
Guido van Rossum | 254348e | 2007-11-21 19:29:53 +0000 | [diff] [blame] | 197 | non_samples = [bytearray(), list(), set(), dict()] |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 198 | for x in non_samples: |
| 199 | self.failIf(isinstance(x, Hashable), repr(x)) |
| 200 | self.failIf(issubclass(type(x), Hashable), repr(type(x))) |
| 201 | # Check some hashables |
| 202 | samples = [None, |
| 203 | int(), float(), complex(), |
Guido van Rossum | 07d4e78 | 2007-07-03 16:59:47 +0000 | [diff] [blame] | 204 | str(), |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 205 | tuple(), frozenset(), |
Guido van Rossum | 98297ee | 2007-11-06 21:34:58 +0000 | [diff] [blame] | 206 | int, list, object, type, bytes() |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 207 | ] |
| 208 | for x in samples: |
| 209 | self.failUnless(isinstance(x, Hashable), repr(x)) |
| 210 | self.failUnless(issubclass(type(x), Hashable), repr(type(x))) |
| 211 | self.assertRaises(TypeError, Hashable) |
| 212 | # Check direct subclassing |
| 213 | class H(Hashable): |
| 214 | def __hash__(self): |
| 215 | return super().__hash__() |
| 216 | self.assertEqual(hash(H()), 0) |
| 217 | self.failIf(issubclass(int, H)) |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 218 | self.validate_abstract_methods(Hashable, '__hash__') |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 219 | |
| 220 | def test_Iterable(self): |
| 221 | # Check some non-iterables |
| 222 | non_samples = [None, 42, 3.14, 1j] |
| 223 | for x in non_samples: |
| 224 | self.failIf(isinstance(x, Iterable), repr(x)) |
| 225 | self.failIf(issubclass(type(x), Iterable), repr(type(x))) |
| 226 | # Check some iterables |
Guido van Rossum | 07d4e78 | 2007-07-03 16:59:47 +0000 | [diff] [blame] | 227 | samples = [bytes(), str(), |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 228 | tuple(), list(), set(), frozenset(), dict(), |
| 229 | dict().keys(), dict().items(), dict().values(), |
| 230 | (lambda: (yield))(), |
| 231 | (x for x in []), |
| 232 | ] |
| 233 | for x in samples: |
| 234 | self.failUnless(isinstance(x, Iterable), repr(x)) |
| 235 | self.failUnless(issubclass(type(x), Iterable), repr(type(x))) |
| 236 | # Check direct subclassing |
| 237 | class I(Iterable): |
| 238 | def __iter__(self): |
| 239 | return super().__iter__() |
| 240 | self.assertEqual(list(I()), []) |
| 241 | self.failIf(issubclass(str, I)) |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 242 | self.validate_abstract_methods(Iterable, '__iter__') |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 243 | |
| 244 | def test_Iterator(self): |
Guido van Rossum | 07d4e78 | 2007-07-03 16:59:47 +0000 | [diff] [blame] | 245 | non_samples = [None, 42, 3.14, 1j, b"", "", (), [], {}, set()] |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 246 | for x in non_samples: |
| 247 | self.failIf(isinstance(x, Iterator), repr(x)) |
| 248 | self.failIf(issubclass(type(x), Iterator), repr(type(x))) |
Guido van Rossum | 07d4e78 | 2007-07-03 16:59:47 +0000 | [diff] [blame] | 249 | samples = [iter(bytes()), iter(str()), |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 250 | iter(tuple()), iter(list()), iter(dict()), |
| 251 | iter(set()), iter(frozenset()), |
| 252 | iter(dict().keys()), iter(dict().items()), |
| 253 | iter(dict().values()), |
| 254 | (lambda: (yield))(), |
| 255 | (x for x in []), |
| 256 | ] |
| 257 | for x in samples: |
| 258 | self.failUnless(isinstance(x, Iterator), repr(x)) |
| 259 | self.failUnless(issubclass(type(x), Iterator), repr(type(x))) |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 260 | self.validate_abstract_methods(Iterator, '__next__') |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 261 | |
| 262 | def test_Sized(self): |
| 263 | non_samples = [None, 42, 3.14, 1j, |
| 264 | (lambda: (yield))(), |
| 265 | (x for x in []), |
| 266 | ] |
| 267 | for x in non_samples: |
| 268 | self.failIf(isinstance(x, Sized), repr(x)) |
| 269 | self.failIf(issubclass(type(x), Sized), repr(type(x))) |
Guido van Rossum | 07d4e78 | 2007-07-03 16:59:47 +0000 | [diff] [blame] | 270 | samples = [bytes(), str(), |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 271 | tuple(), list(), set(), frozenset(), dict(), |
| 272 | dict().keys(), dict().items(), dict().values(), |
| 273 | ] |
| 274 | for x in samples: |
| 275 | self.failUnless(isinstance(x, Sized), repr(x)) |
| 276 | self.failUnless(issubclass(type(x), Sized), repr(type(x))) |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 277 | self.validate_abstract_methods(Sized, '__len__') |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 278 | |
| 279 | def test_Container(self): |
| 280 | non_samples = [None, 42, 3.14, 1j, |
| 281 | (lambda: (yield))(), |
| 282 | (x for x in []), |
| 283 | ] |
| 284 | for x in non_samples: |
| 285 | self.failIf(isinstance(x, Container), repr(x)) |
| 286 | self.failIf(issubclass(type(x), Container), repr(type(x))) |
Guido van Rossum | 07d4e78 | 2007-07-03 16:59:47 +0000 | [diff] [blame] | 287 | samples = [bytes(), str(), |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 288 | tuple(), list(), set(), frozenset(), dict(), |
| 289 | dict().keys(), dict().items(), |
| 290 | ] |
| 291 | for x in samples: |
| 292 | self.failUnless(isinstance(x, Container), repr(x)) |
| 293 | self.failUnless(issubclass(type(x), Container), repr(type(x))) |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 294 | self.validate_abstract_methods(Container, '__contains__') |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 295 | |
| 296 | def test_Callable(self): |
| 297 | non_samples = [None, 42, 3.14, 1j, |
| 298 | "", b"", (), [], {}, set(), |
| 299 | (lambda: (yield))(), |
| 300 | (x for x in []), |
| 301 | ] |
| 302 | for x in non_samples: |
| 303 | self.failIf(isinstance(x, Callable), repr(x)) |
| 304 | self.failIf(issubclass(type(x), Callable), repr(type(x))) |
| 305 | samples = [lambda: None, |
| 306 | type, int, object, |
| 307 | len, |
| 308 | list.append, [].append, |
| 309 | ] |
| 310 | for x in samples: |
| 311 | self.failUnless(isinstance(x, Callable), repr(x)) |
| 312 | self.failUnless(issubclass(type(x), Callable), repr(type(x))) |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 313 | self.validate_abstract_methods(Callable, '__call__') |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 314 | |
| 315 | def test_direct_subclassing(self): |
| 316 | for B in Hashable, Iterable, Iterator, Sized, Container, Callable: |
| 317 | class C(B): |
| 318 | pass |
| 319 | self.failUnless(issubclass(C, B)) |
| 320 | self.failIf(issubclass(int, C)) |
| 321 | |
| 322 | def test_registration(self): |
| 323 | for B in Hashable, Iterable, Iterator, Sized, Container, Callable: |
| 324 | class C: |
| 325 | __hash__ = None # Make sure it isn't hashable by default |
| 326 | self.failIf(issubclass(C, B), B.__name__) |
| 327 | B.register(C) |
| 328 | self.failUnless(issubclass(C, B)) |
| 329 | |
Raymond Hettinger | 3f10a95 | 2009-04-01 19:05:50 +0000 | [diff] [blame] | 330 | class WithSet(MutableSet): |
| 331 | |
| 332 | def __init__(self, it=()): |
| 333 | self.data = set(it) |
| 334 | |
| 335 | def __len__(self): |
| 336 | return len(self.data) |
| 337 | |
| 338 | def __iter__(self): |
| 339 | return iter(self.data) |
| 340 | |
| 341 | def __contains__(self, item): |
| 342 | return item in self.data |
| 343 | |
| 344 | def add(self, item): |
| 345 | self.data.add(item) |
| 346 | |
| 347 | def discard(self, item): |
| 348 | self.data.discard(item) |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 349 | |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 350 | class TestCollectionABCs(ABCTestCase): |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 351 | |
| 352 | # XXX For now, we only test some virtual inheritance properties. |
| 353 | # We should also test the proper behavior of the collection ABCs |
| 354 | # as real base classes or mix-in classes. |
| 355 | |
| 356 | def test_Set(self): |
| 357 | for sample in [set, frozenset]: |
| 358 | self.failUnless(isinstance(sample(), Set)) |
| 359 | self.failUnless(issubclass(sample, Set)) |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 360 | self.validate_abstract_methods(Set, '__contains__', '__iter__', '__len__') |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 361 | |
Benjamin Peterson | 4118174 | 2008-07-02 20:22:54 +0000 | [diff] [blame] | 362 | def test_hash_Set(self): |
| 363 | class OneTwoThreeSet(Set): |
| 364 | def __init__(self): |
| 365 | self.contents = [1, 2, 3] |
| 366 | def __contains__(self, x): |
| 367 | return x in self.contents |
| 368 | def __len__(self): |
| 369 | return len(self.contents) |
| 370 | def __iter__(self): |
| 371 | return iter(self.contents) |
| 372 | def __hash__(self): |
| 373 | return self._hash() |
| 374 | a, b = OneTwoThreeSet(), OneTwoThreeSet() |
| 375 | self.failUnless(hash(a) == hash(b)) |
| 376 | |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 377 | def test_MutableSet(self): |
| 378 | self.failUnless(isinstance(set(), MutableSet)) |
| 379 | self.failUnless(issubclass(set, MutableSet)) |
| 380 | self.failIf(isinstance(frozenset(), MutableSet)) |
| 381 | self.failIf(issubclass(frozenset, MutableSet)) |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 382 | self.validate_abstract_methods(MutableSet, '__contains__', '__iter__', '__len__', |
| 383 | 'add', 'discard') |
| 384 | |
Raymond Hettinger | 3f10a95 | 2009-04-01 19:05:50 +0000 | [diff] [blame] | 385 | def test_issue_5647(self): |
| 386 | # MutableSet.__iand__ mutated the set during iteration |
| 387 | s = WithSet('abcd') |
| 388 | s &= WithSet('cdef') # This used to fail |
| 389 | self.assertEqual(set(s), set('cd')) |
| 390 | |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 391 | def test_issue_4920(self): |
| 392 | # MutableSet.pop() method did not work |
| 393 | class MySet(collections.MutableSet): |
| 394 | __slots__=['__s'] |
| 395 | def __init__(self,items=None): |
| 396 | if items is None: |
| 397 | items=[] |
| 398 | self.__s=set(items) |
| 399 | def __contains__(self,v): |
| 400 | return v in self.__s |
| 401 | def __iter__(self): |
| 402 | return iter(self.__s) |
| 403 | def __len__(self): |
| 404 | return len(self.__s) |
| 405 | def add(self,v): |
| 406 | result=v not in self.__s |
| 407 | self.__s.add(v) |
| 408 | return result |
| 409 | def discard(self,v): |
| 410 | result=v in self.__s |
| 411 | self.__s.discard(v) |
| 412 | return result |
| 413 | def __repr__(self): |
| 414 | return "MySet(%s)" % repr(list(self)) |
| 415 | s = MySet([5,43,2,1]) |
| 416 | self.assertEqual(s.pop(), 1) |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 417 | |
| 418 | def test_Mapping(self): |
| 419 | for sample in [dict]: |
| 420 | self.failUnless(isinstance(sample(), Mapping)) |
| 421 | self.failUnless(issubclass(sample, Mapping)) |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 422 | self.validate_abstract_methods(Mapping, '__contains__', '__iter__', '__len__', |
| 423 | '__getitem__') |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 424 | |
| 425 | def test_MutableMapping(self): |
| 426 | for sample in [dict]: |
| 427 | self.failUnless(isinstance(sample(), MutableMapping)) |
| 428 | self.failUnless(issubclass(sample, MutableMapping)) |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 429 | self.validate_abstract_methods(MutableMapping, '__contains__', '__iter__', '__len__', |
| 430 | '__getitem__', '__setitem__', '__delitem__') |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 431 | |
| 432 | def test_Sequence(self): |
| 433 | for sample in [tuple, list, bytes, str]: |
| 434 | self.failUnless(isinstance(sample(), Sequence)) |
| 435 | self.failUnless(issubclass(sample, Sequence)) |
Raymond Hettinger | 9aa53c2 | 2009-02-24 11:25:35 +0000 | [diff] [blame] | 436 | self.failUnless(isinstance(range(10), Sequence)) |
| 437 | self.failUnless(issubclass(range, Sequence)) |
Guido van Rossum | 3172c5d | 2007-10-16 18:12:55 +0000 | [diff] [blame] | 438 | self.failUnless(issubclass(str, Sequence)) |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 439 | self.validate_abstract_methods(Sequence, '__contains__', '__iter__', '__len__', |
| 440 | '__getitem__') |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 441 | |
Guido van Rossum | d05eb00 | 2007-11-21 22:26:24 +0000 | [diff] [blame] | 442 | def test_ByteString(self): |
| 443 | for sample in [bytes, bytearray]: |
| 444 | self.failUnless(isinstance(sample(), ByteString)) |
| 445 | self.failUnless(issubclass(sample, ByteString)) |
| 446 | for sample in [str, list, tuple]: |
| 447 | self.failIf(isinstance(sample(), ByteString)) |
| 448 | self.failIf(issubclass(sample, ByteString)) |
| 449 | self.failIf(isinstance(memoryview(b""), ByteString)) |
| 450 | self.failIf(issubclass(memoryview, ByteString)) |
| 451 | |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 452 | def test_MutableSequence(self): |
Guido van Rossum | d05eb00 | 2007-11-21 22:26:24 +0000 | [diff] [blame] | 453 | for sample in [tuple, str, bytes]: |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 454 | self.failIf(isinstance(sample(), MutableSequence)) |
| 455 | self.failIf(issubclass(sample, MutableSequence)) |
Guido van Rossum | d05eb00 | 2007-11-21 22:26:24 +0000 | [diff] [blame] | 456 | for sample in [list, bytearray]: |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 457 | self.failUnless(isinstance(sample(), MutableSequence)) |
| 458 | self.failUnless(issubclass(sample, MutableSequence)) |
Guido van Rossum | 3172c5d | 2007-10-16 18:12:55 +0000 | [diff] [blame] | 459 | self.failIf(issubclass(str, MutableSequence)) |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 460 | self.validate_abstract_methods(MutableSequence, '__contains__', '__iter__', |
| 461 | '__len__', '__getitem__', '__setitem__', '__delitem__', 'insert') |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 462 | |
Raymond Hettinger | b8baf63 | 2009-01-14 02:20:07 +0000 | [diff] [blame] | 463 | class TestCounter(unittest.TestCase): |
| 464 | |
| 465 | def test_basics(self): |
| 466 | c = Counter('abcaba') |
Raymond Hettinger | 4d2073a | 2009-01-20 03:41:22 +0000 | [diff] [blame] | 467 | self.assertEqual(c, Counter({'a':3 , 'b': 2, 'c': 1})) |
| 468 | self.assertEqual(c, Counter(a=3, b=2, c=1)) |
Raymond Hettinger | b8baf63 | 2009-01-14 02:20:07 +0000 | [diff] [blame] | 469 | self.assert_(isinstance(c, dict)) |
| 470 | self.assert_(isinstance(c, Mapping)) |
| 471 | self.assert_(issubclass(Counter, dict)) |
| 472 | self.assert_(issubclass(Counter, Mapping)) |
| 473 | self.assertEqual(len(c), 3) |
| 474 | self.assertEqual(sum(c.values()), 6) |
| 475 | self.assertEqual(sorted(c.values()), [1, 2, 3]) |
| 476 | self.assertEqual(sorted(c.keys()), ['a', 'b', 'c']) |
| 477 | self.assertEqual(sorted(c), ['a', 'b', 'c']) |
| 478 | self.assertEqual(sorted(c.items()), |
| 479 | [('a', 3), ('b', 2), ('c', 1)]) |
| 480 | self.assertEqual(c['b'], 2) |
| 481 | self.assertEqual(c['z'], 0) |
| 482 | self.assertEqual(c.__contains__('c'), True) |
| 483 | self.assertEqual(c.__contains__('z'), False) |
| 484 | self.assertEqual(c.get('b', 10), 2) |
| 485 | self.assertEqual(c.get('z', 10), 10) |
| 486 | self.assertEqual(c, dict(a=3, b=2, c=1)) |
| 487 | self.assertEqual(repr(c), "Counter({'a': 3, 'b': 2, 'c': 1})") |
| 488 | self.assertEqual(c.most_common(), [('a', 3), ('b', 2), ('c', 1)]) |
| 489 | for i in range(5): |
| 490 | self.assertEqual(c.most_common(i), |
| 491 | [('a', 3), ('b', 2), ('c', 1)][:i]) |
| 492 | self.assertEqual(''.join(sorted(c.elements())), 'aaabbc') |
| 493 | c['a'] += 1 # increment an existing value |
| 494 | c['b'] -= 2 # sub existing value to zero |
| 495 | del c['c'] # remove an entry |
Raymond Hettinger | 4d2073a | 2009-01-20 03:41:22 +0000 | [diff] [blame] | 496 | del c['c'] # make sure that del doesn't raise KeyError |
Raymond Hettinger | b8baf63 | 2009-01-14 02:20:07 +0000 | [diff] [blame] | 497 | c['d'] -= 2 # sub from a missing value |
| 498 | c['e'] = -5 # directly assign a missing value |
| 499 | c['f'] += 4 # add to a missing value |
| 500 | self.assertEqual(c, dict(a=4, b=0, d=-2, e=-5, f=4)) |
| 501 | self.assertEqual(''.join(sorted(c.elements())), 'aaaaffff') |
| 502 | self.assertEqual(c.pop('f'), 4) |
| 503 | self.assertEqual('f' in c, False) |
| 504 | for i in range(3): |
| 505 | elem, cnt = c.popitem() |
| 506 | self.assertEqual(elem in c, False) |
| 507 | c.clear() |
| 508 | self.assertEqual(c, {}) |
| 509 | self.assertEqual(repr(c), 'Counter()') |
| 510 | self.assertRaises(NotImplementedError, Counter.fromkeys, 'abc') |
| 511 | self.assertRaises(TypeError, hash, c) |
Raymond Hettinger | 4d2073a | 2009-01-20 03:41:22 +0000 | [diff] [blame] | 512 | c.update(dict(a=5, b=3)) |
| 513 | c.update(c=1) |
Raymond Hettinger | b8baf63 | 2009-01-14 02:20:07 +0000 | [diff] [blame] | 514 | c.update(Counter('a' * 50 + 'b' * 30)) |
| 515 | c.update() # test case with no args |
| 516 | c.__init__('a' * 500 + 'b' * 300) |
| 517 | c.__init__('cdc') |
| 518 | c.__init__() |
| 519 | self.assertEqual(c, dict(a=555, b=333, c=3, d=1)) |
| 520 | self.assertEqual(c.setdefault('d', 5), 1) |
| 521 | self.assertEqual(c['d'], 1) |
| 522 | self.assertEqual(c.setdefault('e', 5), 5) |
| 523 | self.assertEqual(c['e'], 5) |
| 524 | |
| 525 | def test_copying(self): |
| 526 | # Check that counters are copyable, deepcopyable, picklable, and |
| 527 | #have a repr/eval round-trip |
| 528 | words = Counter('which witch had which witches wrist watch'.split()) |
| 529 | update_test = Counter() |
| 530 | update_test.update(words) |
| 531 | for i, dup in enumerate([ |
| 532 | words.copy(), |
| 533 | copy.copy(words), |
| 534 | copy.deepcopy(words), |
| 535 | pickle.loads(pickle.dumps(words, 0)), |
| 536 | pickle.loads(pickle.dumps(words, 1)), |
| 537 | pickle.loads(pickle.dumps(words, 2)), |
| 538 | pickle.loads(pickle.dumps(words, -1)), |
| 539 | eval(repr(words)), |
| 540 | update_test, |
| 541 | Counter(words), |
| 542 | ]): |
| 543 | msg = (i, dup, words) |
| 544 | self.assert_(dup is not words) |
| 545 | self.assertEquals(dup, words) |
| 546 | self.assertEquals(len(dup), len(words)) |
| 547 | self.assertEquals(type(dup), type(words)) |
| 548 | |
| 549 | def test_conversions(self): |
| 550 | # Convert to: set, list, dict |
| 551 | s = 'she sells sea shells by the sea shore' |
| 552 | self.assertEqual(sorted(Counter(s).elements()), sorted(s)) |
| 553 | self.assertEqual(sorted(Counter(s)), sorted(set(s))) |
| 554 | self.assertEqual(dict(Counter(s)), dict(Counter(s).items())) |
| 555 | self.assertEqual(set(Counter(s)), set(s)) |
| 556 | |
Raymond Hettinger | 670eaec | 2009-01-21 23:14:07 +0000 | [diff] [blame] | 557 | def test_invariant_for_the_in_operator(self): |
| 558 | c = Counter(a=10, b=-2, c=0) |
| 559 | for elem in c: |
| 560 | self.assert_(elem in c) |
| 561 | |
Raymond Hettinger | 4d2073a | 2009-01-20 03:41:22 +0000 | [diff] [blame] | 562 | def test_multiset_operations(self): |
| 563 | # Verify that adding a zero counter will strip zeros and negatives |
| 564 | c = Counter(a=10, b=-2, c=0) + Counter() |
| 565 | self.assertEqual(dict(c), dict(a=10)) |
Raymond Hettinger | b8baf63 | 2009-01-14 02:20:07 +0000 | [diff] [blame] | 566 | |
Raymond Hettinger | 4d2073a | 2009-01-20 03:41:22 +0000 | [diff] [blame] | 567 | elements = 'abcd' |
| 568 | for i in range(1000): |
| 569 | # test random pairs of multisets |
| 570 | p = Counter(dict((elem, randrange(-2,4)) for elem in elements)) |
Raymond Hettinger | e0d1b9f | 2009-01-21 20:36:27 +0000 | [diff] [blame] | 571 | p.update(e=1, f=-1, g=0) |
Raymond Hettinger | 4d2073a | 2009-01-20 03:41:22 +0000 | [diff] [blame] | 572 | q = Counter(dict((elem, randrange(-2,4)) for elem in elements)) |
Raymond Hettinger | e0d1b9f | 2009-01-21 20:36:27 +0000 | [diff] [blame] | 573 | q.update(h=1, i=-1, j=0) |
| 574 | for counterop, numberop in [ |
| 575 | (Counter.__add__, lambda x, y: max(0, x+y)), |
| 576 | (Counter.__sub__, lambda x, y: max(0, x-y)), |
| 577 | (Counter.__or__, lambda x, y: max(0,x,y)), |
| 578 | (Counter.__and__, lambda x, y: max(0, min(x,y))), |
Raymond Hettinger | 4d2073a | 2009-01-20 03:41:22 +0000 | [diff] [blame] | 579 | ]: |
| 580 | result = counterop(p, q) |
| 581 | for x in elements: |
Raymond Hettinger | e0d1b9f | 2009-01-21 20:36:27 +0000 | [diff] [blame] | 582 | self.assertEqual(numberop(p[x], q[x]), result[x], |
| 583 | (counterop, x, p, q)) |
Raymond Hettinger | 4d2073a | 2009-01-20 03:41:22 +0000 | [diff] [blame] | 584 | # verify that results exclude non-positive counts |
| 585 | self.assert_(x>0 for x in result.values()) |
| 586 | |
| 587 | elements = 'abcdef' |
| 588 | for i in range(100): |
| 589 | # verify that random multisets with no repeats are exactly like sets |
| 590 | p = Counter(dict((elem, randrange(0, 2)) for elem in elements)) |
| 591 | q = Counter(dict((elem, randrange(0, 2)) for elem in elements)) |
| 592 | for counterop, setop in [ |
| 593 | (Counter.__sub__, set.__sub__), |
| 594 | (Counter.__or__, set.__or__), |
| 595 | (Counter.__and__, set.__and__), |
| 596 | ]: |
| 597 | counter_result = counterop(p, q) |
| 598 | set_result = setop(set(p.elements()), set(q.elements())) |
| 599 | self.assertEqual(counter_result, dict.fromkeys(set_result, 1)) |
Raymond Hettinger | b8baf63 | 2009-01-14 02:20:07 +0000 | [diff] [blame] | 600 | |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 601 | |
| 602 | class TestOrderedDict(unittest.TestCase): |
| 603 | |
| 604 | def test_init(self): |
| 605 | with self.assertRaises(TypeError): |
| 606 | OrderedDict([('a', 1), ('b', 2)], None) # too many args |
| 607 | pairs = [('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5)] |
| 608 | self.assertEqual(sorted(OrderedDict(dict(pairs)).items()), pairs) # dict input |
| 609 | self.assertEqual(sorted(OrderedDict(**dict(pairs)).items()), pairs) # kwds input |
| 610 | self.assertEqual(list(OrderedDict(pairs).items()), pairs) # pairs input |
| 611 | self.assertEqual(list(OrderedDict([('a', 1), ('b', 2), ('c', 9), ('d', 4)], |
| 612 | c=3, e=5).items()), pairs) # mixed input |
| 613 | |
| 614 | # make sure no positional args conflict with possible kwdargs |
| 615 | self.assertEqual(inspect.getargspec(OrderedDict.__dict__['__init__']).args, |
| 616 | ['self']) |
| 617 | |
| 618 | # Make sure that direct calls to __init__ do not clear previous contents |
| 619 | d = OrderedDict([('a', 1), ('b', 2), ('c', 3), ('d', 44), ('e', 55)]) |
| 620 | d.__init__([('e', 5), ('f', 6)], g=7, d=4) |
| 621 | self.assertEqual(list(d.items()), |
| 622 | [('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5), ('f', 6), ('g', 7)]) |
| 623 | |
| 624 | def test_update(self): |
| 625 | with self.assertRaises(TypeError): |
| 626 | OrderedDict().update([('a', 1), ('b', 2)], None) # too many args |
| 627 | pairs = [('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5)] |
| 628 | od = OrderedDict() |
| 629 | od.update(dict(pairs)) |
| 630 | self.assertEqual(sorted(od.items()), pairs) # dict input |
| 631 | od = OrderedDict() |
| 632 | od.update(**dict(pairs)) |
| 633 | self.assertEqual(sorted(od.items()), pairs) # kwds input |
| 634 | od = OrderedDict() |
| 635 | od.update(pairs) |
| 636 | self.assertEqual(list(od.items()), pairs) # pairs input |
| 637 | od = OrderedDict() |
| 638 | od.update([('a', 1), ('b', 2), ('c', 9), ('d', 4)], c=3, e=5) |
| 639 | self.assertEqual(list(od.items()), pairs) # mixed input |
| 640 | |
| 641 | # Make sure that direct calls to update do not clear previous contents |
| 642 | # add that updates items are not moved to the end |
| 643 | d = OrderedDict([('a', 1), ('b', 2), ('c', 3), ('d', 44), ('e', 55)]) |
| 644 | d.update([('e', 5), ('f', 6)], g=7, d=4) |
| 645 | self.assertEqual(list(d.items()), |
| 646 | [('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5), ('f', 6), ('g', 7)]) |
| 647 | |
| 648 | def test_clear(self): |
| 649 | pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)] |
| 650 | shuffle(pairs) |
| 651 | od = OrderedDict(pairs) |
| 652 | self.assertEqual(len(od), len(pairs)) |
| 653 | od.clear() |
| 654 | self.assertEqual(len(od), 0) |
| 655 | |
| 656 | def test_delitem(self): |
| 657 | pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)] |
| 658 | od = OrderedDict(pairs) |
| 659 | del od['a'] |
| 660 | self.assert_('a' not in od) |
| 661 | with self.assertRaises(KeyError): |
| 662 | del od['a'] |
| 663 | self.assertEqual(list(od.items()), pairs[:2] + pairs[3:]) |
| 664 | |
| 665 | def test_setitem(self): |
| 666 | od = OrderedDict([('d', 1), ('b', 2), ('c', 3), ('a', 4), ('e', 5)]) |
| 667 | od['c'] = 10 # existing element |
| 668 | od['f'] = 20 # new element |
| 669 | self.assertEqual(list(od.items()), |
| 670 | [('d', 1), ('b', 2), ('c', 10), ('a', 4), ('e', 5), ('f', 20)]) |
| 671 | |
| 672 | def test_iterators(self): |
| 673 | pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)] |
| 674 | shuffle(pairs) |
| 675 | od = OrderedDict(pairs) |
| 676 | self.assertEqual(list(od), [t[0] for t in pairs]) |
| 677 | self.assertEqual(list(od.keys()), [t[0] for t in pairs]) |
| 678 | self.assertEqual(list(od.values()), [t[1] for t in pairs]) |
| 679 | self.assertEqual(list(od.items()), pairs) |
| 680 | self.assertEqual(list(reversed(od)), |
| 681 | [t[0] for t in reversed(pairs)]) |
| 682 | |
| 683 | def test_popitem(self): |
| 684 | pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)] |
| 685 | shuffle(pairs) |
| 686 | od = OrderedDict(pairs) |
| 687 | while pairs: |
| 688 | self.assertEqual(od.popitem(), pairs.pop()) |
| 689 | with self.assertRaises(KeyError): |
| 690 | od.popitem() |
| 691 | self.assertEqual(len(od), 0) |
| 692 | |
| 693 | def test_pop(self): |
| 694 | pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)] |
| 695 | shuffle(pairs) |
| 696 | od = OrderedDict(pairs) |
| 697 | shuffle(pairs) |
| 698 | while pairs: |
| 699 | k, v = pairs.pop() |
| 700 | self.assertEqual(od.pop(k), v) |
| 701 | with self.assertRaises(KeyError): |
| 702 | od.pop('xyz') |
| 703 | self.assertEqual(len(od), 0) |
| 704 | self.assertEqual(od.pop(k, 12345), 12345) |
| 705 | |
| 706 | def test_equality(self): |
| 707 | pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)] |
| 708 | shuffle(pairs) |
| 709 | od1 = OrderedDict(pairs) |
| 710 | od2 = OrderedDict(pairs) |
| 711 | self.assertEqual(od1, od2) # same order implies equality |
| 712 | pairs = pairs[2:] + pairs[:2] |
| 713 | od2 = OrderedDict(pairs) |
| 714 | self.assertNotEqual(od1, od2) # different order implies inequality |
| 715 | # comparison to regular dict is not order sensitive |
| 716 | self.assertEqual(od1, dict(od2)) |
| 717 | self.assertEqual(dict(od2), od1) |
| 718 | # different length implied inequality |
| 719 | self.assertNotEqual(od1, OrderedDict(pairs[:-1])) |
| 720 | |
| 721 | def test_copying(self): |
| 722 | # Check that ordered dicts are copyable, deepcopyable, picklable, |
| 723 | # and have a repr/eval round-trip |
| 724 | pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)] |
| 725 | od = OrderedDict(pairs) |
| 726 | update_test = OrderedDict() |
| 727 | update_test.update(od) |
| 728 | for i, dup in enumerate([ |
| 729 | od.copy(), |
| 730 | copy.copy(od), |
| 731 | copy.deepcopy(od), |
| 732 | pickle.loads(pickle.dumps(od, 0)), |
| 733 | pickle.loads(pickle.dumps(od, 1)), |
| 734 | pickle.loads(pickle.dumps(od, 2)), |
| 735 | pickle.loads(pickle.dumps(od, 3)), |
| 736 | pickle.loads(pickle.dumps(od, -1)), |
| 737 | eval(repr(od)), |
| 738 | update_test, |
| 739 | OrderedDict(od), |
| 740 | ]): |
| 741 | self.assert_(dup is not od) |
| 742 | self.assertEquals(dup, od) |
| 743 | self.assertEquals(list(dup.items()), list(od.items())) |
| 744 | self.assertEquals(len(dup), len(od)) |
| 745 | self.assertEquals(type(dup), type(od)) |
| 746 | |
Raymond Hettinger | 5b26fb5 | 2009-03-03 22:38:22 +0000 | [diff] [blame] | 747 | def test_yaml_linkage(self): |
| 748 | # Verify that __reduce__ is setup in a way that supports PyYAML's dump() feature. |
| 749 | # In yaml, lists are native but tuples are not. |
| 750 | pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)] |
| 751 | od = OrderedDict(pairs) |
| 752 | # yaml.dump(od) --> |
| 753 | # '!!python/object/apply:__main__.OrderedDict\n- - [a, 1]\n - [b, 2]\n' |
| 754 | self.assert_(all(type(pair)==list for pair in od.__reduce__()[1])) |
| 755 | |
Raymond Hettinger | b212157 | 2009-03-03 22:50:04 +0000 | [diff] [blame] | 756 | def test_reduce_not_too_fat(self): |
| 757 | # do not save instance dictionary if not needed |
| 758 | pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)] |
| 759 | od = OrderedDict(pairs) |
| 760 | self.assertEqual(len(od.__reduce__()), 2) |
| 761 | od.x = 10 |
| 762 | self.assertEqual(len(od.__reduce__()), 3) |
| 763 | |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 764 | def test_repr(self): |
| 765 | od = OrderedDict([('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)]) |
| 766 | self.assertEqual(repr(od), |
| 767 | "OrderedDict([('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)])") |
| 768 | self.assertEqual(eval(repr(od)), od) |
| 769 | self.assertEqual(repr(OrderedDict()), "OrderedDict()") |
| 770 | |
| 771 | def test_setdefault(self): |
| 772 | pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)] |
| 773 | shuffle(pairs) |
| 774 | od = OrderedDict(pairs) |
| 775 | pair_order = list(od.items()) |
| 776 | self.assertEqual(od.setdefault('a', 10), 3) |
| 777 | # make sure order didn't change |
| 778 | self.assertEqual(list(od.items()), pair_order) |
| 779 | self.assertEqual(od.setdefault('x', 10), 10) |
| 780 | # make sure 'x' is added to the end |
| 781 | self.assertEqual(list(od.items())[-1], ('x', 10)) |
| 782 | |
| 783 | def test_reinsert(self): |
| 784 | # Given insert a, insert b, delete a, re-insert a, |
| 785 | # verify that a is now later than b. |
| 786 | od = OrderedDict() |
| 787 | od['a'] = 1 |
| 788 | od['b'] = 2 |
| 789 | del od['a'] |
| 790 | od['a'] = 1 |
| 791 | self.assertEqual(list(od.items()), [('b', 2), ('a', 1)]) |
| 792 | |
| 793 | |
| 794 | |
| 795 | class GeneralMappingTests(mapping_tests.BasicTestMappingProtocol): |
| 796 | type2test = OrderedDict |
| 797 | |
Raymond Hettinger | dc879f0 | 2009-03-19 20:30:56 +0000 | [diff] [blame] | 798 | def test_popitem(self): |
| 799 | d = self._empty_mapping() |
| 800 | self.assertRaises(KeyError, d.popitem) |
| 801 | |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 802 | class MyOrderedDict(OrderedDict): |
| 803 | pass |
| 804 | |
| 805 | class SubclassMappingTests(mapping_tests.BasicTestMappingProtocol): |
| 806 | type2test = MyOrderedDict |
| 807 | |
Raymond Hettinger | dc879f0 | 2009-03-19 20:30:56 +0000 | [diff] [blame] | 808 | def test_popitem(self): |
| 809 | d = self._empty_mapping() |
| 810 | self.assertRaises(KeyError, d.popitem) |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 811 | |
| 812 | |
Christian Heimes | 25bb783 | 2008-01-11 16:17:00 +0000 | [diff] [blame] | 813 | import doctest, collections |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 814 | |
Guido van Rossum | d8faa36 | 2007-04-27 19:54:29 +0000 | [diff] [blame] | 815 | def test_main(verbose=None): |
Benjamin Peterson | ad9d48d | 2008-04-02 21:49:44 +0000 | [diff] [blame] | 816 | NamedTupleDocs = doctest.DocTestSuite(module=collections) |
Raymond Hettinger | b8baf63 | 2009-01-14 02:20:07 +0000 | [diff] [blame] | 817 | test_classes = [TestNamedTuple, NamedTupleDocs, TestOneTrickPonyABCs, |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 818 | TestCollectionABCs, TestCounter, |
| 819 | TestOrderedDict, GeneralMappingTests, SubclassMappingTests] |
Benjamin Peterson | ee8712c | 2008-05-20 21:35:26 +0000 | [diff] [blame] | 820 | support.run_unittest(*test_classes) |
| 821 | support.run_doctest(collections, verbose) |
Guido van Rossum | d8faa36 | 2007-04-27 19:54:29 +0000 | [diff] [blame] | 822 | |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 823 | |
Guido van Rossum | d8faa36 | 2007-04-27 19:54:29 +0000 | [diff] [blame] | 824 | if __name__ == "__main__": |
| 825 | test_main(verbose=True) |