Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 1 | """Unit tests for collections.py.""" |
| 2 | |
Benjamin Peterson | 4ad6bd5 | 2010-05-21 20:55:22 +0000 | [diff] [blame] | 3 | import unittest, doctest, operator |
Raymond Hettinger | f6d3e8e | 2011-03-23 20:33:30 -0700 | [diff] [blame] | 4 | from test.support import TESTFN, forget, unlink |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 5 | import inspect |
Benjamin Peterson | ee8712c | 2008-05-20 21:35:26 +0000 | [diff] [blame] | 6 | from test import support |
Raymond Hettinger | 426e052 | 2011-01-03 02:12:02 +0000 | [diff] [blame] | 7 | from collections import namedtuple, Counter, OrderedDict, _count_elements |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 8 | from test import mapping_tests |
Georg Brandl | c28e1fa | 2008-06-10 19:20:26 +0000 | [diff] [blame] | 9 | import pickle, copy |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 10 | from random import randrange, shuffle |
Raymond Hettinger | 499b2ee | 2009-05-27 01:53:46 +0000 | [diff] [blame] | 11 | import keyword |
| 12 | import re |
R. David Murray | 378c0cf | 2010-02-24 01:46:21 +0000 | [diff] [blame] | 13 | import sys |
Raymond Hettinger | 57d1a88 | 2011-02-23 00:46:28 +0000 | [diff] [blame] | 14 | from collections import UserDict |
Raymond Hettinger | 9fe1ccf | 2011-02-26 01:02:51 +0000 | [diff] [blame] | 15 | from collections import ChainMap |
Raymond Hettinger | 32ea165 | 2015-03-21 01:37:37 -0700 | [diff] [blame] | 16 | from collections import deque |
Raymond Hettinger | bd60e8d | 2015-05-09 01:07:23 -0400 | [diff] [blame^] | 17 | from collections.abc import Hashable, Iterable, Iterator, Generator |
Raymond Hettinger | 57d1a88 | 2011-02-23 00:46:28 +0000 | [diff] [blame] | 18 | from collections.abc import Sized, Container, Callable |
| 19 | from collections.abc import Set, MutableSet |
| 20 | from collections.abc import Mapping, MutableMapping, KeysView, ItemsView |
| 21 | from collections.abc import Sequence, MutableSequence |
| 22 | from collections.abc import ByteString |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 23 | |
Raymond Hettinger | 499e193 | 2011-02-23 07:56:53 +0000 | [diff] [blame] | 24 | |
| 25 | ################################################################################ |
Raymond Hettinger | 9fe1ccf | 2011-02-26 01:02:51 +0000 | [diff] [blame] | 26 | ### ChainMap (helper class for configparser and the string module) |
Raymond Hettinger | 499e193 | 2011-02-23 07:56:53 +0000 | [diff] [blame] | 27 | ################################################################################ |
| 28 | |
| 29 | class TestChainMap(unittest.TestCase): |
| 30 | |
| 31 | def test_basics(self): |
| 32 | c = ChainMap() |
| 33 | c['a'] = 1 |
| 34 | c['b'] = 2 |
| 35 | d = c.new_child() |
| 36 | d['b'] = 20 |
| 37 | d['c'] = 30 |
| 38 | self.assertEqual(d.maps, [{'b':20, 'c':30}, {'a':1, 'b':2}]) # check internal state |
| 39 | self.assertEqual(d.items(), dict(a=1, b=20, c=30).items()) # check items/iter/getitem |
| 40 | self.assertEqual(len(d), 3) # check len |
| 41 | for key in 'abc': # check contains |
| 42 | self.assertIn(key, d) |
| 43 | for k, v in dict(a=1, b=20, c=30, z=100).items(): # check get |
| 44 | self.assertEqual(d.get(k, 100), v) |
| 45 | |
| 46 | del d['b'] # unmask a value |
| 47 | self.assertEqual(d.maps, [{'c':30}, {'a':1, 'b':2}]) # check internal state |
| 48 | self.assertEqual(d.items(), dict(a=1, b=2, c=30).items()) # check items/iter/getitem |
| 49 | self.assertEqual(len(d), 3) # check len |
| 50 | for key in 'abc': # check contains |
| 51 | self.assertIn(key, d) |
| 52 | for k, v in dict(a=1, b=2, c=30, z=100).items(): # check get |
| 53 | self.assertEqual(d.get(k, 100), v) |
| 54 | self.assertIn(repr(d), [ # check repr |
| 55 | type(d).__name__ + "({'c': 30}, {'a': 1, 'b': 2})", |
| 56 | type(d).__name__ + "({'c': 30}, {'b': 2, 'a': 1})" |
| 57 | ]) |
| 58 | |
| 59 | for e in d.copy(), copy.copy(d): # check shallow copies |
| 60 | self.assertEqual(d, e) |
| 61 | self.assertEqual(d.maps, e.maps) |
| 62 | self.assertIsNot(d, e) |
| 63 | self.assertIsNot(d.maps[0], e.maps[0]) |
| 64 | for m1, m2 in zip(d.maps[1:], e.maps[1:]): |
| 65 | self.assertIs(m1, m2) |
| 66 | |
Serhiy Storchaka | bad1257 | 2014-12-15 14:03:42 +0200 | [diff] [blame] | 67 | # check deep copies |
| 68 | for proto in range(pickle.HIGHEST_PROTOCOL + 1): |
| 69 | e = pickle.loads(pickle.dumps(d, proto)) |
| 70 | self.assertEqual(d, e) |
| 71 | self.assertEqual(d.maps, e.maps) |
| 72 | self.assertIsNot(d, e) |
| 73 | for m1, m2 in zip(d.maps, e.maps): |
| 74 | self.assertIsNot(m1, m2, e) |
| 75 | for e in [copy.deepcopy(d), |
Raymond Hettinger | 499e193 | 2011-02-23 07:56:53 +0000 | [diff] [blame] | 76 | eval(repr(d)) |
Serhiy Storchaka | bad1257 | 2014-12-15 14:03:42 +0200 | [diff] [blame] | 77 | ]: |
Raymond Hettinger | 499e193 | 2011-02-23 07:56:53 +0000 | [diff] [blame] | 78 | self.assertEqual(d, e) |
| 79 | self.assertEqual(d.maps, e.maps) |
| 80 | self.assertIsNot(d, e) |
| 81 | for m1, m2 in zip(d.maps, e.maps): |
| 82 | self.assertIsNot(m1, m2, e) |
| 83 | |
Raymond Hettinger | d032131 | 2011-02-26 06:53:58 +0000 | [diff] [blame] | 84 | f = d.new_child() |
| 85 | f['b'] = 5 |
| 86 | self.assertEqual(f.maps, [{'b': 5}, {'c':30}, {'a':1, 'b':2}]) |
| 87 | self.assertEqual(f.parents.maps, [{'c':30}, {'a':1, 'b':2}]) # check parents |
| 88 | self.assertEqual(f['b'], 5) # find first in chain |
| 89 | self.assertEqual(f.parents['b'], 2) # look beyond maps[0] |
Raymond Hettinger | 499e193 | 2011-02-23 07:56:53 +0000 | [diff] [blame] | 90 | |
| 91 | def test_contructor(self): |
Raymond Hettinger | d032131 | 2011-02-26 06:53:58 +0000 | [diff] [blame] | 92 | self.assertEqual(ChainMap().maps, [{}]) # no-args --> one new dict |
Raymond Hettinger | 499e193 | 2011-02-23 07:56:53 +0000 | [diff] [blame] | 93 | self.assertEqual(ChainMap({1:2}).maps, [{1:2}]) # 1 arg --> list |
| 94 | |
Raymond Hettinger | d032131 | 2011-02-26 06:53:58 +0000 | [diff] [blame] | 95 | def test_bool(self): |
| 96 | self.assertFalse(ChainMap()) |
| 97 | self.assertFalse(ChainMap({}, {})) |
| 98 | self.assertTrue(ChainMap({1:2}, {})) |
| 99 | self.assertTrue(ChainMap({}, {1:2})) |
| 100 | |
Raymond Hettinger | 499e193 | 2011-02-23 07:56:53 +0000 | [diff] [blame] | 101 | def test_missing(self): |
| 102 | class DefaultChainMap(ChainMap): |
| 103 | def __missing__(self, key): |
| 104 | return 999 |
| 105 | d = DefaultChainMap(dict(a=1, b=2), dict(b=20, c=30)) |
| 106 | for k, v in dict(a=1, b=2, c=30, d=999).items(): |
| 107 | self.assertEqual(d[k], v) # check __getitem__ w/missing |
| 108 | for k, v in dict(a=1, b=2, c=30, d=77).items(): |
| 109 | self.assertEqual(d.get(k, 77), v) # check get() w/ missing |
| 110 | for k, v in dict(a=True, b=True, c=True, d=False).items(): |
| 111 | self.assertEqual(k in d, v) # check __contains__ w/missing |
| 112 | self.assertEqual(d.pop('a', 1001), 1, d) |
| 113 | self.assertEqual(d.pop('a', 1002), 1002) # check pop() w/missing |
| 114 | self.assertEqual(d.popitem(), ('b', 2)) # check popitem() w/missing |
| 115 | with self.assertRaises(KeyError): |
| 116 | d.popitem() |
| 117 | |
| 118 | def test_dict_coercion(self): |
| 119 | d = ChainMap(dict(a=1, b=2), dict(b=20, c=30)) |
| 120 | self.assertEqual(dict(d), dict(a=1, b=2, c=30)) |
| 121 | self.assertEqual(dict(d.items()), dict(a=1, b=2, c=30)) |
| 122 | |
Vinay Sajip | 1ba81ee | 2013-01-11 23:39:53 +0000 | [diff] [blame] | 123 | def test_new_child(self): |
| 124 | 'Tests for changes for issue #16613.' |
| 125 | c = ChainMap() |
| 126 | c['a'] = 1 |
| 127 | c['b'] = 2 |
| 128 | m = {'b':20, 'c': 30} |
| 129 | d = c.new_child(m) |
| 130 | self.assertEqual(d.maps, [{'b':20, 'c':30}, {'a':1, 'b':2}]) # check internal state |
| 131 | self.assertIs(m, d.maps[0]) |
| 132 | |
| 133 | # Use a different map than a dict |
| 134 | class lowerdict(dict): |
| 135 | def __getitem__(self, key): |
| 136 | if isinstance(key, str): |
| 137 | key = key.lower() |
| 138 | return dict.__getitem__(self, key) |
| 139 | def __contains__(self, key): |
| 140 | if isinstance(key, str): |
| 141 | key = key.lower() |
| 142 | return dict.__contains__(self, key) |
| 143 | |
| 144 | c = ChainMap() |
| 145 | c['a'] = 1 |
| 146 | c['b'] = 2 |
| 147 | m = lowerdict(b=20, c=30) |
| 148 | d = c.new_child(m) |
| 149 | self.assertIs(m, d.maps[0]) |
| 150 | for key in 'abc': # check contains |
| 151 | self.assertIn(key, d) |
| 152 | for k, v in dict(a=1, B=20, C=30, z=100).items(): # check get |
| 153 | self.assertEqual(d.get(k, 100), v) |
| 154 | |
Raymond Hettinger | 499e193 | 2011-02-23 07:56:53 +0000 | [diff] [blame] | 155 | |
| 156 | ################################################################################ |
| 157 | ### Named Tuples |
| 158 | ################################################################################ |
| 159 | |
Georg Brandl | c28e1fa | 2008-06-10 19:20:26 +0000 | [diff] [blame] | 160 | TestNT = namedtuple('TestNT', 'x y z') # type used for pickle tests |
Guido van Rossum | d8faa36 | 2007-04-27 19:54:29 +0000 | [diff] [blame] | 161 | |
| 162 | class TestNamedTuple(unittest.TestCase): |
| 163 | |
| 164 | def test_factory(self): |
Guido van Rossum | 8ce8a78 | 2007-11-01 19:42:39 +0000 | [diff] [blame] | 165 | Point = namedtuple('Point', 'x y') |
Guido van Rossum | d8faa36 | 2007-04-27 19:54:29 +0000 | [diff] [blame] | 166 | self.assertEqual(Point.__name__, 'Point') |
Guido van Rossum | d8faa36 | 2007-04-27 19:54:29 +0000 | [diff] [blame] | 167 | self.assertEqual(Point.__slots__, ()) |
| 168 | self.assertEqual(Point.__module__, __name__) |
| 169 | self.assertEqual(Point.__getitem__, tuple.__getitem__) |
Christian Heimes | faf2f63 | 2008-01-06 16:59:19 +0000 | [diff] [blame] | 170 | self.assertEqual(Point._fields, ('x', 'y')) |
Raymond Hettinger | 2ebea41 | 2011-03-23 12:52:23 -0700 | [diff] [blame] | 171 | self.assertIn('class Point(tuple)', Point._source) |
Guido van Rossum | 8ce8a78 | 2007-11-01 19:42:39 +0000 | [diff] [blame] | 172 | |
| 173 | self.assertRaises(ValueError, namedtuple, 'abc%', 'efg ghi') # type has non-alpha char |
| 174 | self.assertRaises(ValueError, namedtuple, 'class', 'efg ghi') # type has keyword |
| 175 | self.assertRaises(ValueError, namedtuple, '9abc', 'efg ghi') # type starts with digit |
| 176 | |
| 177 | self.assertRaises(ValueError, namedtuple, 'abc', 'efg g%hi') # field with non-alpha char |
| 178 | self.assertRaises(ValueError, namedtuple, 'abc', 'abc class') # field has keyword |
| 179 | self.assertRaises(ValueError, namedtuple, 'abc', '8efg 9ghi') # field starts with digit |
Christian Heimes | 0449f63 | 2007-12-15 01:27:15 +0000 | [diff] [blame] | 180 | self.assertRaises(ValueError, namedtuple, 'abc', '_efg ghi') # field with leading underscore |
Guido van Rossum | 8ce8a78 | 2007-11-01 19:42:39 +0000 | [diff] [blame] | 181 | self.assertRaises(ValueError, namedtuple, 'abc', 'efg efg ghi') # duplicate field |
| 182 | |
| 183 | namedtuple('Point0', 'x1 y2') # Verify that numbers are allowed in names |
Christian Heimes | 0449f63 | 2007-12-15 01:27:15 +0000 | [diff] [blame] | 184 | namedtuple('_', 'a b c') # Test leading underscores in a typename |
Guido van Rossum | d8faa36 | 2007-04-27 19:54:29 +0000 | [diff] [blame] | 185 | |
Benjamin Peterson | e9bbc8b | 2008-09-28 02:06:32 +0000 | [diff] [blame] | 186 | nt = namedtuple('nt', 'the quick brown fox') # check unicode input |
Benjamin Peterson | 577473f | 2010-01-19 00:09:57 +0000 | [diff] [blame] | 187 | self.assertNotIn("u'", repr(nt._fields)) |
Benjamin Peterson | e9bbc8b | 2008-09-28 02:06:32 +0000 | [diff] [blame] | 188 | nt = namedtuple('nt', ('the', 'quick')) # check unicode input |
Benjamin Peterson | 577473f | 2010-01-19 00:09:57 +0000 | [diff] [blame] | 189 | self.assertNotIn("u'", repr(nt._fields)) |
Benjamin Peterson | e9bbc8b | 2008-09-28 02:06:32 +0000 | [diff] [blame] | 190 | |
Christian Heimes | faf2f63 | 2008-01-06 16:59:19 +0000 | [diff] [blame] | 191 | self.assertRaises(TypeError, Point._make, [11]) # catch too few args |
| 192 | self.assertRaises(TypeError, Point._make, [11, 22, 33]) # catch too many args |
| 193 | |
R. David Murray | 378c0cf | 2010-02-24 01:46:21 +0000 | [diff] [blame] | 194 | @unittest.skipIf(sys.flags.optimize >= 2, |
| 195 | "Docstrings are omitted with -O2 and above") |
| 196 | def test_factory_doc_attr(self): |
| 197 | Point = namedtuple('Point', 'x y') |
| 198 | self.assertEqual(Point.__doc__, 'Point(x, y)') |
| 199 | |
Benjamin Peterson | a86f2c0 | 2009-02-10 02:41:10 +0000 | [diff] [blame] | 200 | def test_name_fixer(self): |
| 201 | for spec, renamed in [ |
Raymond Hettinger | 5614524 | 2009-04-02 22:31:59 +0000 | [diff] [blame] | 202 | [('efg', 'g%hi'), ('efg', '_1')], # field with non-alpha char |
| 203 | [('abc', 'class'), ('abc', '_1')], # field has keyword |
| 204 | [('8efg', '9ghi'), ('_0', '_1')], # field starts with digit |
| 205 | [('abc', '_efg'), ('abc', '_1')], # field with leading underscore |
| 206 | [('abc', 'efg', 'efg', 'ghi'), ('abc', 'efg', '_2', 'ghi')], # duplicate field |
| 207 | [('abc', '', 'x'), ('abc', '_1', 'x')], # fieldname is a space |
Benjamin Peterson | a86f2c0 | 2009-02-10 02:41:10 +0000 | [diff] [blame] | 208 | ]: |
| 209 | self.assertEqual(namedtuple('NT', spec, rename=True)._fields, renamed) |
| 210 | |
Guido van Rossum | d8faa36 | 2007-04-27 19:54:29 +0000 | [diff] [blame] | 211 | def test_instance(self): |
Guido van Rossum | 8ce8a78 | 2007-11-01 19:42:39 +0000 | [diff] [blame] | 212 | Point = namedtuple('Point', 'x y') |
Guido van Rossum | d8faa36 | 2007-04-27 19:54:29 +0000 | [diff] [blame] | 213 | p = Point(11, 22) |
| 214 | self.assertEqual(p, Point(x=11, y=22)) |
| 215 | self.assertEqual(p, Point(11, y=22)) |
| 216 | self.assertEqual(p, Point(y=22, x=11)) |
| 217 | self.assertEqual(p, Point(*(11, 22))) |
| 218 | self.assertEqual(p, Point(**dict(x=11, y=22))) |
| 219 | self.assertRaises(TypeError, Point, 1) # too few args |
| 220 | self.assertRaises(TypeError, Point, 1, 2, 3) # too many args |
| 221 | self.assertRaises(TypeError, eval, 'Point(XXX=1, y=2)', locals()) # wrong keyword argument |
| 222 | self.assertRaises(TypeError, eval, 'Point(x=1)', locals()) # missing keyword argument |
| 223 | self.assertEqual(repr(p), 'Point(x=11, y=22)') |
Benjamin Peterson | 577473f | 2010-01-19 00:09:57 +0000 | [diff] [blame] | 224 | self.assertNotIn('__weakref__', dir(p)) |
Christian Heimes | faf2f63 | 2008-01-06 16:59:19 +0000 | [diff] [blame] | 225 | self.assertEqual(p, Point._make([11, 22])) # test _make classmethod |
Christian Heimes | 0449f63 | 2007-12-15 01:27:15 +0000 | [diff] [blame] | 226 | self.assertEqual(p._fields, ('x', 'y')) # test _fields attribute |
| 227 | self.assertEqual(p._replace(x=1), (1, 22)) # test _replace method |
Raymond Hettinger | 163e982 | 2013-05-18 00:05:20 -0700 | [diff] [blame] | 228 | self.assertEqual(p._asdict(), dict(x=11, y=22)) # test _asdict method |
| 229 | self.assertEqual(vars(p), p._asdict()) # verify that vars() works |
Thomas Wouters | 1b7f891 | 2007-09-19 03:06:30 +0000 | [diff] [blame] | 230 | |
Guido van Rossum | 3d392eb | 2007-11-16 00:35:22 +0000 | [diff] [blame] | 231 | try: |
Christian Heimes | faf2f63 | 2008-01-06 16:59:19 +0000 | [diff] [blame] | 232 | p._replace(x=1, error=2) |
| 233 | except ValueError: |
Guido van Rossum | 3d392eb | 2007-11-16 00:35:22 +0000 | [diff] [blame] | 234 | pass |
| 235 | else: |
Christian Heimes | faf2f63 | 2008-01-06 16:59:19 +0000 | [diff] [blame] | 236 | self._fail('Did not detect an incorrect fieldname') |
Guido van Rossum | 3d392eb | 2007-11-16 00:35:22 +0000 | [diff] [blame] | 237 | |
Thomas Wouters | 1b7f891 | 2007-09-19 03:06:30 +0000 | [diff] [blame] | 238 | # verify that field string can have commas |
Guido van Rossum | 8ce8a78 | 2007-11-01 19:42:39 +0000 | [diff] [blame] | 239 | Point = namedtuple('Point', 'x, y') |
| 240 | p = Point(x=11, y=22) |
| 241 | self.assertEqual(repr(p), 'Point(x=11, y=22)') |
| 242 | |
| 243 | # verify that fieldspec can be a non-string sequence |
| 244 | Point = namedtuple('Point', ('x', 'y')) |
Thomas Wouters | 1b7f891 | 2007-09-19 03:06:30 +0000 | [diff] [blame] | 245 | p = Point(x=11, y=22) |
| 246 | self.assertEqual(repr(p), 'Point(x=11, y=22)') |
Guido van Rossum | d8faa36 | 2007-04-27 19:54:29 +0000 | [diff] [blame] | 247 | |
| 248 | def test_tupleness(self): |
Guido van Rossum | 8ce8a78 | 2007-11-01 19:42:39 +0000 | [diff] [blame] | 249 | Point = namedtuple('Point', 'x y') |
Guido van Rossum | d8faa36 | 2007-04-27 19:54:29 +0000 | [diff] [blame] | 250 | p = Point(11, 22) |
| 251 | |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 252 | self.assertIsInstance(p, tuple) |
Guido van Rossum | d8faa36 | 2007-04-27 19:54:29 +0000 | [diff] [blame] | 253 | self.assertEqual(p, (11, 22)) # matches a real tuple |
| 254 | self.assertEqual(tuple(p), (11, 22)) # coercable to a real tuple |
| 255 | self.assertEqual(list(p), [11, 22]) # coercable to a list |
| 256 | self.assertEqual(max(p), 22) # iterable |
| 257 | self.assertEqual(max(*p), 22) # star-able |
| 258 | x, y = p |
| 259 | self.assertEqual(p, (x, y)) # unpacks like a tuple |
| 260 | self.assertEqual((p[0], p[1]), (11, 22)) # indexable like a tuple |
| 261 | self.assertRaises(IndexError, p.__getitem__, 3) |
| 262 | |
| 263 | self.assertEqual(p.x, x) |
| 264 | self.assertEqual(p.y, y) |
| 265 | self.assertRaises(AttributeError, eval, 'p.z', locals()) |
| 266 | |
Thomas Wouters | 1b7f891 | 2007-09-19 03:06:30 +0000 | [diff] [blame] | 267 | def test_odd_sizes(self): |
Guido van Rossum | 8ce8a78 | 2007-11-01 19:42:39 +0000 | [diff] [blame] | 268 | Zero = namedtuple('Zero', '') |
Thomas Wouters | 1b7f891 | 2007-09-19 03:06:30 +0000 | [diff] [blame] | 269 | self.assertEqual(Zero(), ()) |
Christian Heimes | faf2f63 | 2008-01-06 16:59:19 +0000 | [diff] [blame] | 270 | self.assertEqual(Zero._make([]), ()) |
Christian Heimes | 99170a5 | 2007-12-19 02:07:34 +0000 | [diff] [blame] | 271 | self.assertEqual(repr(Zero()), 'Zero()') |
| 272 | self.assertEqual(Zero()._asdict(), {}) |
| 273 | self.assertEqual(Zero()._fields, ()) |
| 274 | |
Guido van Rossum | 8ce8a78 | 2007-11-01 19:42:39 +0000 | [diff] [blame] | 275 | Dot = namedtuple('Dot', 'd') |
Thomas Wouters | 1b7f891 | 2007-09-19 03:06:30 +0000 | [diff] [blame] | 276 | self.assertEqual(Dot(1), (1,)) |
Christian Heimes | faf2f63 | 2008-01-06 16:59:19 +0000 | [diff] [blame] | 277 | self.assertEqual(Dot._make([1]), (1,)) |
Christian Heimes | 99170a5 | 2007-12-19 02:07:34 +0000 | [diff] [blame] | 278 | self.assertEqual(Dot(1).d, 1) |
| 279 | self.assertEqual(repr(Dot(1)), 'Dot(d=1)') |
| 280 | self.assertEqual(Dot(1)._asdict(), {'d':1}) |
| 281 | self.assertEqual(Dot(1)._replace(d=999), (999,)) |
| 282 | self.assertEqual(Dot(1)._fields, ('d',)) |
Thomas Wouters | 1b7f891 | 2007-09-19 03:06:30 +0000 | [diff] [blame] | 283 | |
Georg Brandl | c28e1fa | 2008-06-10 19:20:26 +0000 | [diff] [blame] | 284 | # n = 5000 |
Christian Heimes | 99170a5 | 2007-12-19 02:07:34 +0000 | [diff] [blame] | 285 | n = 254 # SyntaxError: more than 255 arguments: |
| 286 | import string, random |
Georg Brandl | b533e26 | 2008-05-25 18:19:30 +0000 | [diff] [blame] | 287 | names = list(set(''.join([random.choice(string.ascii_letters) |
| 288 | for j in range(10)]) for i in range(n))) |
| 289 | n = len(names) |
Christian Heimes | 99170a5 | 2007-12-19 02:07:34 +0000 | [diff] [blame] | 290 | Big = namedtuple('Big', names) |
| 291 | b = Big(*range(n)) |
| 292 | self.assertEqual(b, tuple(range(n))) |
Christian Heimes | faf2f63 | 2008-01-06 16:59:19 +0000 | [diff] [blame] | 293 | self.assertEqual(Big._make(range(n)), tuple(range(n))) |
Christian Heimes | 99170a5 | 2007-12-19 02:07:34 +0000 | [diff] [blame] | 294 | for pos, name in enumerate(names): |
| 295 | self.assertEqual(getattr(b, name), pos) |
| 296 | repr(b) # make sure repr() doesn't blow-up |
| 297 | d = b._asdict() |
| 298 | d_expected = dict(zip(names, range(n))) |
| 299 | self.assertEqual(d, d_expected) |
| 300 | b2 = b._replace(**dict([(names[1], 999),(names[-5], 42)])) |
| 301 | b2_expected = list(range(n)) |
| 302 | b2_expected[1] = 999 |
| 303 | b2_expected[-5] = 42 |
| 304 | self.assertEqual(b2, tuple(b2_expected)) |
| 305 | self.assertEqual(b._fields, tuple(names)) |
Guido van Rossum | d8faa36 | 2007-04-27 19:54:29 +0000 | [diff] [blame] | 306 | |
Georg Brandl | c28e1fa | 2008-06-10 19:20:26 +0000 | [diff] [blame] | 307 | def test_pickle(self): |
| 308 | p = TestNT(x=10, y=20, z=30) |
| 309 | for module in (pickle,): |
| 310 | loads = getattr(module, 'loads') |
| 311 | dumps = getattr(module, 'dumps') |
Eric V. Smith | 4d5d69d | 2014-02-05 10:33:14 -0500 | [diff] [blame] | 312 | for protocol in range(-1, module.HIGHEST_PROTOCOL + 1): |
Georg Brandl | c28e1fa | 2008-06-10 19:20:26 +0000 | [diff] [blame] | 313 | q = loads(dumps(p, protocol)) |
| 314 | self.assertEqual(p, q) |
| 315 | self.assertEqual(p._fields, q._fields) |
Raymond Hettinger | b98dcc1 | 2013-05-03 02:24:15 -0700 | [diff] [blame] | 316 | self.assertNotIn(b'OrderedDict', dumps(p, protocol)) |
Georg Brandl | c28e1fa | 2008-06-10 19:20:26 +0000 | [diff] [blame] | 317 | |
| 318 | def test_copy(self): |
| 319 | p = TestNT(x=10, y=20, z=30) |
| 320 | for copier in copy.copy, copy.deepcopy: |
| 321 | q = copier(p) |
| 322 | self.assertEqual(p, q) |
| 323 | self.assertEqual(p._fields, q._fields) |
| 324 | |
Raymond Hettinger | 089ba7f | 2009-05-27 00:38:24 +0000 | [diff] [blame] | 325 | def test_name_conflicts(self): |
| 326 | # Some names like "self", "cls", "tuple", "itemgetter", and "property" |
| 327 | # failed when used as field names. Test to make sure these now work. |
| 328 | T = namedtuple('T', 'itemgetter property self cls tuple') |
| 329 | t = T(1, 2, 3, 4, 5) |
| 330 | self.assertEqual(t, (1,2,3,4,5)) |
| 331 | newt = t._replace(itemgetter=10, property=20, self=30, cls=40, tuple=50) |
| 332 | self.assertEqual(newt, (10,20,30,40,50)) |
| 333 | |
Raymond Hettinger | 499b2ee | 2009-05-27 01:53:46 +0000 | [diff] [blame] | 334 | # Broader test of all interesting names in a template |
| 335 | with support.captured_stdout() as template: |
| 336 | T = namedtuple('T', 'x', verbose=True) |
| 337 | words = set(re.findall('[A-Za-z]+', template.getvalue())) |
| 338 | words -= set(keyword.kwlist) |
| 339 | T = namedtuple('T', words) |
| 340 | # test __new__ |
| 341 | values = tuple(range(len(words))) |
| 342 | t = T(*values) |
| 343 | self.assertEqual(t, values) |
| 344 | t = T(**dict(zip(T._fields, values))) |
| 345 | self.assertEqual(t, values) |
| 346 | # test _make |
| 347 | t = T._make(values) |
| 348 | self.assertEqual(t, values) |
| 349 | # exercise __repr__ |
| 350 | repr(t) |
| 351 | # test _asdict |
| 352 | self.assertEqual(t._asdict(), dict(zip(T._fields, values))) |
| 353 | # test _replace |
| 354 | t = T._make(values) |
| 355 | newvalues = tuple(v*10 for v in values) |
| 356 | newt = t._replace(**dict(zip(T._fields, newvalues))) |
| 357 | self.assertEqual(newt, newvalues) |
| 358 | # test _fields |
| 359 | self.assertEqual(T._fields, tuple(words)) |
| 360 | # test __getnewargs__ |
| 361 | self.assertEqual(t.__getnewargs__(), values) |
| 362 | |
Raymond Hettinger | d331ce9 | 2010-08-08 01:13:42 +0000 | [diff] [blame] | 363 | def test_repr(self): |
| 364 | with support.captured_stdout() as template: |
| 365 | A = namedtuple('A', 'x', verbose=True) |
| 366 | self.assertEqual(repr(A(1)), 'A(x=1)') |
| 367 | # repr should show the name of the subclass |
| 368 | class B(A): |
| 369 | pass |
| 370 | self.assertEqual(repr(B(1)), 'B(x=1)') |
| 371 | |
Raymond Hettinger | f6d3e8e | 2011-03-23 20:33:30 -0700 | [diff] [blame] | 372 | def test_source(self): |
| 373 | # verify that _source can be run through exec() |
Raymond Hettinger | d4652fa | 2011-03-24 09:45:43 -0700 | [diff] [blame] | 374 | tmp = namedtuple('NTColor', 'red green blue') |
| 375 | globals().pop('NTColor', None) # remove artifacts from other tests |
Raymond Hettinger | f6d3e8e | 2011-03-23 20:33:30 -0700 | [diff] [blame] | 376 | exec(tmp._source, globals()) |
Raymond Hettinger | d4652fa | 2011-03-24 09:45:43 -0700 | [diff] [blame] | 377 | self.assertIn('NTColor', globals()) |
| 378 | c = NTColor(10, 20, 30) |
Raymond Hettinger | f6d3e8e | 2011-03-23 20:33:30 -0700 | [diff] [blame] | 379 | self.assertEqual((c.red, c.green, c.blue), (10, 20, 30)) |
Raymond Hettinger | d4652fa | 2011-03-24 09:45:43 -0700 | [diff] [blame] | 380 | self.assertEqual(NTColor._fields, ('red', 'green', 'blue')) |
| 381 | globals().pop('NTColor', None) # clean-up after this test |
Raymond Hettinger | f6d3e8e | 2011-03-23 20:33:30 -0700 | [diff] [blame] | 382 | |
Raymond Hettinger | d331ce9 | 2010-08-08 01:13:42 +0000 | [diff] [blame] | 383 | |
Raymond Hettinger | 499e193 | 2011-02-23 07:56:53 +0000 | [diff] [blame] | 384 | ################################################################################ |
| 385 | ### Abstract Base Classes |
| 386 | ################################################################################ |
| 387 | |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 388 | class ABCTestCase(unittest.TestCase): |
| 389 | |
| 390 | def validate_abstract_methods(self, abc, *names): |
| 391 | methodstubs = dict.fromkeys(names, lambda s, *args: 0) |
| 392 | |
| 393 | # everything should work will all required methods are present |
| 394 | C = type('C', (abc,), methodstubs) |
| 395 | C() |
| 396 | |
| 397 | # instantiation should fail if a required method is missing |
| 398 | for name in names: |
| 399 | stubs = methodstubs.copy() |
| 400 | del stubs[name] |
| 401 | C = type('C', (abc,), stubs) |
| 402 | self.assertRaises(TypeError, C, name) |
| 403 | |
Florent Xicluna | ce153f6 | 2010-03-08 15:34:35 +0000 | [diff] [blame] | 404 | def validate_isinstance(self, abc, name): |
| 405 | stub = lambda s, *args: 0 |
| 406 | |
| 407 | C = type('C', (object,), {'__hash__': None}) |
| 408 | setattr(C, name, stub) |
| 409 | self.assertIsInstance(C(), abc) |
| 410 | self.assertTrue(issubclass(C, abc)) |
| 411 | |
| 412 | C = type('C', (object,), {'__hash__': None}) |
| 413 | self.assertNotIsInstance(C(), abc) |
| 414 | self.assertFalse(issubclass(C, abc)) |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 415 | |
Benjamin Peterson | 4ad6bd5 | 2010-05-21 20:55:22 +0000 | [diff] [blame] | 416 | def validate_comparison(self, instance): |
| 417 | ops = ['lt', 'gt', 'le', 'ge', 'ne', 'or', 'and', 'xor', 'sub'] |
| 418 | operators = {} |
| 419 | for op in ops: |
| 420 | name = '__' + op + '__' |
| 421 | operators[name] = getattr(operator, name) |
| 422 | |
| 423 | class Other: |
| 424 | def __init__(self): |
| 425 | self.right_side = False |
| 426 | def __eq__(self, other): |
| 427 | self.right_side = True |
| 428 | return True |
| 429 | __lt__ = __eq__ |
| 430 | __gt__ = __eq__ |
| 431 | __le__ = __eq__ |
| 432 | __ge__ = __eq__ |
| 433 | __ne__ = __eq__ |
| 434 | __ror__ = __eq__ |
| 435 | __rand__ = __eq__ |
| 436 | __rxor__ = __eq__ |
| 437 | __rsub__ = __eq__ |
| 438 | |
| 439 | for name, op in operators.items(): |
| 440 | if not hasattr(instance, name): |
| 441 | continue |
| 442 | other = Other() |
| 443 | op(instance, other) |
| 444 | self.assertTrue(other.right_side,'Right side not called for %s.%s' |
| 445 | % (type(instance), name)) |
| 446 | |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 447 | class TestOneTrickPonyABCs(ABCTestCase): |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 448 | |
| 449 | def test_Hashable(self): |
| 450 | # Check some non-hashables |
Guido van Rossum | 254348e | 2007-11-21 19:29:53 +0000 | [diff] [blame] | 451 | non_samples = [bytearray(), list(), set(), dict()] |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 452 | for x in non_samples: |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 453 | self.assertNotIsInstance(x, Hashable) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 454 | self.assertFalse(issubclass(type(x), Hashable), repr(type(x))) |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 455 | # Check some hashables |
| 456 | samples = [None, |
| 457 | int(), float(), complex(), |
Guido van Rossum | 07d4e78 | 2007-07-03 16:59:47 +0000 | [diff] [blame] | 458 | str(), |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 459 | tuple(), frozenset(), |
Guido van Rossum | 98297ee | 2007-11-06 21:34:58 +0000 | [diff] [blame] | 460 | int, list, object, type, bytes() |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 461 | ] |
| 462 | for x in samples: |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 463 | self.assertIsInstance(x, Hashable) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 464 | self.assertTrue(issubclass(type(x), Hashable), repr(type(x))) |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 465 | self.assertRaises(TypeError, Hashable) |
| 466 | # Check direct subclassing |
| 467 | class H(Hashable): |
| 468 | def __hash__(self): |
| 469 | return super().__hash__() |
| 470 | self.assertEqual(hash(H()), 0) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 471 | self.assertFalse(issubclass(int, H)) |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 472 | self.validate_abstract_methods(Hashable, '__hash__') |
Florent Xicluna | ce153f6 | 2010-03-08 15:34:35 +0000 | [diff] [blame] | 473 | self.validate_isinstance(Hashable, '__hash__') |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 474 | |
| 475 | def test_Iterable(self): |
| 476 | # Check some non-iterables |
| 477 | non_samples = [None, 42, 3.14, 1j] |
| 478 | for x in non_samples: |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 479 | self.assertNotIsInstance(x, Iterable) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 480 | self.assertFalse(issubclass(type(x), Iterable), repr(type(x))) |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 481 | # Check some iterables |
Guido van Rossum | 07d4e78 | 2007-07-03 16:59:47 +0000 | [diff] [blame] | 482 | samples = [bytes(), str(), |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 483 | tuple(), list(), set(), frozenset(), dict(), |
| 484 | dict().keys(), dict().items(), dict().values(), |
| 485 | (lambda: (yield))(), |
| 486 | (x for x in []), |
| 487 | ] |
| 488 | for x in samples: |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 489 | self.assertIsInstance(x, Iterable) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 490 | self.assertTrue(issubclass(type(x), Iterable), repr(type(x))) |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 491 | # Check direct subclassing |
| 492 | class I(Iterable): |
| 493 | def __iter__(self): |
| 494 | return super().__iter__() |
| 495 | self.assertEqual(list(I()), []) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 496 | self.assertFalse(issubclass(str, I)) |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 497 | self.validate_abstract_methods(Iterable, '__iter__') |
Florent Xicluna | ce153f6 | 2010-03-08 15:34:35 +0000 | [diff] [blame] | 498 | self.validate_isinstance(Iterable, '__iter__') |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 499 | |
| 500 | def test_Iterator(self): |
Guido van Rossum | 07d4e78 | 2007-07-03 16:59:47 +0000 | [diff] [blame] | 501 | non_samples = [None, 42, 3.14, 1j, b"", "", (), [], {}, set()] |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 502 | for x in non_samples: |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 503 | self.assertNotIsInstance(x, Iterator) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 504 | self.assertFalse(issubclass(type(x), Iterator), repr(type(x))) |
Guido van Rossum | 07d4e78 | 2007-07-03 16:59:47 +0000 | [diff] [blame] | 505 | samples = [iter(bytes()), iter(str()), |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 506 | iter(tuple()), iter(list()), iter(dict()), |
| 507 | iter(set()), iter(frozenset()), |
| 508 | iter(dict().keys()), iter(dict().items()), |
| 509 | iter(dict().values()), |
| 510 | (lambda: (yield))(), |
| 511 | (x for x in []), |
| 512 | ] |
| 513 | for x in samples: |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 514 | self.assertIsInstance(x, Iterator) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 515 | self.assertTrue(issubclass(type(x), Iterator), repr(type(x))) |
Raymond Hettinger | ead2222 | 2010-11-29 03:56:12 +0000 | [diff] [blame] | 516 | self.validate_abstract_methods(Iterator, '__next__', '__iter__') |
| 517 | |
| 518 | # Issue 10565 |
| 519 | class NextOnly: |
| 520 | def __next__(self): |
| 521 | yield 1 |
Raymond Hettinger | bb6c0aa | 2014-11-22 22:14:41 -0800 | [diff] [blame] | 522 | return |
Raymond Hettinger | ead2222 | 2010-11-29 03:56:12 +0000 | [diff] [blame] | 523 | self.assertNotIsInstance(NextOnly(), Iterator) |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 524 | |
Raymond Hettinger | bd60e8d | 2015-05-09 01:07:23 -0400 | [diff] [blame^] | 525 | def test_Generator(self): |
| 526 | class NonGen1: |
| 527 | def __iter__(self): return self |
| 528 | def __next__(self): return None |
| 529 | def close(self): pass |
| 530 | def throw(self, typ, val=None, tb=None): pass |
| 531 | |
| 532 | class NonGen2: |
| 533 | def __iter__(self): return self |
| 534 | def __next__(self): return None |
| 535 | def close(self): pass |
| 536 | def send(self, value): return value |
| 537 | |
| 538 | class NonGen3: |
| 539 | def close(self): pass |
| 540 | def send(self, value): return value |
| 541 | def throw(self, typ, val=None, tb=None): pass |
| 542 | |
| 543 | non_samples = [ |
| 544 | None, 42, 3.14, 1j, b"", "", (), [], {}, set(), |
| 545 | iter(()), iter([]), NonGen1(), NonGen2(), NonGen3()] |
| 546 | for x in non_samples: |
| 547 | self.assertNotIsInstance(x, Generator) |
| 548 | self.assertFalse(issubclass(type(x), Generator), repr(type(x))) |
| 549 | |
| 550 | class Gen: |
| 551 | def __iter__(self): return self |
| 552 | def __next__(self): return None |
| 553 | def close(self): pass |
| 554 | def send(self, value): return value |
| 555 | def throw(self, typ, val=None, tb=None): pass |
| 556 | |
| 557 | class MinimalGen(Generator): |
| 558 | def send(self, value): |
| 559 | return value |
| 560 | def throw(self, typ, val=None, tb=None): |
| 561 | super().throw(typ, val, tb) |
| 562 | |
| 563 | def gen(): |
| 564 | yield 1 |
| 565 | |
| 566 | samples = [gen(), (lambda: (yield))(), Gen(), MinimalGen()] |
| 567 | for x in samples: |
| 568 | self.assertIsInstance(x, Iterator) |
| 569 | self.assertIsInstance(x, Generator) |
| 570 | self.assertTrue(issubclass(type(x), Generator), repr(type(x))) |
| 571 | self.validate_abstract_methods(Generator, 'send', 'throw') |
| 572 | |
| 573 | # mixin tests |
| 574 | mgen = MinimalGen() |
| 575 | self.assertIs(mgen, iter(mgen)) |
| 576 | self.assertIs(mgen.send(None), next(mgen)) |
| 577 | self.assertEqual(2, mgen.send(2)) |
| 578 | self.assertIsNone(mgen.close()) |
| 579 | self.assertRaises(ValueError, mgen.throw, ValueError) |
| 580 | self.assertRaisesRegex(ValueError, "^huhu$", |
| 581 | mgen.throw, ValueError, ValueError("huhu")) |
| 582 | self.assertRaises(StopIteration, mgen.throw, StopIteration()) |
| 583 | |
| 584 | class FailOnClose(Generator): |
| 585 | def send(self, value): return value |
| 586 | def throw(self, *args): raise ValueError |
| 587 | |
| 588 | self.assertRaises(ValueError, FailOnClose().close) |
| 589 | |
| 590 | class IgnoreGeneratorExit(Generator): |
| 591 | def send(self, value): return value |
| 592 | def throw(self, *args): pass |
| 593 | |
| 594 | self.assertRaises(RuntimeError, IgnoreGeneratorExit().close) |
| 595 | |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 596 | def test_Sized(self): |
| 597 | non_samples = [None, 42, 3.14, 1j, |
| 598 | (lambda: (yield))(), |
| 599 | (x for x in []), |
| 600 | ] |
| 601 | for x in non_samples: |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 602 | self.assertNotIsInstance(x, Sized) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 603 | self.assertFalse(issubclass(type(x), Sized), repr(type(x))) |
Guido van Rossum | 07d4e78 | 2007-07-03 16:59:47 +0000 | [diff] [blame] | 604 | samples = [bytes(), str(), |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 605 | tuple(), list(), set(), frozenset(), dict(), |
| 606 | dict().keys(), dict().items(), dict().values(), |
| 607 | ] |
| 608 | for x in samples: |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 609 | self.assertIsInstance(x, Sized) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 610 | self.assertTrue(issubclass(type(x), Sized), repr(type(x))) |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 611 | self.validate_abstract_methods(Sized, '__len__') |
Florent Xicluna | ce153f6 | 2010-03-08 15:34:35 +0000 | [diff] [blame] | 612 | self.validate_isinstance(Sized, '__len__') |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 613 | |
| 614 | def test_Container(self): |
| 615 | non_samples = [None, 42, 3.14, 1j, |
| 616 | (lambda: (yield))(), |
| 617 | (x for x in []), |
| 618 | ] |
| 619 | for x in non_samples: |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 620 | self.assertNotIsInstance(x, Container) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 621 | self.assertFalse(issubclass(type(x), Container), repr(type(x))) |
Guido van Rossum | 07d4e78 | 2007-07-03 16:59:47 +0000 | [diff] [blame] | 622 | samples = [bytes(), str(), |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 623 | tuple(), list(), set(), frozenset(), dict(), |
| 624 | dict().keys(), dict().items(), |
| 625 | ] |
| 626 | for x in samples: |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 627 | self.assertIsInstance(x, Container) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 628 | self.assertTrue(issubclass(type(x), Container), repr(type(x))) |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 629 | self.validate_abstract_methods(Container, '__contains__') |
Florent Xicluna | ce153f6 | 2010-03-08 15:34:35 +0000 | [diff] [blame] | 630 | self.validate_isinstance(Container, '__contains__') |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 631 | |
| 632 | def test_Callable(self): |
| 633 | non_samples = [None, 42, 3.14, 1j, |
| 634 | "", b"", (), [], {}, set(), |
| 635 | (lambda: (yield))(), |
| 636 | (x for x in []), |
| 637 | ] |
| 638 | for x in non_samples: |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 639 | self.assertNotIsInstance(x, Callable) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 640 | self.assertFalse(issubclass(type(x), Callable), repr(type(x))) |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 641 | samples = [lambda: None, |
| 642 | type, int, object, |
| 643 | len, |
| 644 | list.append, [].append, |
| 645 | ] |
| 646 | for x in samples: |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 647 | self.assertIsInstance(x, Callable) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 648 | self.assertTrue(issubclass(type(x), Callable), repr(type(x))) |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 649 | self.validate_abstract_methods(Callable, '__call__') |
Florent Xicluna | ce153f6 | 2010-03-08 15:34:35 +0000 | [diff] [blame] | 650 | self.validate_isinstance(Callable, '__call__') |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 651 | |
| 652 | def test_direct_subclassing(self): |
| 653 | for B in Hashable, Iterable, Iterator, Sized, Container, Callable: |
| 654 | class C(B): |
| 655 | pass |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 656 | self.assertTrue(issubclass(C, B)) |
| 657 | self.assertFalse(issubclass(int, C)) |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 658 | |
| 659 | def test_registration(self): |
| 660 | for B in Hashable, Iterable, Iterator, Sized, Container, Callable: |
| 661 | class C: |
| 662 | __hash__ = None # Make sure it isn't hashable by default |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 663 | self.assertFalse(issubclass(C, B), B.__name__) |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 664 | B.register(C) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 665 | self.assertTrue(issubclass(C, B)) |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 666 | |
Raymond Hettinger | 3f10a95 | 2009-04-01 19:05:50 +0000 | [diff] [blame] | 667 | class WithSet(MutableSet): |
| 668 | |
| 669 | def __init__(self, it=()): |
| 670 | self.data = set(it) |
| 671 | |
| 672 | def __len__(self): |
| 673 | return len(self.data) |
| 674 | |
| 675 | def __iter__(self): |
| 676 | return iter(self.data) |
| 677 | |
| 678 | def __contains__(self, item): |
| 679 | return item in self.data |
| 680 | |
| 681 | def add(self, item): |
| 682 | self.data.add(item) |
| 683 | |
| 684 | def discard(self, item): |
| 685 | self.data.discard(item) |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 686 | |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 687 | class TestCollectionABCs(ABCTestCase): |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 688 | |
| 689 | # XXX For now, we only test some virtual inheritance properties. |
| 690 | # We should also test the proper behavior of the collection ABCs |
| 691 | # as real base classes or mix-in classes. |
| 692 | |
| 693 | def test_Set(self): |
| 694 | for sample in [set, frozenset]: |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 695 | self.assertIsInstance(sample(), Set) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 696 | self.assertTrue(issubclass(sample, Set)) |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 697 | self.validate_abstract_methods(Set, '__contains__', '__iter__', '__len__') |
Benjamin Peterson | 4ad6bd5 | 2010-05-21 20:55:22 +0000 | [diff] [blame] | 698 | class MySet(Set): |
| 699 | def __contains__(self, x): |
| 700 | return False |
| 701 | def __len__(self): |
| 702 | return 0 |
| 703 | def __iter__(self): |
| 704 | return iter([]) |
| 705 | self.validate_comparison(MySet()) |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 706 | |
Benjamin Peterson | 4118174 | 2008-07-02 20:22:54 +0000 | [diff] [blame] | 707 | def test_hash_Set(self): |
| 708 | class OneTwoThreeSet(Set): |
| 709 | def __init__(self): |
| 710 | self.contents = [1, 2, 3] |
| 711 | def __contains__(self, x): |
| 712 | return x in self.contents |
| 713 | def __len__(self): |
| 714 | return len(self.contents) |
| 715 | def __iter__(self): |
| 716 | return iter(self.contents) |
| 717 | def __hash__(self): |
| 718 | return self._hash() |
| 719 | a, b = OneTwoThreeSet(), OneTwoThreeSet() |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 720 | self.assertTrue(hash(a) == hash(b)) |
Benjamin Peterson | 4118174 | 2008-07-02 20:22:54 +0000 | [diff] [blame] | 721 | |
Raymond Hettinger | 2d452ee | 2014-05-25 18:28:39 -0700 | [diff] [blame] | 722 | def test_isdisjoint_Set(self): |
| 723 | class MySet(Set): |
| 724 | def __init__(self, itr): |
| 725 | self.contents = itr |
| 726 | def __contains__(self, x): |
| 727 | return x in self.contents |
| 728 | def __iter__(self): |
| 729 | return iter(self.contents) |
| 730 | def __len__(self): |
| 731 | return len([x for x in self.contents]) |
| 732 | s1 = MySet((1, 2, 3)) |
| 733 | s2 = MySet((4, 5, 6)) |
| 734 | s3 = MySet((1, 5, 6)) |
| 735 | self.assertTrue(s1.isdisjoint(s2)) |
| 736 | self.assertFalse(s1.isdisjoint(s3)) |
| 737 | |
| 738 | def test_equality_Set(self): |
| 739 | class MySet(Set): |
| 740 | def __init__(self, itr): |
| 741 | self.contents = itr |
| 742 | def __contains__(self, x): |
| 743 | return x in self.contents |
| 744 | def __iter__(self): |
| 745 | return iter(self.contents) |
| 746 | def __len__(self): |
| 747 | return len([x for x in self.contents]) |
| 748 | s1 = MySet((1,)) |
| 749 | s2 = MySet((1, 2)) |
| 750 | s3 = MySet((3, 4)) |
| 751 | s4 = MySet((3, 4)) |
| 752 | self.assertTrue(s2 > s1) |
| 753 | self.assertTrue(s1 < s2) |
| 754 | self.assertFalse(s2 <= s1) |
| 755 | self.assertFalse(s2 <= s3) |
| 756 | self.assertFalse(s1 >= s2) |
| 757 | self.assertEqual(s3, s4) |
| 758 | self.assertNotEqual(s2, s3) |
| 759 | |
| 760 | def test_arithmetic_Set(self): |
| 761 | class MySet(Set): |
| 762 | def __init__(self, itr): |
| 763 | self.contents = itr |
| 764 | def __contains__(self, x): |
| 765 | return x in self.contents |
| 766 | def __iter__(self): |
| 767 | return iter(self.contents) |
| 768 | def __len__(self): |
| 769 | return len([x for x in self.contents]) |
| 770 | s1 = MySet((1, 2, 3)) |
| 771 | s2 = MySet((3, 4, 5)) |
| 772 | s3 = s1 & s2 |
| 773 | self.assertEqual(s3, MySet((3,))) |
| 774 | |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 775 | def test_MutableSet(self): |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 776 | self.assertIsInstance(set(), MutableSet) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 777 | self.assertTrue(issubclass(set, MutableSet)) |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 778 | self.assertNotIsInstance(frozenset(), MutableSet) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 779 | self.assertFalse(issubclass(frozenset, MutableSet)) |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 780 | self.validate_abstract_methods(MutableSet, '__contains__', '__iter__', '__len__', |
| 781 | 'add', 'discard') |
| 782 | |
Raymond Hettinger | 3f10a95 | 2009-04-01 19:05:50 +0000 | [diff] [blame] | 783 | def test_issue_5647(self): |
| 784 | # MutableSet.__iand__ mutated the set during iteration |
| 785 | s = WithSet('abcd') |
| 786 | s &= WithSet('cdef') # This used to fail |
| 787 | self.assertEqual(set(s), set('cd')) |
| 788 | |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 789 | def test_issue_4920(self): |
| 790 | # MutableSet.pop() method did not work |
Raymond Hettinger | 57d1a88 | 2011-02-23 00:46:28 +0000 | [diff] [blame] | 791 | class MySet(MutableSet): |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 792 | __slots__=['__s'] |
| 793 | def __init__(self,items=None): |
| 794 | if items is None: |
| 795 | items=[] |
| 796 | self.__s=set(items) |
| 797 | def __contains__(self,v): |
| 798 | return v in self.__s |
| 799 | def __iter__(self): |
| 800 | return iter(self.__s) |
| 801 | def __len__(self): |
| 802 | return len(self.__s) |
| 803 | def add(self,v): |
| 804 | result=v not in self.__s |
| 805 | self.__s.add(v) |
| 806 | return result |
| 807 | def discard(self,v): |
| 808 | result=v in self.__s |
| 809 | self.__s.discard(v) |
| 810 | return result |
| 811 | def __repr__(self): |
| 812 | return "MySet(%s)" % repr(list(self)) |
| 813 | s = MySet([5,43,2,1]) |
| 814 | self.assertEqual(s.pop(), 1) |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 815 | |
Daniel Stutzbach | 31da5b2 | 2010-08-24 20:49:57 +0000 | [diff] [blame] | 816 | def test_issue8750(self): |
| 817 | empty = WithSet() |
| 818 | full = WithSet(range(10)) |
| 819 | s = WithSet(full) |
| 820 | s -= s |
| 821 | self.assertEqual(s, empty) |
| 822 | s = WithSet(full) |
| 823 | s ^= s |
| 824 | self.assertEqual(s, empty) |
| 825 | s = WithSet(full) |
| 826 | s &= s |
| 827 | self.assertEqual(s, full) |
| 828 | s |= s |
| 829 | self.assertEqual(s, full) |
| 830 | |
Andrew Svetlov | bcac6ad | 2012-11-01 13:28:54 +0200 | [diff] [blame] | 831 | def test_issue16373(self): |
| 832 | # Recursion error comparing comparable and noncomparable |
| 833 | # Set instances |
| 834 | class MyComparableSet(Set): |
| 835 | def __contains__(self, x): |
| 836 | return False |
| 837 | def __len__(self): |
| 838 | return 0 |
| 839 | def __iter__(self): |
| 840 | return iter([]) |
| 841 | class MyNonComparableSet(Set): |
| 842 | def __contains__(self, x): |
| 843 | return False |
| 844 | def __len__(self): |
| 845 | return 0 |
| 846 | def __iter__(self): |
| 847 | return iter([]) |
| 848 | def __le__(self, x): |
| 849 | return NotImplemented |
| 850 | def __lt__(self, x): |
| 851 | return NotImplemented |
| 852 | |
| 853 | cs = MyComparableSet() |
| 854 | ncs = MyNonComparableSet() |
Raymond Hettinger | dd5e53a | 2014-05-26 00:09:04 -0700 | [diff] [blame] | 855 | self.assertFalse(ncs < cs) |
| 856 | self.assertTrue(ncs <= cs) |
| 857 | self.assertFalse(ncs > cs) |
| 858 | self.assertTrue(ncs >= cs) |
| 859 | |
| 860 | def assertSameSet(self, s1, s2): |
| 861 | # coerce both to a real set then check equality |
| 862 | self.assertSetEqual(set(s1), set(s2)) |
| 863 | |
| 864 | def test_Set_interoperability_with_real_sets(self): |
| 865 | # Issue: 8743 |
| 866 | class ListSet(Set): |
| 867 | def __init__(self, elements=()): |
| 868 | self.data = [] |
| 869 | for elem in elements: |
| 870 | if elem not in self.data: |
| 871 | self.data.append(elem) |
| 872 | def __contains__(self, elem): |
| 873 | return elem in self.data |
| 874 | def __iter__(self): |
| 875 | return iter(self.data) |
| 876 | def __len__(self): |
| 877 | return len(self.data) |
| 878 | def __repr__(self): |
| 879 | return 'Set({!r})'.format(self.data) |
| 880 | |
| 881 | r1 = set('abc') |
| 882 | r2 = set('bcd') |
| 883 | r3 = set('abcde') |
| 884 | f1 = ListSet('abc') |
| 885 | f2 = ListSet('bcd') |
| 886 | f3 = ListSet('abcde') |
| 887 | l1 = list('abccba') |
| 888 | l2 = list('bcddcb') |
| 889 | l3 = list('abcdeedcba') |
| 890 | |
| 891 | target = r1 & r2 |
| 892 | self.assertSameSet(f1 & f2, target) |
| 893 | self.assertSameSet(f1 & r2, target) |
| 894 | self.assertSameSet(r2 & f1, target) |
| 895 | self.assertSameSet(f1 & l2, target) |
| 896 | |
| 897 | target = r1 | r2 |
| 898 | self.assertSameSet(f1 | f2, target) |
| 899 | self.assertSameSet(f1 | r2, target) |
| 900 | self.assertSameSet(r2 | f1, target) |
| 901 | self.assertSameSet(f1 | l2, target) |
| 902 | |
| 903 | fwd_target = r1 - r2 |
| 904 | rev_target = r2 - r1 |
| 905 | self.assertSameSet(f1 - f2, fwd_target) |
| 906 | self.assertSameSet(f2 - f1, rev_target) |
| 907 | self.assertSameSet(f1 - r2, fwd_target) |
| 908 | self.assertSameSet(f2 - r1, rev_target) |
| 909 | self.assertSameSet(r1 - f2, fwd_target) |
| 910 | self.assertSameSet(r2 - f1, rev_target) |
| 911 | self.assertSameSet(f1 - l2, fwd_target) |
| 912 | self.assertSameSet(f2 - l1, rev_target) |
| 913 | |
| 914 | target = r1 ^ r2 |
| 915 | self.assertSameSet(f1 ^ f2, target) |
| 916 | self.assertSameSet(f1 ^ r2, target) |
| 917 | self.assertSameSet(r2 ^ f1, target) |
| 918 | self.assertSameSet(f1 ^ l2, target) |
| 919 | |
| 920 | # Don't change the following to use assertLess or other |
| 921 | # "more specific" unittest assertions. The current |
| 922 | # assertTrue/assertFalse style makes the pattern of test |
| 923 | # case combinations clear and allows us to know for sure |
| 924 | # the exact operator being invoked. |
| 925 | |
| 926 | # proper subset |
| 927 | self.assertTrue(f1 < f3) |
| 928 | self.assertFalse(f1 < f1) |
| 929 | self.assertFalse(f1 < f2) |
| 930 | self.assertTrue(r1 < f3) |
| 931 | self.assertFalse(r1 < f1) |
| 932 | self.assertFalse(r1 < f2) |
| 933 | self.assertTrue(r1 < r3) |
| 934 | self.assertFalse(r1 < r1) |
| 935 | self.assertFalse(r1 < r2) |
Andrew Svetlov | bcac6ad | 2012-11-01 13:28:54 +0200 | [diff] [blame] | 936 | with self.assertRaises(TypeError): |
Raymond Hettinger | dd5e53a | 2014-05-26 00:09:04 -0700 | [diff] [blame] | 937 | f1 < l3 |
Andrew Svetlov | bcac6ad | 2012-11-01 13:28:54 +0200 | [diff] [blame] | 938 | with self.assertRaises(TypeError): |
Raymond Hettinger | dd5e53a | 2014-05-26 00:09:04 -0700 | [diff] [blame] | 939 | f1 < l1 |
Andrew Svetlov | bcac6ad | 2012-11-01 13:28:54 +0200 | [diff] [blame] | 940 | with self.assertRaises(TypeError): |
Raymond Hettinger | dd5e53a | 2014-05-26 00:09:04 -0700 | [diff] [blame] | 941 | f1 < l2 |
| 942 | |
| 943 | # any subset |
| 944 | self.assertTrue(f1 <= f3) |
| 945 | self.assertTrue(f1 <= f1) |
| 946 | self.assertFalse(f1 <= f2) |
| 947 | self.assertTrue(r1 <= f3) |
| 948 | self.assertTrue(r1 <= f1) |
| 949 | self.assertFalse(r1 <= f2) |
| 950 | self.assertTrue(r1 <= r3) |
| 951 | self.assertTrue(r1 <= r1) |
| 952 | self.assertFalse(r1 <= r2) |
Andrew Svetlov | bcac6ad | 2012-11-01 13:28:54 +0200 | [diff] [blame] | 953 | with self.assertRaises(TypeError): |
Raymond Hettinger | dd5e53a | 2014-05-26 00:09:04 -0700 | [diff] [blame] | 954 | f1 <= l3 |
| 955 | with self.assertRaises(TypeError): |
| 956 | f1 <= l1 |
| 957 | with self.assertRaises(TypeError): |
| 958 | f1 <= l2 |
| 959 | |
| 960 | # proper superset |
| 961 | self.assertTrue(f3 > f1) |
| 962 | self.assertFalse(f1 > f1) |
| 963 | self.assertFalse(f2 > f1) |
| 964 | self.assertTrue(r3 > r1) |
| 965 | self.assertFalse(f1 > r1) |
| 966 | self.assertFalse(f2 > r1) |
| 967 | self.assertTrue(r3 > r1) |
| 968 | self.assertFalse(r1 > r1) |
| 969 | self.assertFalse(r2 > r1) |
| 970 | with self.assertRaises(TypeError): |
| 971 | f1 > l3 |
| 972 | with self.assertRaises(TypeError): |
| 973 | f1 > l1 |
| 974 | with self.assertRaises(TypeError): |
| 975 | f1 > l2 |
| 976 | |
| 977 | # any superset |
| 978 | self.assertTrue(f3 >= f1) |
| 979 | self.assertTrue(f1 >= f1) |
| 980 | self.assertFalse(f2 >= f1) |
| 981 | self.assertTrue(r3 >= r1) |
| 982 | self.assertTrue(f1 >= r1) |
| 983 | self.assertFalse(f2 >= r1) |
| 984 | self.assertTrue(r3 >= r1) |
| 985 | self.assertTrue(r1 >= r1) |
| 986 | self.assertFalse(r2 >= r1) |
| 987 | with self.assertRaises(TypeError): |
| 988 | f1 >= l3 |
| 989 | with self.assertRaises(TypeError): |
| 990 | f1 >=l1 |
| 991 | with self.assertRaises(TypeError): |
| 992 | f1 >= l2 |
| 993 | |
| 994 | # equality |
| 995 | self.assertTrue(f1 == f1) |
| 996 | self.assertTrue(r1 == f1) |
| 997 | self.assertTrue(f1 == r1) |
| 998 | self.assertFalse(f1 == f3) |
| 999 | self.assertFalse(r1 == f3) |
| 1000 | self.assertFalse(f1 == r3) |
| 1001 | self.assertFalse(f1 == l3) |
| 1002 | self.assertFalse(f1 == l1) |
| 1003 | self.assertFalse(f1 == l2) |
| 1004 | |
| 1005 | # inequality |
| 1006 | self.assertFalse(f1 != f1) |
| 1007 | self.assertFalse(r1 != f1) |
| 1008 | self.assertFalse(f1 != r1) |
| 1009 | self.assertTrue(f1 != f3) |
| 1010 | self.assertTrue(r1 != f3) |
| 1011 | self.assertTrue(f1 != r3) |
| 1012 | self.assertTrue(f1 != l3) |
| 1013 | self.assertTrue(f1 != l1) |
| 1014 | self.assertTrue(f1 != l2) |
Andrew Svetlov | bcac6ad | 2012-11-01 13:28:54 +0200 | [diff] [blame] | 1015 | |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 1016 | def test_Mapping(self): |
| 1017 | for sample in [dict]: |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 1018 | self.assertIsInstance(sample(), Mapping) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 1019 | self.assertTrue(issubclass(sample, Mapping)) |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 1020 | self.validate_abstract_methods(Mapping, '__contains__', '__iter__', '__len__', |
| 1021 | '__getitem__') |
Raymond Hettinger | 57d1a88 | 2011-02-23 00:46:28 +0000 | [diff] [blame] | 1022 | class MyMapping(Mapping): |
Benjamin Peterson | 4ad6bd5 | 2010-05-21 20:55:22 +0000 | [diff] [blame] | 1023 | def __len__(self): |
| 1024 | return 0 |
| 1025 | def __getitem__(self, i): |
| 1026 | raise IndexError |
| 1027 | def __iter__(self): |
| 1028 | return iter(()) |
| 1029 | self.validate_comparison(MyMapping()) |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 1030 | |
| 1031 | def test_MutableMapping(self): |
| 1032 | for sample in [dict]: |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 1033 | self.assertIsInstance(sample(), MutableMapping) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 1034 | self.assertTrue(issubclass(sample, MutableMapping)) |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 1035 | self.validate_abstract_methods(MutableMapping, '__contains__', '__iter__', '__len__', |
| 1036 | '__getitem__', '__setitem__', '__delitem__') |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 1037 | |
Raymond Hettinger | 9117c75 | 2010-08-22 07:44:24 +0000 | [diff] [blame] | 1038 | def test_MutableMapping_subclass(self): |
| 1039 | # Test issue 9214 |
| 1040 | mymap = UserDict() |
| 1041 | mymap['red'] = 5 |
| 1042 | self.assertIsInstance(mymap.keys(), Set) |
| 1043 | self.assertIsInstance(mymap.keys(), KeysView) |
| 1044 | self.assertIsInstance(mymap.items(), Set) |
| 1045 | self.assertIsInstance(mymap.items(), ItemsView) |
| 1046 | |
| 1047 | mymap = UserDict() |
| 1048 | mymap['red'] = 5 |
| 1049 | z = mymap.keys() | {'orange'} |
| 1050 | self.assertIsInstance(z, set) |
| 1051 | list(z) |
| 1052 | mymap['blue'] = 7 # Shouldn't affect 'z' |
| 1053 | self.assertEqual(sorted(z), ['orange', 'red']) |
| 1054 | |
| 1055 | mymap = UserDict() |
| 1056 | mymap['red'] = 5 |
| 1057 | z = mymap.items() | {('orange', 3)} |
| 1058 | self.assertIsInstance(z, set) |
| 1059 | list(z) |
| 1060 | mymap['blue'] = 7 # Shouldn't affect 'z' |
| 1061 | self.assertEqual(sorted(z), [('orange', 3), ('red', 5)]) |
| 1062 | |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 1063 | def test_Sequence(self): |
| 1064 | for sample in [tuple, list, bytes, str]: |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 1065 | self.assertIsInstance(sample(), Sequence) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 1066 | self.assertTrue(issubclass(sample, Sequence)) |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 1067 | self.assertIsInstance(range(10), Sequence) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 1068 | self.assertTrue(issubclass(range, Sequence)) |
Nick Coghlan | 45163cc | 2013-10-02 22:31:47 +1000 | [diff] [blame] | 1069 | self.assertIsInstance(memoryview(b""), Sequence) |
| 1070 | self.assertTrue(issubclass(memoryview, Sequence)) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 1071 | self.assertTrue(issubclass(str, Sequence)) |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 1072 | self.validate_abstract_methods(Sequence, '__contains__', '__iter__', '__len__', |
| 1073 | '__getitem__') |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 1074 | |
Guido van Rossum | d05eb00 | 2007-11-21 22:26:24 +0000 | [diff] [blame] | 1075 | def test_ByteString(self): |
| 1076 | for sample in [bytes, bytearray]: |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 1077 | self.assertIsInstance(sample(), ByteString) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 1078 | self.assertTrue(issubclass(sample, ByteString)) |
Guido van Rossum | d05eb00 | 2007-11-21 22:26:24 +0000 | [diff] [blame] | 1079 | for sample in [str, list, tuple]: |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 1080 | self.assertNotIsInstance(sample(), ByteString) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 1081 | self.assertFalse(issubclass(sample, ByteString)) |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 1082 | self.assertNotIsInstance(memoryview(b""), ByteString) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 1083 | self.assertFalse(issubclass(memoryview, ByteString)) |
Guido van Rossum | d05eb00 | 2007-11-21 22:26:24 +0000 | [diff] [blame] | 1084 | |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 1085 | def test_MutableSequence(self): |
Guido van Rossum | d05eb00 | 2007-11-21 22:26:24 +0000 | [diff] [blame] | 1086 | for sample in [tuple, str, bytes]: |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 1087 | self.assertNotIsInstance(sample(), MutableSequence) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 1088 | self.assertFalse(issubclass(sample, MutableSequence)) |
Raymond Hettinger | 32ea165 | 2015-03-21 01:37:37 -0700 | [diff] [blame] | 1089 | for sample in [list, bytearray, deque]: |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 1090 | self.assertIsInstance(sample(), MutableSequence) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 1091 | self.assertTrue(issubclass(sample, MutableSequence)) |
| 1092 | self.assertFalse(issubclass(str, MutableSequence)) |
Raymond Hettinger | ae65018 | 2009-01-28 23:33:59 +0000 | [diff] [blame] | 1093 | self.validate_abstract_methods(MutableSequence, '__contains__', '__iter__', |
| 1094 | '__len__', '__getitem__', '__setitem__', '__delitem__', 'insert') |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 1095 | |
Eli Bendersky | 0716a57 | 2011-03-04 10:38:14 +0000 | [diff] [blame] | 1096 | def test_MutableSequence_mixins(self): |
| 1097 | # Test the mixins of MutableSequence by creating a miminal concrete |
| 1098 | # class inherited from it. |
| 1099 | class MutableSequenceSubclass(MutableSequence): |
| 1100 | def __init__(self): |
| 1101 | self.lst = [] |
| 1102 | |
| 1103 | def __setitem__(self, index, value): |
| 1104 | self.lst[index] = value |
| 1105 | |
| 1106 | def __getitem__(self, index): |
| 1107 | return self.lst[index] |
| 1108 | |
| 1109 | def __len__(self): |
| 1110 | return len(self.lst) |
| 1111 | |
| 1112 | def __delitem__(self, index): |
| 1113 | del self.lst[index] |
| 1114 | |
| 1115 | def insert(self, index, value): |
| 1116 | self.lst.insert(index, value) |
| 1117 | |
| 1118 | mss = MutableSequenceSubclass() |
| 1119 | mss.append(0) |
| 1120 | mss.extend((1, 2, 3, 4)) |
| 1121 | self.assertEqual(len(mss), 5) |
| 1122 | self.assertEqual(mss[3], 3) |
| 1123 | mss.reverse() |
| 1124 | self.assertEqual(mss[3], 1) |
| 1125 | mss.pop() |
| 1126 | self.assertEqual(len(mss), 4) |
| 1127 | mss.remove(3) |
| 1128 | self.assertEqual(len(mss), 3) |
| 1129 | mss += (10, 20, 30) |
| 1130 | self.assertEqual(len(mss), 6) |
| 1131 | self.assertEqual(mss[-1], 30) |
| 1132 | mss.clear() |
| 1133 | self.assertEqual(len(mss), 0) |
Raymond Hettinger | 499e193 | 2011-02-23 07:56:53 +0000 | [diff] [blame] | 1134 | |
| 1135 | ################################################################################ |
| 1136 | ### Counter |
| 1137 | ################################################################################ |
| 1138 | |
Raymond Hettinger | cb1d96f | 2013-10-04 16:51:02 -0700 | [diff] [blame] | 1139 | class CounterSubclassWithSetItem(Counter): |
| 1140 | # Test a counter subclass that overrides __setitem__ |
| 1141 | def __init__(self, *args, **kwds): |
| 1142 | self.called = False |
| 1143 | Counter.__init__(self, *args, **kwds) |
| 1144 | def __setitem__(self, key, value): |
| 1145 | self.called = True |
| 1146 | Counter.__setitem__(self, key, value) |
| 1147 | |
| 1148 | class CounterSubclassWithGet(Counter): |
| 1149 | # Test a counter subclass that overrides get() |
| 1150 | def __init__(self, *args, **kwds): |
| 1151 | self.called = False |
| 1152 | Counter.__init__(self, *args, **kwds) |
| 1153 | def get(self, key, default): |
| 1154 | self.called = True |
| 1155 | return Counter.get(self, key, default) |
| 1156 | |
Raymond Hettinger | b8baf63 | 2009-01-14 02:20:07 +0000 | [diff] [blame] | 1157 | class TestCounter(unittest.TestCase): |
| 1158 | |
| 1159 | def test_basics(self): |
| 1160 | c = Counter('abcaba') |
Raymond Hettinger | 4d2073a | 2009-01-20 03:41:22 +0000 | [diff] [blame] | 1161 | self.assertEqual(c, Counter({'a':3 , 'b': 2, 'c': 1})) |
| 1162 | self.assertEqual(c, Counter(a=3, b=2, c=1)) |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 1163 | self.assertIsInstance(c, dict) |
| 1164 | self.assertIsInstance(c, Mapping) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 1165 | self.assertTrue(issubclass(Counter, dict)) |
| 1166 | self.assertTrue(issubclass(Counter, Mapping)) |
Raymond Hettinger | b8baf63 | 2009-01-14 02:20:07 +0000 | [diff] [blame] | 1167 | self.assertEqual(len(c), 3) |
| 1168 | self.assertEqual(sum(c.values()), 6) |
| 1169 | self.assertEqual(sorted(c.values()), [1, 2, 3]) |
| 1170 | self.assertEqual(sorted(c.keys()), ['a', 'b', 'c']) |
| 1171 | self.assertEqual(sorted(c), ['a', 'b', 'c']) |
| 1172 | self.assertEqual(sorted(c.items()), |
| 1173 | [('a', 3), ('b', 2), ('c', 1)]) |
| 1174 | self.assertEqual(c['b'], 2) |
| 1175 | self.assertEqual(c['z'], 0) |
| 1176 | self.assertEqual(c.__contains__('c'), True) |
| 1177 | self.assertEqual(c.__contains__('z'), False) |
| 1178 | self.assertEqual(c.get('b', 10), 2) |
| 1179 | self.assertEqual(c.get('z', 10), 10) |
| 1180 | self.assertEqual(c, dict(a=3, b=2, c=1)) |
| 1181 | self.assertEqual(repr(c), "Counter({'a': 3, 'b': 2, 'c': 1})") |
| 1182 | self.assertEqual(c.most_common(), [('a', 3), ('b', 2), ('c', 1)]) |
| 1183 | for i in range(5): |
| 1184 | self.assertEqual(c.most_common(i), |
| 1185 | [('a', 3), ('b', 2), ('c', 1)][:i]) |
| 1186 | self.assertEqual(''.join(sorted(c.elements())), 'aaabbc') |
| 1187 | c['a'] += 1 # increment an existing value |
| 1188 | c['b'] -= 2 # sub existing value to zero |
| 1189 | del c['c'] # remove an entry |
Raymond Hettinger | 4d2073a | 2009-01-20 03:41:22 +0000 | [diff] [blame] | 1190 | del c['c'] # make sure that del doesn't raise KeyError |
Raymond Hettinger | b8baf63 | 2009-01-14 02:20:07 +0000 | [diff] [blame] | 1191 | c['d'] -= 2 # sub from a missing value |
| 1192 | c['e'] = -5 # directly assign a missing value |
| 1193 | c['f'] += 4 # add to a missing value |
| 1194 | self.assertEqual(c, dict(a=4, b=0, d=-2, e=-5, f=4)) |
| 1195 | self.assertEqual(''.join(sorted(c.elements())), 'aaaaffff') |
| 1196 | self.assertEqual(c.pop('f'), 4) |
Ezio Melotti | b58e0bd | 2010-01-23 15:40:09 +0000 | [diff] [blame] | 1197 | self.assertNotIn('f', c) |
Raymond Hettinger | b8baf63 | 2009-01-14 02:20:07 +0000 | [diff] [blame] | 1198 | for i in range(3): |
| 1199 | elem, cnt = c.popitem() |
Ezio Melotti | b58e0bd | 2010-01-23 15:40:09 +0000 | [diff] [blame] | 1200 | self.assertNotIn(elem, c) |
Raymond Hettinger | b8baf63 | 2009-01-14 02:20:07 +0000 | [diff] [blame] | 1201 | c.clear() |
| 1202 | self.assertEqual(c, {}) |
| 1203 | self.assertEqual(repr(c), 'Counter()') |
| 1204 | self.assertRaises(NotImplementedError, Counter.fromkeys, 'abc') |
| 1205 | self.assertRaises(TypeError, hash, c) |
Raymond Hettinger | 4d2073a | 2009-01-20 03:41:22 +0000 | [diff] [blame] | 1206 | c.update(dict(a=5, b=3)) |
| 1207 | c.update(c=1) |
Raymond Hettinger | b8baf63 | 2009-01-14 02:20:07 +0000 | [diff] [blame] | 1208 | c.update(Counter('a' * 50 + 'b' * 30)) |
| 1209 | c.update() # test case with no args |
| 1210 | c.__init__('a' * 500 + 'b' * 300) |
| 1211 | c.__init__('cdc') |
| 1212 | c.__init__() |
| 1213 | self.assertEqual(c, dict(a=555, b=333, c=3, d=1)) |
| 1214 | self.assertEqual(c.setdefault('d', 5), 1) |
| 1215 | self.assertEqual(c['d'], 1) |
| 1216 | self.assertEqual(c.setdefault('e', 5), 5) |
| 1217 | self.assertEqual(c['e'], 5) |
| 1218 | |
Serhiy Storchaka | ae5cb21 | 2014-11-27 16:25:51 +0200 | [diff] [blame] | 1219 | def test_init(self): |
| 1220 | self.assertEqual(list(Counter(self=42).items()), [('self', 42)]) |
| 1221 | self.assertEqual(list(Counter(iterable=42).items()), [('iterable', 42)]) |
| 1222 | self.assertEqual(list(Counter(iterable=None).items()), [('iterable', None)]) |
| 1223 | self.assertRaises(TypeError, Counter, 42) |
| 1224 | self.assertRaises(TypeError, Counter, (), ()) |
| 1225 | self.assertRaises(TypeError, Counter.__init__) |
| 1226 | |
| 1227 | def test_update(self): |
| 1228 | c = Counter() |
| 1229 | c.update(self=42) |
| 1230 | self.assertEqual(list(c.items()), [('self', 42)]) |
| 1231 | c = Counter() |
| 1232 | c.update(iterable=42) |
| 1233 | self.assertEqual(list(c.items()), [('iterable', 42)]) |
| 1234 | c = Counter() |
| 1235 | c.update(iterable=None) |
| 1236 | self.assertEqual(list(c.items()), [('iterable', None)]) |
| 1237 | self.assertRaises(TypeError, Counter().update, 42) |
| 1238 | self.assertRaises(TypeError, Counter().update, {}, {}) |
| 1239 | self.assertRaises(TypeError, Counter.update) |
| 1240 | |
Raymond Hettinger | b8baf63 | 2009-01-14 02:20:07 +0000 | [diff] [blame] | 1241 | def test_copying(self): |
| 1242 | # Check that counters are copyable, deepcopyable, picklable, and |
| 1243 | #have a repr/eval round-trip |
| 1244 | words = Counter('which witch had which witches wrist watch'.split()) |
Serhiy Storchaka | bad1257 | 2014-12-15 14:03:42 +0200 | [diff] [blame] | 1245 | def check(dup): |
| 1246 | msg = "\ncopy: %s\nwords: %s" % (dup, words) |
| 1247 | self.assertIsNot(dup, words, msg) |
| 1248 | self.assertEqual(dup, words) |
| 1249 | check(words.copy()) |
| 1250 | check(copy.copy(words)) |
| 1251 | check(copy.deepcopy(words)) |
| 1252 | for proto in range(pickle.HIGHEST_PROTOCOL + 1): |
| 1253 | with self.subTest(proto=proto): |
| 1254 | check(pickle.loads(pickle.dumps(words, proto))) |
| 1255 | check(eval(repr(words))) |
Raymond Hettinger | b8baf63 | 2009-01-14 02:20:07 +0000 | [diff] [blame] | 1256 | update_test = Counter() |
| 1257 | update_test.update(words) |
Serhiy Storchaka | bad1257 | 2014-12-15 14:03:42 +0200 | [diff] [blame] | 1258 | check(update_test) |
| 1259 | check(Counter(words)) |
Raymond Hettinger | b8baf63 | 2009-01-14 02:20:07 +0000 | [diff] [blame] | 1260 | |
Raymond Hettinger | 1c746c2 | 2011-04-15 13:16:46 -0700 | [diff] [blame] | 1261 | def test_copy_subclass(self): |
| 1262 | class MyCounter(Counter): |
| 1263 | pass |
| 1264 | c = MyCounter('slartibartfast') |
| 1265 | d = c.copy() |
| 1266 | self.assertEqual(d, c) |
| 1267 | self.assertEqual(len(d), len(c)) |
| 1268 | self.assertEqual(type(d), type(c)) |
| 1269 | |
Raymond Hettinger | b8baf63 | 2009-01-14 02:20:07 +0000 | [diff] [blame] | 1270 | def test_conversions(self): |
| 1271 | # Convert to: set, list, dict |
| 1272 | s = 'she sells sea shells by the sea shore' |
| 1273 | self.assertEqual(sorted(Counter(s).elements()), sorted(s)) |
| 1274 | self.assertEqual(sorted(Counter(s)), sorted(set(s))) |
| 1275 | self.assertEqual(dict(Counter(s)), dict(Counter(s).items())) |
| 1276 | self.assertEqual(set(Counter(s)), set(s)) |
| 1277 | |
Raymond Hettinger | 670eaec | 2009-01-21 23:14:07 +0000 | [diff] [blame] | 1278 | def test_invariant_for_the_in_operator(self): |
| 1279 | c = Counter(a=10, b=-2, c=0) |
| 1280 | for elem in c: |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 1281 | self.assertTrue(elem in c) |
Benjamin Peterson | 577473f | 2010-01-19 00:09:57 +0000 | [diff] [blame] | 1282 | self.assertIn(elem, c) |
Raymond Hettinger | 670eaec | 2009-01-21 23:14:07 +0000 | [diff] [blame] | 1283 | |
Raymond Hettinger | 4d2073a | 2009-01-20 03:41:22 +0000 | [diff] [blame] | 1284 | def test_multiset_operations(self): |
| 1285 | # Verify that adding a zero counter will strip zeros and negatives |
| 1286 | c = Counter(a=10, b=-2, c=0) + Counter() |
| 1287 | self.assertEqual(dict(c), dict(a=10)) |
Raymond Hettinger | b8baf63 | 2009-01-14 02:20:07 +0000 | [diff] [blame] | 1288 | |
Raymond Hettinger | 4d2073a | 2009-01-20 03:41:22 +0000 | [diff] [blame] | 1289 | elements = 'abcd' |
| 1290 | for i in range(1000): |
| 1291 | # test random pairs of multisets |
| 1292 | p = Counter(dict((elem, randrange(-2,4)) for elem in elements)) |
Raymond Hettinger | e0d1b9f | 2009-01-21 20:36:27 +0000 | [diff] [blame] | 1293 | p.update(e=1, f=-1, g=0) |
Raymond Hettinger | 4d2073a | 2009-01-20 03:41:22 +0000 | [diff] [blame] | 1294 | q = Counter(dict((elem, randrange(-2,4)) for elem in elements)) |
Raymond Hettinger | e0d1b9f | 2009-01-21 20:36:27 +0000 | [diff] [blame] | 1295 | q.update(h=1, i=-1, j=0) |
| 1296 | for counterop, numberop in [ |
| 1297 | (Counter.__add__, lambda x, y: max(0, x+y)), |
| 1298 | (Counter.__sub__, lambda x, y: max(0, x-y)), |
| 1299 | (Counter.__or__, lambda x, y: max(0,x,y)), |
| 1300 | (Counter.__and__, lambda x, y: max(0, min(x,y))), |
Raymond Hettinger | 4d2073a | 2009-01-20 03:41:22 +0000 | [diff] [blame] | 1301 | ]: |
| 1302 | result = counterop(p, q) |
| 1303 | for x in elements: |
Raymond Hettinger | e0d1b9f | 2009-01-21 20:36:27 +0000 | [diff] [blame] | 1304 | self.assertEqual(numberop(p[x], q[x]), result[x], |
| 1305 | (counterop, x, p, q)) |
Raymond Hettinger | 4d2073a | 2009-01-20 03:41:22 +0000 | [diff] [blame] | 1306 | # verify that results exclude non-positive counts |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 1307 | self.assertTrue(x>0 for x in result.values()) |
Raymond Hettinger | 4d2073a | 2009-01-20 03:41:22 +0000 | [diff] [blame] | 1308 | |
| 1309 | elements = 'abcdef' |
| 1310 | for i in range(100): |
| 1311 | # verify that random multisets with no repeats are exactly like sets |
| 1312 | p = Counter(dict((elem, randrange(0, 2)) for elem in elements)) |
| 1313 | q = Counter(dict((elem, randrange(0, 2)) for elem in elements)) |
| 1314 | for counterop, setop in [ |
| 1315 | (Counter.__sub__, set.__sub__), |
| 1316 | (Counter.__or__, set.__or__), |
| 1317 | (Counter.__and__, set.__and__), |
| 1318 | ]: |
| 1319 | counter_result = counterop(p, q) |
| 1320 | set_result = setop(set(p.elements()), set(q.elements())) |
| 1321 | self.assertEqual(counter_result, dict.fromkeys(set_result, 1)) |
Raymond Hettinger | b8baf63 | 2009-01-14 02:20:07 +0000 | [diff] [blame] | 1322 | |
Raymond Hettinger | becd568 | 2011-10-19 13:40:37 -0700 | [diff] [blame] | 1323 | def test_inplace_operations(self): |
| 1324 | elements = 'abcd' |
| 1325 | for i in range(1000): |
| 1326 | # test random pairs of multisets |
| 1327 | p = Counter(dict((elem, randrange(-2,4)) for elem in elements)) |
| 1328 | p.update(e=1, f=-1, g=0) |
| 1329 | q = Counter(dict((elem, randrange(-2,4)) for elem in elements)) |
| 1330 | q.update(h=1, i=-1, j=0) |
| 1331 | for inplace_op, regular_op in [ |
| 1332 | (Counter.__iadd__, Counter.__add__), |
| 1333 | (Counter.__isub__, Counter.__sub__), |
| 1334 | (Counter.__ior__, Counter.__or__), |
| 1335 | (Counter.__iand__, Counter.__and__), |
| 1336 | ]: |
| 1337 | c = p.copy() |
| 1338 | c_id = id(c) |
| 1339 | regular_result = regular_op(c, q) |
| 1340 | inplace_result = inplace_op(c, q) |
| 1341 | self.assertEqual(inplace_result, regular_result) |
| 1342 | self.assertEqual(id(inplace_result), c_id) |
| 1343 | |
Raymond Hettinger | 9c01e44 | 2010-04-03 10:32:58 +0000 | [diff] [blame] | 1344 | def test_subtract(self): |
| 1345 | c = Counter(a=-5, b=0, c=5, d=10, e=15,g=40) |
| 1346 | c.subtract(a=1, b=2, c=-3, d=10, e=20, f=30, h=-50) |
| 1347 | self.assertEqual(c, Counter(a=-6, b=-2, c=8, d=0, e=-5, f=-30, g=40, h=50)) |
| 1348 | c = Counter(a=-5, b=0, c=5, d=10, e=15,g=40) |
| 1349 | c.subtract(Counter(a=1, b=2, c=-3, d=10, e=20, f=30, h=-50)) |
| 1350 | self.assertEqual(c, Counter(a=-6, b=-2, c=8, d=0, e=-5, f=-30, g=40, h=50)) |
| 1351 | c = Counter('aaabbcd') |
| 1352 | c.subtract('aaaabbcce') |
| 1353 | self.assertEqual(c, Counter(a=-1, b=0, c=-1, d=1, e=-1)) |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 1354 | |
Serhiy Storchaka | ae5cb21 | 2014-11-27 16:25:51 +0200 | [diff] [blame] | 1355 | c = Counter() |
| 1356 | c.subtract(self=42) |
| 1357 | self.assertEqual(list(c.items()), [('self', -42)]) |
| 1358 | c = Counter() |
| 1359 | c.subtract(iterable=42) |
| 1360 | self.assertEqual(list(c.items()), [('iterable', -42)]) |
| 1361 | self.assertRaises(TypeError, Counter().subtract, 42) |
| 1362 | self.assertRaises(TypeError, Counter().subtract, {}, {}) |
| 1363 | self.assertRaises(TypeError, Counter.subtract) |
| 1364 | |
Raymond Hettinger | fcb393c | 2011-08-09 13:00:40 -0700 | [diff] [blame] | 1365 | def test_unary(self): |
| 1366 | c = Counter(a=-5, b=0, c=5, d=10, e=15,g=40) |
| 1367 | self.assertEqual(dict(+c), dict(c=5, d=10, e=15, g=40)) |
| 1368 | self.assertEqual(dict(-c), dict(a=5)) |
| 1369 | |
Raymond Hettinger | 4e6bf41 | 2011-11-05 13:35:26 -0700 | [diff] [blame] | 1370 | def test_repr_nonsortable(self): |
| 1371 | c = Counter(a=2, b=None) |
| 1372 | r = repr(c) |
| 1373 | self.assertIn("'a': 2", r) |
| 1374 | self.assertIn("'b': None", r) |
Raymond Hettinger | 68fb89f | 2011-11-05 13:43:01 -0700 | [diff] [blame] | 1375 | |
Raymond Hettinger | 426e052 | 2011-01-03 02:12:02 +0000 | [diff] [blame] | 1376 | def test_helper_function(self): |
| 1377 | # two paths, one for real dicts and one for other mappings |
| 1378 | elems = list('abracadabra') |
| 1379 | |
| 1380 | d = dict() |
| 1381 | _count_elements(d, elems) |
| 1382 | self.assertEqual(d, {'a': 5, 'r': 2, 'b': 2, 'c': 1, 'd': 1}) |
| 1383 | |
| 1384 | m = OrderedDict() |
| 1385 | _count_elements(m, elems) |
| 1386 | self.assertEqual(m, |
| 1387 | OrderedDict([('a', 5), ('b', 2), ('r', 2), ('c', 1), ('d', 1)])) |
| 1388 | |
Raymond Hettinger | cb1d96f | 2013-10-04 16:51:02 -0700 | [diff] [blame] | 1389 | # test fidelity to the pure python version |
| 1390 | c = CounterSubclassWithSetItem('abracadabra') |
| 1391 | self.assertTrue(c.called) |
Raymond Hettinger | facd0a3 | 2013-10-05 17:14:51 -0700 | [diff] [blame] | 1392 | self.assertEqual(dict(c), {'a': 5, 'b': 2, 'c': 1, 'd': 1, 'r':2 }) |
Raymond Hettinger | cb1d96f | 2013-10-04 16:51:02 -0700 | [diff] [blame] | 1393 | c = CounterSubclassWithGet('abracadabra') |
| 1394 | self.assertTrue(c.called) |
Raymond Hettinger | facd0a3 | 2013-10-05 17:14:51 -0700 | [diff] [blame] | 1395 | self.assertEqual(dict(c), {'a': 5, 'b': 2, 'c': 1, 'd': 1, 'r':2 }) |
Raymond Hettinger | cb1d96f | 2013-10-04 16:51:02 -0700 | [diff] [blame] | 1396 | |
Raymond Hettinger | 499e193 | 2011-02-23 07:56:53 +0000 | [diff] [blame] | 1397 | |
| 1398 | ################################################################################ |
| 1399 | ### OrderedDict |
| 1400 | ################################################################################ |
| 1401 | |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 1402 | class TestOrderedDict(unittest.TestCase): |
| 1403 | |
| 1404 | def test_init(self): |
| 1405 | with self.assertRaises(TypeError): |
| 1406 | OrderedDict([('a', 1), ('b', 2)], None) # too many args |
| 1407 | pairs = [('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5)] |
| 1408 | self.assertEqual(sorted(OrderedDict(dict(pairs)).items()), pairs) # dict input |
| 1409 | self.assertEqual(sorted(OrderedDict(**dict(pairs)).items()), pairs) # kwds input |
| 1410 | self.assertEqual(list(OrderedDict(pairs).items()), pairs) # pairs input |
| 1411 | self.assertEqual(list(OrderedDict([('a', 1), ('b', 2), ('c', 9), ('d', 4)], |
| 1412 | c=3, e=5).items()), pairs) # mixed input |
| 1413 | |
| 1414 | # make sure no positional args conflict with possible kwdargs |
Serhiy Storchaka | ae5cb21 | 2014-11-27 16:25:51 +0200 | [diff] [blame] | 1415 | self.assertEqual(list(OrderedDict(self=42).items()), [('self', 42)]) |
| 1416 | self.assertEqual(list(OrderedDict(other=42).items()), [('other', 42)]) |
| 1417 | self.assertRaises(TypeError, OrderedDict, 42) |
| 1418 | self.assertRaises(TypeError, OrderedDict, (), ()) |
| 1419 | self.assertRaises(TypeError, OrderedDict.__init__) |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 1420 | |
| 1421 | # Make sure that direct calls to __init__ do not clear previous contents |
| 1422 | d = OrderedDict([('a', 1), ('b', 2), ('c', 3), ('d', 44), ('e', 55)]) |
| 1423 | d.__init__([('e', 5), ('f', 6)], g=7, d=4) |
| 1424 | self.assertEqual(list(d.items()), |
| 1425 | [('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5), ('f', 6), ('g', 7)]) |
| 1426 | |
| 1427 | def test_update(self): |
| 1428 | with self.assertRaises(TypeError): |
| 1429 | OrderedDict().update([('a', 1), ('b', 2)], None) # too many args |
| 1430 | pairs = [('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5)] |
| 1431 | od = OrderedDict() |
| 1432 | od.update(dict(pairs)) |
| 1433 | self.assertEqual(sorted(od.items()), pairs) # dict input |
| 1434 | od = OrderedDict() |
| 1435 | od.update(**dict(pairs)) |
| 1436 | self.assertEqual(sorted(od.items()), pairs) # kwds input |
| 1437 | od = OrderedDict() |
| 1438 | od.update(pairs) |
| 1439 | self.assertEqual(list(od.items()), pairs) # pairs input |
| 1440 | od = OrderedDict() |
| 1441 | od.update([('a', 1), ('b', 2), ('c', 9), ('d', 4)], c=3, e=5) |
| 1442 | self.assertEqual(list(od.items()), pairs) # mixed input |
| 1443 | |
Mark Dickinson | b214e90 | 2010-07-11 18:53:06 +0000 | [diff] [blame] | 1444 | # Issue 9137: Named argument called 'other' or 'self' |
| 1445 | # shouldn't be treated specially. |
| 1446 | od = OrderedDict() |
| 1447 | od.update(self=23) |
| 1448 | self.assertEqual(list(od.items()), [('self', 23)]) |
| 1449 | od = OrderedDict() |
| 1450 | od.update(other={}) |
| 1451 | self.assertEqual(list(od.items()), [('other', {})]) |
| 1452 | od = OrderedDict() |
| 1453 | od.update(red=5, blue=6, other=7, self=8) |
| 1454 | self.assertEqual(sorted(list(od.items())), |
| 1455 | [('blue', 6), ('other', 7), ('red', 5), ('self', 8)]) |
| 1456 | |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 1457 | # Make sure that direct calls to update do not clear previous contents |
| 1458 | # add that updates items are not moved to the end |
| 1459 | d = OrderedDict([('a', 1), ('b', 2), ('c', 3), ('d', 44), ('e', 55)]) |
| 1460 | d.update([('e', 5), ('f', 6)], g=7, d=4) |
| 1461 | self.assertEqual(list(d.items()), |
| 1462 | [('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5), ('f', 6), ('g', 7)]) |
| 1463 | |
Serhiy Storchaka | ae5cb21 | 2014-11-27 16:25:51 +0200 | [diff] [blame] | 1464 | self.assertRaises(TypeError, OrderedDict().update, 42) |
| 1465 | self.assertRaises(TypeError, OrderedDict().update, (), ()) |
| 1466 | self.assertRaises(TypeError, OrderedDict.update) |
| 1467 | |
Raymond Hettinger | 345c49b | 2011-01-01 23:51:55 +0000 | [diff] [blame] | 1468 | def test_abc(self): |
| 1469 | self.assertIsInstance(OrderedDict(), MutableMapping) |
| 1470 | self.assertTrue(issubclass(OrderedDict, MutableMapping)) |
| 1471 | |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 1472 | def test_clear(self): |
| 1473 | pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)] |
| 1474 | shuffle(pairs) |
| 1475 | od = OrderedDict(pairs) |
| 1476 | self.assertEqual(len(od), len(pairs)) |
| 1477 | od.clear() |
| 1478 | self.assertEqual(len(od), 0) |
| 1479 | |
| 1480 | def test_delitem(self): |
| 1481 | pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)] |
| 1482 | od = OrderedDict(pairs) |
| 1483 | del od['a'] |
Benjamin Peterson | 577473f | 2010-01-19 00:09:57 +0000 | [diff] [blame] | 1484 | self.assertNotIn('a', od) |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 1485 | with self.assertRaises(KeyError): |
| 1486 | del od['a'] |
| 1487 | self.assertEqual(list(od.items()), pairs[:2] + pairs[3:]) |
| 1488 | |
| 1489 | def test_setitem(self): |
| 1490 | od = OrderedDict([('d', 1), ('b', 2), ('c', 3), ('a', 4), ('e', 5)]) |
| 1491 | od['c'] = 10 # existing element |
| 1492 | od['f'] = 20 # new element |
| 1493 | self.assertEqual(list(od.items()), |
| 1494 | [('d', 1), ('b', 2), ('c', 10), ('a', 4), ('e', 5), ('f', 20)]) |
| 1495 | |
| 1496 | def test_iterators(self): |
| 1497 | pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)] |
| 1498 | shuffle(pairs) |
| 1499 | od = OrderedDict(pairs) |
| 1500 | self.assertEqual(list(od), [t[0] for t in pairs]) |
| 1501 | self.assertEqual(list(od.keys()), [t[0] for t in pairs]) |
| 1502 | self.assertEqual(list(od.values()), [t[1] for t in pairs]) |
| 1503 | self.assertEqual(list(od.items()), pairs) |
| 1504 | self.assertEqual(list(reversed(od)), |
| 1505 | [t[0] for t in reversed(pairs)]) |
Serhiy Storchaka | 578c921 | 2014-04-04 15:19:36 +0300 | [diff] [blame] | 1506 | self.assertEqual(list(reversed(od.keys())), |
| 1507 | [t[0] for t in reversed(pairs)]) |
| 1508 | self.assertEqual(list(reversed(od.values())), |
| 1509 | [t[1] for t in reversed(pairs)]) |
| 1510 | self.assertEqual(list(reversed(od.items())), list(reversed(pairs))) |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 1511 | |
Raymond Hettinger | 53d2c41 | 2014-05-03 21:58:45 -0700 | [diff] [blame] | 1512 | def test_detect_deletion_during_iteration(self): |
| 1513 | od = OrderedDict.fromkeys('abc') |
| 1514 | it = iter(od) |
| 1515 | key = next(it) |
| 1516 | del od[key] |
| 1517 | with self.assertRaises(Exception): |
| 1518 | # Note, the exact exception raised is not guaranteed |
| 1519 | # The only guarantee that the next() will not succeed |
| 1520 | next(it) |
| 1521 | |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 1522 | def test_popitem(self): |
| 1523 | pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)] |
| 1524 | shuffle(pairs) |
| 1525 | od = OrderedDict(pairs) |
| 1526 | while pairs: |
| 1527 | self.assertEqual(od.popitem(), pairs.pop()) |
| 1528 | with self.assertRaises(KeyError): |
| 1529 | od.popitem() |
| 1530 | self.assertEqual(len(od), 0) |
| 1531 | |
| 1532 | def test_pop(self): |
| 1533 | pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)] |
| 1534 | shuffle(pairs) |
| 1535 | od = OrderedDict(pairs) |
| 1536 | shuffle(pairs) |
| 1537 | while pairs: |
| 1538 | k, v = pairs.pop() |
| 1539 | self.assertEqual(od.pop(k), v) |
| 1540 | with self.assertRaises(KeyError): |
| 1541 | od.pop('xyz') |
| 1542 | self.assertEqual(len(od), 0) |
| 1543 | self.assertEqual(od.pop(k, 12345), 12345) |
| 1544 | |
Raymond Hettinger | 345c49b | 2011-01-01 23:51:55 +0000 | [diff] [blame] | 1545 | # make sure pop still works when __missing__ is defined |
| 1546 | class Missing(OrderedDict): |
| 1547 | def __missing__(self, key): |
| 1548 | return 0 |
| 1549 | m = Missing(a=1) |
| 1550 | self.assertEqual(m.pop('b', 5), 5) |
| 1551 | self.assertEqual(m.pop('a', 6), 1) |
| 1552 | self.assertEqual(m.pop('a', 6), 6) |
| 1553 | with self.assertRaises(KeyError): |
| 1554 | m.pop('a') |
| 1555 | |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 1556 | def test_equality(self): |
| 1557 | pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)] |
| 1558 | shuffle(pairs) |
| 1559 | od1 = OrderedDict(pairs) |
| 1560 | od2 = OrderedDict(pairs) |
| 1561 | self.assertEqual(od1, od2) # same order implies equality |
| 1562 | pairs = pairs[2:] + pairs[:2] |
| 1563 | od2 = OrderedDict(pairs) |
| 1564 | self.assertNotEqual(od1, od2) # different order implies inequality |
| 1565 | # comparison to regular dict is not order sensitive |
| 1566 | self.assertEqual(od1, dict(od2)) |
| 1567 | self.assertEqual(dict(od2), od1) |
| 1568 | # different length implied inequality |
| 1569 | self.assertNotEqual(od1, OrderedDict(pairs[:-1])) |
| 1570 | |
| 1571 | def test_copying(self): |
| 1572 | # Check that ordered dicts are copyable, deepcopyable, picklable, |
| 1573 | # and have a repr/eval round-trip |
| 1574 | pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)] |
| 1575 | od = OrderedDict(pairs) |
Serhiy Storchaka | bad1257 | 2014-12-15 14:03:42 +0200 | [diff] [blame] | 1576 | def check(dup): |
| 1577 | msg = "\ncopy: %s\nod: %s" % (dup, od) |
| 1578 | self.assertIsNot(dup, od, msg) |
| 1579 | self.assertEqual(dup, od) |
| 1580 | check(od.copy()) |
| 1581 | check(copy.copy(od)) |
| 1582 | check(copy.deepcopy(od)) |
| 1583 | for proto in range(pickle.HIGHEST_PROTOCOL + 1): |
| 1584 | with self.subTest(proto=proto): |
| 1585 | check(pickle.loads(pickle.dumps(od, proto))) |
| 1586 | check(eval(repr(od))) |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 1587 | update_test = OrderedDict() |
| 1588 | update_test.update(od) |
Serhiy Storchaka | bad1257 | 2014-12-15 14:03:42 +0200 | [diff] [blame] | 1589 | check(update_test) |
| 1590 | check(OrderedDict(od)) |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 1591 | |
Raymond Hettinger | 5b26fb5 | 2009-03-03 22:38:22 +0000 | [diff] [blame] | 1592 | def test_yaml_linkage(self): |
| 1593 | # Verify that __reduce__ is setup in a way that supports PyYAML's dump() feature. |
| 1594 | # In yaml, lists are native but tuples are not. |
| 1595 | pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)] |
| 1596 | od = OrderedDict(pairs) |
| 1597 | # yaml.dump(od) --> |
| 1598 | # '!!python/object/apply:__main__.OrderedDict\n- - [a, 1]\n - [b, 2]\n' |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 1599 | self.assertTrue(all(type(pair)==list for pair in od.__reduce__()[1])) |
Raymond Hettinger | 5b26fb5 | 2009-03-03 22:38:22 +0000 | [diff] [blame] | 1600 | |
Raymond Hettinger | b212157 | 2009-03-03 22:50:04 +0000 | [diff] [blame] | 1601 | def test_reduce_not_too_fat(self): |
| 1602 | # do not save instance dictionary if not needed |
| 1603 | pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)] |
| 1604 | od = OrderedDict(pairs) |
Serhiy Storchaka | 3ee6dab | 2013-05-21 12:47:57 +0300 | [diff] [blame] | 1605 | self.assertIsNone(od.__reduce__()[2]) |
Raymond Hettinger | b212157 | 2009-03-03 22:50:04 +0000 | [diff] [blame] | 1606 | od.x = 10 |
Serhiy Storchaka | 3ee6dab | 2013-05-21 12:47:57 +0300 | [diff] [blame] | 1607 | self.assertIsNotNone(od.__reduce__()[2]) |
| 1608 | |
| 1609 | def test_pickle_recursive(self): |
| 1610 | od = OrderedDict() |
| 1611 | od[1] = od |
| 1612 | for proto in range(-1, pickle.HIGHEST_PROTOCOL + 1): |
| 1613 | dup = pickle.loads(pickle.dumps(od, proto)) |
| 1614 | self.assertIsNot(dup, od) |
| 1615 | self.assertEqual(list(dup.keys()), [1]) |
| 1616 | self.assertIs(dup[1], dup) |
Raymond Hettinger | b212157 | 2009-03-03 22:50:04 +0000 | [diff] [blame] | 1617 | |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 1618 | def test_repr(self): |
| 1619 | od = OrderedDict([('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)]) |
| 1620 | self.assertEqual(repr(od), |
| 1621 | "OrderedDict([('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)])") |
| 1622 | self.assertEqual(eval(repr(od)), od) |
| 1623 | self.assertEqual(repr(OrderedDict()), "OrderedDict()") |
| 1624 | |
Raymond Hettinger | dc08a14 | 2010-09-12 05:15:22 +0000 | [diff] [blame] | 1625 | def test_repr_recursive(self): |
| 1626 | # See issue #9826 |
| 1627 | od = OrderedDict.fromkeys('abc') |
| 1628 | od['x'] = od |
| 1629 | self.assertEqual(repr(od), |
| 1630 | "OrderedDict([('a', None), ('b', None), ('c', None), ('x', ...)])") |
| 1631 | |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 1632 | def test_setdefault(self): |
| 1633 | pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)] |
| 1634 | shuffle(pairs) |
| 1635 | od = OrderedDict(pairs) |
| 1636 | pair_order = list(od.items()) |
| 1637 | self.assertEqual(od.setdefault('a', 10), 3) |
| 1638 | # make sure order didn't change |
| 1639 | self.assertEqual(list(od.items()), pair_order) |
| 1640 | self.assertEqual(od.setdefault('x', 10), 10) |
| 1641 | # make sure 'x' is added to the end |
| 1642 | self.assertEqual(list(od.items())[-1], ('x', 10)) |
| 1643 | |
Raymond Hettinger | a673b1f | 2010-12-31 23:16:17 +0000 | [diff] [blame] | 1644 | # make sure setdefault still works when __missing__ is defined |
| 1645 | class Missing(OrderedDict): |
| 1646 | def __missing__(self, key): |
| 1647 | return 0 |
| 1648 | self.assertEqual(Missing().setdefault(5, 9), 9) |
| 1649 | |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 1650 | def test_reinsert(self): |
| 1651 | # Given insert a, insert b, delete a, re-insert a, |
| 1652 | # verify that a is now later than b. |
| 1653 | od = OrderedDict() |
| 1654 | od['a'] = 1 |
| 1655 | od['b'] = 2 |
| 1656 | del od['a'] |
| 1657 | od['a'] = 1 |
| 1658 | self.assertEqual(list(od.items()), [('b', 2), ('a', 1)]) |
| 1659 | |
Raymond Hettinger | f45abc9 | 2010-09-06 21:26:09 +0000 | [diff] [blame] | 1660 | def test_move_to_end(self): |
| 1661 | od = OrderedDict.fromkeys('abcde') |
| 1662 | self.assertEqual(list(od), list('abcde')) |
| 1663 | od.move_to_end('c') |
| 1664 | self.assertEqual(list(od), list('abdec')) |
| 1665 | od.move_to_end('c', 0) |
| 1666 | self.assertEqual(list(od), list('cabde')) |
| 1667 | od.move_to_end('c', 0) |
| 1668 | self.assertEqual(list(od), list('cabde')) |
| 1669 | od.move_to_end('e') |
| 1670 | self.assertEqual(list(od), list('cabde')) |
| 1671 | with self.assertRaises(KeyError): |
| 1672 | od.move_to_end('x') |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 1673 | |
Raymond Hettinger | 35c87f2 | 2010-09-16 19:10:17 +0000 | [diff] [blame] | 1674 | def test_sizeof(self): |
| 1675 | # Wimpy test: Just verify the reported size is larger than a regular dict |
| 1676 | d = dict(a=1) |
| 1677 | od = OrderedDict(**d) |
| 1678 | self.assertGreater(sys.getsizeof(od), sys.getsizeof(d)) |
| 1679 | |
Raymond Hettinger | 32062e9 | 2011-01-01 22:38:00 +0000 | [diff] [blame] | 1680 | def test_override_update(self): |
| 1681 | # Verify that subclasses can override update() without breaking __init__() |
| 1682 | class MyOD(OrderedDict): |
| 1683 | def update(self, *args, **kwds): |
| 1684 | raise Exception() |
| 1685 | items = [('a', 1), ('c', 3), ('b', 2)] |
| 1686 | self.assertEqual(list(MyOD(items).items()), items) |
| 1687 | |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 1688 | class GeneralMappingTests(mapping_tests.BasicTestMappingProtocol): |
| 1689 | type2test = OrderedDict |
| 1690 | |
Raymond Hettinger | dc879f0 | 2009-03-19 20:30:56 +0000 | [diff] [blame] | 1691 | def test_popitem(self): |
| 1692 | d = self._empty_mapping() |
| 1693 | self.assertRaises(KeyError, d.popitem) |
| 1694 | |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 1695 | class MyOrderedDict(OrderedDict): |
| 1696 | pass |
| 1697 | |
| 1698 | class SubclassMappingTests(mapping_tests.BasicTestMappingProtocol): |
| 1699 | type2test = MyOrderedDict |
| 1700 | |
Raymond Hettinger | dc879f0 | 2009-03-19 20:30:56 +0000 | [diff] [blame] | 1701 | def test_popitem(self): |
| 1702 | d = self._empty_mapping() |
| 1703 | self.assertRaises(KeyError, d.popitem) |
Raymond Hettinger | 2d32f63 | 2009-03-02 21:24:57 +0000 | [diff] [blame] | 1704 | |
| 1705 | |
Raymond Hettinger | 499e193 | 2011-02-23 07:56:53 +0000 | [diff] [blame] | 1706 | ################################################################################ |
| 1707 | ### Run tests |
| 1708 | ################################################################################ |
| 1709 | |
Christian Heimes | 25bb783 | 2008-01-11 16:17:00 +0000 | [diff] [blame] | 1710 | import doctest, collections |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 1711 | |
Guido van Rossum | d8faa36 | 2007-04-27 19:54:29 +0000 | [diff] [blame] | 1712 | def test_main(verbose=None): |
Benjamin Peterson | ad9d48d | 2008-04-02 21:49:44 +0000 | [diff] [blame] | 1713 | NamedTupleDocs = doctest.DocTestSuite(module=collections) |
Raymond Hettinger | b8baf63 | 2009-01-14 02:20:07 +0000 | [diff] [blame] | 1714 | test_classes = [TestNamedTuple, NamedTupleDocs, TestOneTrickPonyABCs, |
Raymond Hettinger | d032131 | 2011-02-26 06:53:58 +0000 | [diff] [blame] | 1715 | TestCollectionABCs, TestCounter, TestChainMap, |
Serhiy Storchaka | a86700a | 2014-11-27 17:45:44 +0200 | [diff] [blame] | 1716 | TestOrderedDict, GeneralMappingTests, SubclassMappingTests] |
Benjamin Peterson | ee8712c | 2008-05-20 21:35:26 +0000 | [diff] [blame] | 1717 | support.run_unittest(*test_classes) |
| 1718 | support.run_doctest(collections, verbose) |
Guido van Rossum | d8faa36 | 2007-04-27 19:54:29 +0000 | [diff] [blame] | 1719 | |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 1720 | |
Guido van Rossum | d8faa36 | 2007-04-27 19:54:29 +0000 | [diff] [blame] | 1721 | if __name__ == "__main__": |
| 1722 | test_main(verbose=True) |