Walter Dörwald | 59b23e8 | 2004-09-30 13:46:00 +0000 | [diff] [blame] | 1 | import unittest |
| 2 | from test import test_support |
| 3 | |
| 4 | import sys, UserDict, cStringIO |
| 5 | |
| 6 | |
| 7 | class DictTest(unittest.TestCase): |
| 8 | def test_constructor(self): |
| 9 | # calling built-in types without argument must return empty |
| 10 | self.assertEqual(dict(), {}) |
| 11 | self.assert_(dict() is not {}) |
| 12 | |
| 13 | def test_bool(self): |
| 14 | self.assert_(not {}) |
| 15 | self.assert_({1: 2}) |
| 16 | self.assert_(bool({}) is False) |
| 17 | self.assert_(bool({1: 2}) is True) |
| 18 | |
| 19 | def test_keys(self): |
| 20 | d = {} |
| 21 | self.assertEqual(d.keys(), []) |
| 22 | d = {'a': 1, 'b': 2} |
| 23 | k = d.keys() |
| 24 | self.assert_(d.has_key('a')) |
| 25 | self.assert_(d.has_key('b')) |
| 26 | |
| 27 | self.assertRaises(TypeError, d.keys, None) |
| 28 | |
| 29 | def test_values(self): |
| 30 | d = {} |
| 31 | self.assertEqual(d.values(), []) |
| 32 | d = {1:2} |
| 33 | self.assertEqual(d.values(), [2]) |
| 34 | |
| 35 | self.assertRaises(TypeError, d.values, None) |
| 36 | |
| 37 | def test_items(self): |
| 38 | d = {} |
| 39 | self.assertEqual(d.items(), []) |
| 40 | |
| 41 | d = {1:2} |
| 42 | self.assertEqual(d.items(), [(1, 2)]) |
| 43 | |
| 44 | self.assertRaises(TypeError, d.items, None) |
| 45 | |
| 46 | def test_has_key(self): |
| 47 | d = {} |
| 48 | self.assert_(not d.has_key('a')) |
| 49 | d = {'a': 1, 'b': 2} |
| 50 | k = d.keys() |
| 51 | k.sort() |
| 52 | self.assertEqual(k, ['a', 'b']) |
| 53 | |
| 54 | self.assertRaises(TypeError, d.has_key) |
| 55 | |
| 56 | def test_contains(self): |
| 57 | d = {} |
| 58 | self.assert_(not ('a' in d)) |
| 59 | self.assert_('a' not in d) |
| 60 | d = {'a': 1, 'b': 2} |
| 61 | self.assert_('a' in d) |
| 62 | self.assert_('b' in d) |
| 63 | self.assert_('c' not in d) |
| 64 | |
| 65 | self.assertRaises(TypeError, d.__contains__) |
| 66 | |
| 67 | def test_len(self): |
| 68 | d = {} |
| 69 | self.assertEqual(len(d), 0) |
| 70 | d = {'a': 1, 'b': 2} |
| 71 | self.assertEqual(len(d), 2) |
| 72 | |
| 73 | def test_getitem(self): |
| 74 | d = {'a': 1, 'b': 2} |
| 75 | self.assertEqual(d['a'], 1) |
| 76 | self.assertEqual(d['b'], 2) |
| 77 | d['c'] = 3 |
| 78 | d['a'] = 4 |
| 79 | self.assertEqual(d['c'], 3) |
| 80 | self.assertEqual(d['a'], 4) |
| 81 | del d['b'] |
| 82 | self.assertEqual(d, {'a': 4, 'c': 3}) |
| 83 | |
| 84 | self.assertRaises(TypeError, d.__getitem__) |
| 85 | |
| 86 | class BadEq(object): |
| 87 | def __eq__(self, other): |
| 88 | raise Exc() |
| 89 | |
| 90 | d = {} |
| 91 | d[BadEq()] = 42 |
| 92 | self.assertRaises(KeyError, d.__getitem__, 23) |
| 93 | |
| 94 | class Exc(Exception): pass |
| 95 | |
| 96 | class BadHash(object): |
| 97 | fail = False |
| 98 | def __hash__(self): |
| 99 | if self.fail: |
| 100 | raise Exc() |
| 101 | else: |
| 102 | return 42 |
| 103 | |
| 104 | x = BadHash() |
| 105 | d[x] = 42 |
| 106 | x.fail = True |
| 107 | self.assertRaises(Exc, d.__getitem__, x) |
| 108 | |
| 109 | def test_clear(self): |
| 110 | d = {1:1, 2:2, 3:3} |
| 111 | d.clear() |
| 112 | self.assertEqual(d, {}) |
| 113 | |
| 114 | self.assertRaises(TypeError, d.clear, None) |
| 115 | |
| 116 | def test_update(self): |
| 117 | d = {} |
| 118 | d.update({1:100}) |
| 119 | d.update({2:20}) |
| 120 | d.update({1:1, 2:2, 3:3}) |
| 121 | self.assertEqual(d, {1:1, 2:2, 3:3}) |
| 122 | |
| 123 | d.update() |
| 124 | self.assertEqual(d, {1:1, 2:2, 3:3}) |
| 125 | |
| 126 | self.assertRaises((TypeError, AttributeError), d.update, None) |
| 127 | |
| 128 | class SimpleUserDict: |
| 129 | def __init__(self): |
| 130 | self.d = {1:1, 2:2, 3:3} |
| 131 | def keys(self): |
| 132 | return self.d.keys() |
| 133 | def __getitem__(self, i): |
| 134 | return self.d[i] |
| 135 | d.clear() |
| 136 | d.update(SimpleUserDict()) |
| 137 | self.assertEqual(d, {1:1, 2:2, 3:3}) |
| 138 | |
| 139 | class Exc(Exception): pass |
| 140 | |
| 141 | d.clear() |
| 142 | class FailingUserDict: |
| 143 | def keys(self): |
| 144 | raise Exc |
| 145 | self.assertRaises(Exc, d.update, FailingUserDict()) |
| 146 | |
| 147 | class FailingUserDict: |
| 148 | def keys(self): |
| 149 | class BogonIter: |
| 150 | def __init__(self): |
| 151 | self.i = 1 |
| 152 | def __iter__(self): |
| 153 | return self |
| 154 | def next(self): |
| 155 | if self.i: |
| 156 | self.i = 0 |
| 157 | return 'a' |
| 158 | raise Exc |
| 159 | return BogonIter() |
| 160 | def __getitem__(self, key): |
| 161 | return key |
| 162 | self.assertRaises(Exc, d.update, FailingUserDict()) |
| 163 | |
| 164 | class FailingUserDict: |
| 165 | def keys(self): |
| 166 | class BogonIter: |
| 167 | def __init__(self): |
| 168 | self.i = ord('a') |
| 169 | def __iter__(self): |
| 170 | return self |
| 171 | def next(self): |
| 172 | if self.i <= ord('z'): |
| 173 | rtn = chr(self.i) |
| 174 | self.i += 1 |
| 175 | return rtn |
| 176 | raise StopIteration |
| 177 | return BogonIter() |
| 178 | def __getitem__(self, key): |
| 179 | raise Exc |
| 180 | self.assertRaises(Exc, d.update, FailingUserDict()) |
| 181 | |
| 182 | class badseq(object): |
| 183 | def __iter__(self): |
| 184 | return self |
| 185 | def next(self): |
| 186 | raise Exc() |
| 187 | |
| 188 | self.assertRaises(Exc, {}.update, badseq()) |
| 189 | |
| 190 | self.assertRaises(ValueError, {}.update, [(1, 2, 3)]) |
| 191 | |
Raymond Hettinger | 0922d71 | 2007-02-07 20:08:22 +0000 | [diff] [blame] | 192 | # SF #1615701: make d.update(m) honor __getitem__() and keys() in dict subclasses |
| 193 | class KeyUpperDict(dict): |
| 194 | def __getitem__(self, key): |
| 195 | return key.upper() |
| 196 | d.clear() |
| 197 | d.update(KeyUpperDict.fromkeys('abc')) |
| 198 | self.assertEqual(d, {'a':'A', 'b':'B', 'c':'C'}) |
| 199 | |
Walter Dörwald | 59b23e8 | 2004-09-30 13:46:00 +0000 | [diff] [blame] | 200 | def test_fromkeys(self): |
| 201 | self.assertEqual(dict.fromkeys('abc'), {'a':None, 'b':None, 'c':None}) |
| 202 | d = {} |
| 203 | self.assert_(not(d.fromkeys('abc') is d)) |
| 204 | self.assertEqual(d.fromkeys('abc'), {'a':None, 'b':None, 'c':None}) |
| 205 | self.assertEqual(d.fromkeys((4,5),0), {4:0, 5:0}) |
| 206 | self.assertEqual(d.fromkeys([]), {}) |
| 207 | def g(): |
| 208 | yield 1 |
| 209 | self.assertEqual(d.fromkeys(g()), {1:None}) |
| 210 | self.assertRaises(TypeError, {}.fromkeys, 3) |
| 211 | class dictlike(dict): pass |
| 212 | self.assertEqual(dictlike.fromkeys('a'), {'a':None}) |
| 213 | self.assertEqual(dictlike().fromkeys('a'), {'a':None}) |
| 214 | self.assert_(type(dictlike.fromkeys('a')) is dictlike) |
| 215 | self.assert_(type(dictlike().fromkeys('a')) is dictlike) |
| 216 | class mydict(dict): |
| 217 | def __new__(cls): |
| 218 | return UserDict.UserDict() |
| 219 | ud = mydict.fromkeys('ab') |
| 220 | self.assertEqual(ud, {'a':None, 'b':None}) |
| 221 | self.assert_(isinstance(ud, UserDict.UserDict)) |
| 222 | self.assertRaises(TypeError, dict.fromkeys) |
| 223 | |
| 224 | class Exc(Exception): pass |
| 225 | |
| 226 | class baddict1(dict): |
| 227 | def __init__(self): |
| 228 | raise Exc() |
| 229 | |
| 230 | self.assertRaises(Exc, baddict1.fromkeys, [1]) |
| 231 | |
| 232 | class BadSeq(object): |
| 233 | def __iter__(self): |
| 234 | return self |
| 235 | def next(self): |
| 236 | raise Exc() |
| 237 | |
| 238 | self.assertRaises(Exc, dict.fromkeys, BadSeq()) |
| 239 | |
| 240 | class baddict2(dict): |
| 241 | def __setitem__(self, key, value): |
| 242 | raise Exc() |
| 243 | |
| 244 | self.assertRaises(Exc, baddict2.fromkeys, [1]) |
| 245 | |
| 246 | def test_copy(self): |
| 247 | d = {1:1, 2:2, 3:3} |
| 248 | self.assertEqual(d.copy(), {1:1, 2:2, 3:3}) |
| 249 | self.assertEqual({}.copy(), {}) |
| 250 | self.assertRaises(TypeError, d.copy, None) |
| 251 | |
| 252 | def test_get(self): |
| 253 | d = {} |
| 254 | self.assert_(d.get('c') is None) |
| 255 | self.assertEqual(d.get('c', 3), 3) |
| 256 | d = {'a' : 1, 'b' : 2} |
| 257 | self.assert_(d.get('c') is None) |
| 258 | self.assertEqual(d.get('c', 3), 3) |
| 259 | self.assertEqual(d.get('a'), 1) |
| 260 | self.assertEqual(d.get('a', 3), 1) |
| 261 | self.assertRaises(TypeError, d.get) |
| 262 | self.assertRaises(TypeError, d.get, None, None, None) |
| 263 | |
| 264 | def test_setdefault(self): |
| 265 | # dict.setdefault() |
| 266 | d = {} |
| 267 | self.assert_(d.setdefault('key0') is None) |
| 268 | d.setdefault('key0', []) |
| 269 | self.assert_(d.setdefault('key0') is None) |
| 270 | d.setdefault('key', []).append(3) |
| 271 | self.assertEqual(d['key'][0], 3) |
| 272 | d.setdefault('key', []).append(4) |
| 273 | self.assertEqual(len(d['key']), 2) |
| 274 | self.assertRaises(TypeError, d.setdefault) |
| 275 | |
| 276 | class Exc(Exception): pass |
| 277 | |
| 278 | class BadHash(object): |
| 279 | fail = False |
| 280 | def __hash__(self): |
| 281 | if self.fail: |
| 282 | raise Exc() |
| 283 | else: |
| 284 | return 42 |
| 285 | |
| 286 | x = BadHash() |
| 287 | d[x] = 42 |
| 288 | x.fail = True |
| 289 | self.assertRaises(Exc, d.setdefault, x, []) |
| 290 | |
| 291 | def test_popitem(self): |
| 292 | # dict.popitem() |
| 293 | for copymode in -1, +1: |
| 294 | # -1: b has same structure as a |
| 295 | # +1: b is a.copy() |
| 296 | for log2size in range(12): |
| 297 | size = 2**log2size |
| 298 | a = {} |
| 299 | b = {} |
| 300 | for i in range(size): |
| 301 | a[repr(i)] = i |
| 302 | if copymode < 0: |
| 303 | b[repr(i)] = i |
| 304 | if copymode > 0: |
| 305 | b = a.copy() |
| 306 | for i in range(size): |
| 307 | ka, va = ta = a.popitem() |
| 308 | self.assertEqual(va, int(ka)) |
| 309 | kb, vb = tb = b.popitem() |
| 310 | self.assertEqual(vb, int(kb)) |
| 311 | self.assert_(not(copymode < 0 and ta != tb)) |
| 312 | self.assert_(not a) |
| 313 | self.assert_(not b) |
| 314 | |
| 315 | d = {} |
| 316 | self.assertRaises(KeyError, d.popitem) |
| 317 | |
| 318 | def test_pop(self): |
| 319 | # Tests for pop with specified key |
| 320 | d = {} |
| 321 | k, v = 'abc', 'def' |
| 322 | d[k] = v |
| 323 | self.assertRaises(KeyError, d.pop, 'ghi') |
| 324 | |
| 325 | self.assertEqual(d.pop(k), v) |
| 326 | self.assertEqual(len(d), 0) |
| 327 | |
| 328 | self.assertRaises(KeyError, d.pop, k) |
| 329 | |
| 330 | # verify longs/ints get same value when key > 32 bits (for 64-bit archs) |
| 331 | # see SF bug #689659 |
| 332 | x = 4503599627370496L |
| 333 | y = 4503599627370496 |
| 334 | h = {x: 'anything', y: 'something else'} |
| 335 | self.assertEqual(h[x], h[y]) |
| 336 | |
| 337 | self.assertEqual(d.pop(k, v), v) |
| 338 | d[k] = v |
| 339 | self.assertEqual(d.pop(k, 1), v) |
| 340 | |
| 341 | self.assertRaises(TypeError, d.pop) |
| 342 | |
| 343 | class Exc(Exception): pass |
| 344 | |
| 345 | class BadHash(object): |
| 346 | fail = False |
| 347 | def __hash__(self): |
| 348 | if self.fail: |
| 349 | raise Exc() |
| 350 | else: |
| 351 | return 42 |
| 352 | |
| 353 | x = BadHash() |
| 354 | d[x] = 42 |
| 355 | x.fail = True |
| 356 | self.assertRaises(Exc, d.pop, x) |
| 357 | |
| 358 | def test_mutatingiteration(self): |
| 359 | d = {} |
| 360 | d[1] = 1 |
| 361 | try: |
| 362 | for i in d: |
| 363 | d[i+1] = 1 |
| 364 | except RuntimeError: |
| 365 | pass |
| 366 | else: |
| 367 | self.fail("changing dict size during iteration doesn't raise Error") |
| 368 | |
| 369 | def test_repr(self): |
| 370 | d = {} |
| 371 | self.assertEqual(repr(d), '{}') |
| 372 | d[1] = 2 |
| 373 | self.assertEqual(repr(d), '{1: 2}') |
| 374 | d = {} |
| 375 | d[1] = d |
| 376 | self.assertEqual(repr(d), '{1: {...}}') |
| 377 | |
| 378 | class Exc(Exception): pass |
| 379 | |
| 380 | class BadRepr(object): |
| 381 | def __repr__(self): |
| 382 | raise Exc() |
| 383 | |
| 384 | d = {1: BadRepr()} |
| 385 | self.assertRaises(Exc, repr, d) |
| 386 | |
| 387 | def test_le(self): |
| 388 | self.assert_(not ({} < {})) |
| 389 | self.assert_(not ({1: 2} < {1L: 2L})) |
| 390 | |
| 391 | class Exc(Exception): pass |
| 392 | |
| 393 | class BadCmp(object): |
| 394 | def __eq__(self, other): |
| 395 | raise Exc() |
| 396 | |
| 397 | d1 = {BadCmp(): 1} |
| 398 | d2 = {1: 1} |
| 399 | try: |
| 400 | d1 < d2 |
| 401 | except Exc: |
| 402 | pass |
| 403 | else: |
| 404 | self.fail("< didn't raise Exc") |
| 405 | |
Guido van Rossum | 1968ad3 | 2006-02-25 22:38:04 +0000 | [diff] [blame] | 406 | def test_missing(self): |
| 407 | # Make sure dict doesn't have a __missing__ method |
| 408 | self.assertEqual(hasattr(dict, "__missing__"), False) |
| 409 | self.assertEqual(hasattr({}, "__missing__"), False) |
| 410 | # Test several cases: |
| 411 | # (D) subclass defines __missing__ method returning a value |
| 412 | # (E) subclass defines __missing__ method raising RuntimeError |
| 413 | # (F) subclass sets __missing__ instance variable (no effect) |
| 414 | # (G) subclass doesn't define __missing__ at a all |
| 415 | class D(dict): |
| 416 | def __missing__(self, key): |
| 417 | return 42 |
| 418 | d = D({1: 2, 3: 4}) |
| 419 | self.assertEqual(d[1], 2) |
| 420 | self.assertEqual(d[3], 4) |
| 421 | self.assert_(2 not in d) |
| 422 | self.assert_(2 not in d.keys()) |
| 423 | self.assertEqual(d[2], 42) |
| 424 | class E(dict): |
| 425 | def __missing__(self, key): |
| 426 | raise RuntimeError(key) |
| 427 | e = E() |
| 428 | try: |
| 429 | e[42] |
| 430 | except RuntimeError, err: |
| 431 | self.assertEqual(err.args, (42,)) |
| 432 | else: |
Georg Brandl | 8905bb1 | 2007-03-04 17:18:54 +0000 | [diff] [blame] | 433 | self.fail("e[42] didn't raise RuntimeError") |
Guido van Rossum | 1968ad3 | 2006-02-25 22:38:04 +0000 | [diff] [blame] | 434 | class F(dict): |
| 435 | def __init__(self): |
| 436 | # An instance variable __missing__ should have no effect |
| 437 | self.__missing__ = lambda key: None |
| 438 | f = F() |
| 439 | try: |
| 440 | f[42] |
| 441 | except KeyError, err: |
| 442 | self.assertEqual(err.args, (42,)) |
| 443 | else: |
Georg Brandl | 8905bb1 | 2007-03-04 17:18:54 +0000 | [diff] [blame] | 444 | self.fail("f[42] didn't raise KeyError") |
Guido van Rossum | 1968ad3 | 2006-02-25 22:38:04 +0000 | [diff] [blame] | 445 | class G(dict): |
| 446 | pass |
| 447 | g = G() |
| 448 | try: |
| 449 | g[42] |
| 450 | except KeyError, err: |
| 451 | self.assertEqual(err.args, (42,)) |
| 452 | else: |
Georg Brandl | 8905bb1 | 2007-03-04 17:18:54 +0000 | [diff] [blame] | 453 | self.fail("g[42] didn't raise KeyError") |
Guido van Rossum | 1968ad3 | 2006-02-25 22:38:04 +0000 | [diff] [blame] | 454 | |
Georg Brandl | b9f4ad3 | 2006-10-29 18:31:42 +0000 | [diff] [blame] | 455 | def test_tuple_keyerror(self): |
| 456 | # SF #1576657 |
| 457 | d = {} |
| 458 | try: |
| 459 | d[(1,)] |
| 460 | except KeyError, e: |
| 461 | self.assertEqual(e.args, ((1,),)) |
| 462 | else: |
| 463 | self.fail("missing KeyError") |
Collin Winter | f567ca3 | 2007-03-12 15:57:19 +0000 | [diff] [blame] | 464 | |
| 465 | def test_bad_key(self): |
| 466 | # Dictionary lookups should fail if __cmp__() raises an exception. |
| 467 | class CustomException(Exception): |
| 468 | pass |
| 469 | |
| 470 | class BadDictKey: |
| 471 | def __hash__(self): |
| 472 | return hash(self.__class__) |
| 473 | |
| 474 | def __cmp__(self, other): |
| 475 | if isinstance(other, self.__class__): |
| 476 | raise CustomException |
| 477 | return other |
| 478 | |
| 479 | d = {} |
| 480 | x1 = BadDictKey() |
| 481 | x2 = BadDictKey() |
| 482 | d[x1] = 1 |
| 483 | for stmt in ['d[x2] = 2', |
| 484 | 'z = d[x2]', |
| 485 | 'x2 in d', |
| 486 | 'd.has_key(x2)', |
| 487 | 'd.get(x2)', |
| 488 | 'd.setdefault(x2, 42)', |
| 489 | 'd.pop(x2)', |
| 490 | 'd.update({x2: 2})']: |
| 491 | try: |
| 492 | exec stmt in locals() |
| 493 | except CustomException: |
| 494 | pass |
| 495 | else: |
| 496 | self.fail("Statement didn't raise exception") |
| 497 | |
| 498 | def test_resize1(self): |
| 499 | # Dict resizing bug, found by Jack Jansen in 2.2 CVS development. |
| 500 | # This version got an assert failure in debug build, infinite loop in |
| 501 | # release build. Unfortunately, provoking this kind of stuff requires |
| 502 | # a mix of inserts and deletes hitting exactly the right hash codes in |
| 503 | # exactly the right order, and I can't think of a randomized approach |
| 504 | # that would be *likely* to hit a failing case in reasonable time. |
| 505 | |
| 506 | d = {} |
| 507 | for i in range(5): |
| 508 | d[i] = i |
| 509 | for i in range(5): |
| 510 | del d[i] |
| 511 | for i in range(5, 9): # i==8 was the problem |
| 512 | d[i] = i |
| 513 | |
| 514 | def test_resize2(self): |
| 515 | # Another dict resizing bug (SF bug #1456209). |
| 516 | # This caused Segmentation faults or Illegal instructions. |
| 517 | |
| 518 | class X(object): |
| 519 | def __hash__(self): |
| 520 | return 5 |
| 521 | def __eq__(self, other): |
| 522 | if resizing: |
| 523 | d.clear() |
| 524 | return False |
| 525 | d = {} |
| 526 | resizing = False |
| 527 | d[X()] = 1 |
| 528 | d[X()] = 2 |
| 529 | d[X()] = 3 |
| 530 | d[X()] = 4 |
| 531 | d[X()] = 5 |
| 532 | # now trigger a resize |
| 533 | resizing = True |
| 534 | d[9] = 6 |
Georg Brandl | b9f4ad3 | 2006-10-29 18:31:42 +0000 | [diff] [blame] | 535 | |
Guido van Rossum | 1968ad3 | 2006-02-25 22:38:04 +0000 | [diff] [blame] | 536 | |
Neal Norwitz | b902f4e | 2006-04-03 04:45:34 +0000 | [diff] [blame] | 537 | from test import mapping_tests |
Raymond Hettinger | 49c522b | 2004-09-30 15:07:29 +0000 | [diff] [blame] | 538 | |
| 539 | class GeneralMappingTests(mapping_tests.BasicTestMappingProtocol): |
| 540 | type2test = dict |
| 541 | |
| 542 | class Dict(dict): |
| 543 | pass |
| 544 | |
| 545 | class SubclassMappingTests(mapping_tests.BasicTestMappingProtocol): |
| 546 | type2test = Dict |
| 547 | |
Walter Dörwald | 59b23e8 | 2004-09-30 13:46:00 +0000 | [diff] [blame] | 548 | def test_main(): |
| 549 | test_support.run_unittest( |
| 550 | DictTest, |
Raymond Hettinger | 49c522b | 2004-09-30 15:07:29 +0000 | [diff] [blame] | 551 | GeneralMappingTests, |
| 552 | SubclassMappingTests, |
Walter Dörwald | 59b23e8 | 2004-09-30 13:46:00 +0000 | [diff] [blame] | 553 | ) |
| 554 | |
| 555 | if __name__ == "__main__": |
| 556 | test_main() |