mirror of
https://github.com/python/cpython.git
synced 2025-11-02 22:51:25 +00:00
1016 lines
35 KiB
Python
1016 lines
35 KiB
Python
import builtins
|
|
import contextlib
|
|
import copy
|
|
import gc
|
|
import pickle
|
|
from random import randrange, shuffle
|
|
import struct
|
|
import sys
|
|
import unittest
|
|
import weakref
|
|
from collections.abc import MutableMapping
|
|
from test import mapping_tests, support
|
|
from test.support import import_helper
|
|
|
|
|
|
py_coll = import_helper.import_fresh_module('collections',
|
|
blocked=['_collections'])
|
|
c_coll = import_helper.import_fresh_module('collections',
|
|
fresh=['_collections'])
|
|
|
|
|
|
@contextlib.contextmanager
|
|
def replaced_module(name, replacement):
|
|
original_module = sys.modules[name]
|
|
sys.modules[name] = replacement
|
|
try:
|
|
yield
|
|
finally:
|
|
sys.modules[name] = original_module
|
|
|
|
|
|
class OrderedDictTests:
|
|
|
|
def test_init(self):
|
|
OrderedDict = self.OrderedDict
|
|
with self.assertRaises(TypeError):
|
|
OrderedDict([('a', 1), ('b', 2)], None) # too many args
|
|
pairs = [('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5)]
|
|
self.assertEqual(sorted(OrderedDict(dict(pairs)).items()), pairs) # dict input
|
|
self.assertEqual(sorted(OrderedDict(**dict(pairs)).items()), pairs) # kwds input
|
|
self.assertEqual(list(OrderedDict(pairs).items()), pairs) # pairs input
|
|
self.assertEqual(list(OrderedDict([('a', 1), ('b', 2), ('c', 9), ('d', 4)],
|
|
c=3, e=5).items()), pairs) # mixed input
|
|
|
|
# make sure no positional args conflict with possible kwdargs
|
|
self.assertEqual(list(OrderedDict(self=42).items()), [('self', 42)])
|
|
self.assertEqual(list(OrderedDict(other=42).items()), [('other', 42)])
|
|
self.assertRaises(TypeError, OrderedDict, 42)
|
|
self.assertRaises(TypeError, OrderedDict, (), ())
|
|
self.assertRaises(TypeError, OrderedDict.__init__)
|
|
|
|
# Make sure that direct calls to __init__ do not clear previous contents
|
|
d = OrderedDict([('a', 1), ('b', 2), ('c', 3), ('d', 44), ('e', 55)])
|
|
d.__init__([('e', 5), ('f', 6)], g=7, d=4)
|
|
self.assertEqual(list(d.items()),
|
|
[('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5), ('f', 6), ('g', 7)])
|
|
|
|
def test_468(self):
|
|
OrderedDict = self.OrderedDict
|
|
items = [('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5), ('f', 6), ('g', 7)]
|
|
shuffle(items)
|
|
argdict = OrderedDict(items)
|
|
d = OrderedDict(**argdict)
|
|
self.assertEqual(list(d.items()), items)
|
|
|
|
def test_update(self):
|
|
OrderedDict = self.OrderedDict
|
|
with self.assertRaises(TypeError):
|
|
OrderedDict().update([('a', 1), ('b', 2)], None) # too many args
|
|
pairs = [('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5)]
|
|
od = OrderedDict()
|
|
od.update(dict(pairs))
|
|
self.assertEqual(sorted(od.items()), pairs) # dict input
|
|
od = OrderedDict()
|
|
od.update(**dict(pairs))
|
|
self.assertEqual(sorted(od.items()), pairs) # kwds input
|
|
od = OrderedDict()
|
|
od.update(pairs)
|
|
self.assertEqual(list(od.items()), pairs) # pairs input
|
|
od = OrderedDict()
|
|
od.update([('a', 1), ('b', 2), ('c', 9), ('d', 4)], c=3, e=5)
|
|
self.assertEqual(list(od.items()), pairs) # mixed input
|
|
|
|
# Issue 9137: Named argument called 'other' or 'self'
|
|
# shouldn't be treated specially.
|
|
od = OrderedDict()
|
|
od.update(self=23)
|
|
self.assertEqual(list(od.items()), [('self', 23)])
|
|
od = OrderedDict()
|
|
od.update(other={})
|
|
self.assertEqual(list(od.items()), [('other', {})])
|
|
od = OrderedDict()
|
|
od.update(red=5, blue=6, other=7, self=8)
|
|
self.assertEqual(sorted(list(od.items())),
|
|
[('blue', 6), ('other', 7), ('red', 5), ('self', 8)])
|
|
|
|
# Make sure that direct calls to update do not clear previous contents
|
|
# add that updates items are not moved to the end
|
|
d = OrderedDict([('a', 1), ('b', 2), ('c', 3), ('d', 44), ('e', 55)])
|
|
d.update([('e', 5), ('f', 6)], g=7, d=4)
|
|
self.assertEqual(list(d.items()),
|
|
[('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5), ('f', 6), ('g', 7)])
|
|
|
|
self.assertRaises(TypeError, OrderedDict().update, 42)
|
|
self.assertRaises(TypeError, OrderedDict().update, (), ())
|
|
self.assertRaises(TypeError, OrderedDict.update)
|
|
|
|
self.assertRaises(TypeError, OrderedDict().update, 42)
|
|
self.assertRaises(TypeError, OrderedDict().update, (), ())
|
|
self.assertRaises(TypeError, OrderedDict.update)
|
|
|
|
def test_init_calls(self):
|
|
calls = []
|
|
class Spam:
|
|
def keys(self):
|
|
calls.append('keys')
|
|
return ()
|
|
def items(self):
|
|
calls.append('items')
|
|
return ()
|
|
|
|
self.OrderedDict(Spam())
|
|
self.assertEqual(calls, ['keys'])
|
|
|
|
def test_fromkeys(self):
|
|
OrderedDict = self.OrderedDict
|
|
od = OrderedDict.fromkeys('abc')
|
|
self.assertEqual(list(od.items()), [(c, None) for c in 'abc'])
|
|
od = OrderedDict.fromkeys('abc', value=None)
|
|
self.assertEqual(list(od.items()), [(c, None) for c in 'abc'])
|
|
od = OrderedDict.fromkeys('abc', value=0)
|
|
self.assertEqual(list(od.items()), [(c, 0) for c in 'abc'])
|
|
|
|
def test_abc(self):
|
|
OrderedDict = self.OrderedDict
|
|
self.assertIsInstance(OrderedDict(), MutableMapping)
|
|
self.assertTrue(issubclass(OrderedDict, MutableMapping))
|
|
|
|
def test_clear(self):
|
|
OrderedDict = self.OrderedDict
|
|
pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)]
|
|
shuffle(pairs)
|
|
od = OrderedDict(pairs)
|
|
self.assertEqual(len(od), len(pairs))
|
|
od.clear()
|
|
self.assertEqual(len(od), 0)
|
|
|
|
def test_delitem(self):
|
|
OrderedDict = self.OrderedDict
|
|
pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)]
|
|
od = OrderedDict(pairs)
|
|
del od['a']
|
|
self.assertNotIn('a', od)
|
|
with self.assertRaises(KeyError):
|
|
del od['a']
|
|
self.assertEqual(list(od.items()), pairs[:2] + pairs[3:])
|
|
|
|
def test_setitem(self):
|
|
OrderedDict = self.OrderedDict
|
|
od = OrderedDict([('d', 1), ('b', 2), ('c', 3), ('a', 4), ('e', 5)])
|
|
od['c'] = 10 # existing element
|
|
od['f'] = 20 # new element
|
|
self.assertEqual(list(od.items()),
|
|
[('d', 1), ('b', 2), ('c', 10), ('a', 4), ('e', 5), ('f', 20)])
|
|
|
|
def test_iterators(self):
|
|
OrderedDict = self.OrderedDict
|
|
pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)]
|
|
shuffle(pairs)
|
|
od = OrderedDict(pairs)
|
|
self.assertEqual(list(od), [t[0] for t in pairs])
|
|
self.assertEqual(list(od.keys()), [t[0] for t in pairs])
|
|
self.assertEqual(list(od.values()), [t[1] for t in pairs])
|
|
self.assertEqual(list(od.items()), pairs)
|
|
self.assertEqual(list(reversed(od)),
|
|
[t[0] for t in reversed(pairs)])
|
|
self.assertEqual(list(reversed(od.keys())),
|
|
[t[0] for t in reversed(pairs)])
|
|
self.assertEqual(list(reversed(od.values())),
|
|
[t[1] for t in reversed(pairs)])
|
|
self.assertEqual(list(reversed(od.items())), list(reversed(pairs)))
|
|
|
|
def test_detect_deletion_during_iteration(self):
|
|
OrderedDict = self.OrderedDict
|
|
od = OrderedDict.fromkeys('abc')
|
|
it = iter(od)
|
|
key = next(it)
|
|
del od[key]
|
|
with self.assertRaises(Exception):
|
|
# Note, the exact exception raised is not guaranteed
|
|
# The only guarantee that the next() will not succeed
|
|
next(it)
|
|
|
|
def test_sorted_iterators(self):
|
|
OrderedDict = self.OrderedDict
|
|
with self.assertRaises(TypeError):
|
|
OrderedDict([('a', 1), ('b', 2)], None)
|
|
pairs = [('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5)]
|
|
od = OrderedDict(pairs)
|
|
self.assertEqual(sorted(od), [t[0] for t in pairs])
|
|
self.assertEqual(sorted(od.keys()), [t[0] for t in pairs])
|
|
self.assertEqual(sorted(od.values()), [t[1] for t in pairs])
|
|
self.assertEqual(sorted(od.items()), pairs)
|
|
self.assertEqual(sorted(reversed(od)),
|
|
sorted([t[0] for t in reversed(pairs)]))
|
|
|
|
def test_iterators_empty(self):
|
|
OrderedDict = self.OrderedDict
|
|
od = OrderedDict()
|
|
empty = []
|
|
self.assertEqual(list(od), empty)
|
|
self.assertEqual(list(od.keys()), empty)
|
|
self.assertEqual(list(od.values()), empty)
|
|
self.assertEqual(list(od.items()), empty)
|
|
self.assertEqual(list(reversed(od)), empty)
|
|
self.assertEqual(list(reversed(od.keys())), empty)
|
|
self.assertEqual(list(reversed(od.values())), empty)
|
|
self.assertEqual(list(reversed(od.items())), empty)
|
|
|
|
def test_popitem(self):
|
|
OrderedDict = self.OrderedDict
|
|
pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)]
|
|
shuffle(pairs)
|
|
od = OrderedDict(pairs)
|
|
while pairs:
|
|
self.assertEqual(od.popitem(), pairs.pop())
|
|
with self.assertRaises(KeyError):
|
|
od.popitem()
|
|
self.assertEqual(len(od), 0)
|
|
|
|
def test_popitem_last(self):
|
|
OrderedDict = self.OrderedDict
|
|
pairs = [(i, i) for i in range(30)]
|
|
|
|
obj = OrderedDict(pairs)
|
|
for i in range(8):
|
|
obj.popitem(True)
|
|
obj.popitem(True)
|
|
obj.popitem(last=True)
|
|
self.assertEqual(len(obj), 20)
|
|
|
|
def test_pop(self):
|
|
OrderedDict = self.OrderedDict
|
|
pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)]
|
|
shuffle(pairs)
|
|
od = OrderedDict(pairs)
|
|
shuffle(pairs)
|
|
while pairs:
|
|
k, v = pairs.pop()
|
|
self.assertEqual(od.pop(k), v)
|
|
with self.assertRaises(KeyError):
|
|
od.pop('xyz')
|
|
self.assertEqual(len(od), 0)
|
|
self.assertEqual(od.pop(k, 12345), 12345)
|
|
|
|
# make sure pop still works when __missing__ is defined
|
|
class Missing(OrderedDict):
|
|
def __missing__(self, key):
|
|
return 0
|
|
m = Missing(a=1)
|
|
self.assertEqual(m.pop('b', 5), 5)
|
|
self.assertEqual(m.pop('a', 6), 1)
|
|
self.assertEqual(m.pop('a', 6), 6)
|
|
self.assertEqual(m.pop('a', default=6), 6)
|
|
with self.assertRaises(KeyError):
|
|
m.pop('a')
|
|
|
|
def test_equality(self):
|
|
OrderedDict = self.OrderedDict
|
|
pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)]
|
|
shuffle(pairs)
|
|
od1 = OrderedDict(pairs)
|
|
od2 = OrderedDict(pairs)
|
|
self.assertEqual(od1, od2) # same order implies equality
|
|
pairs = pairs[2:] + pairs[:2]
|
|
od2 = OrderedDict(pairs)
|
|
self.assertNotEqual(od1, od2) # different order implies inequality
|
|
# comparison to regular dict is not order sensitive
|
|
self.assertEqual(od1, dict(od2))
|
|
self.assertEqual(dict(od2), od1)
|
|
# different length implied inequality
|
|
self.assertNotEqual(od1, OrderedDict(pairs[:-1]))
|
|
|
|
def test_copying(self):
|
|
OrderedDict = self.OrderedDict
|
|
# Check that ordered dicts are copyable, deepcopyable, picklable,
|
|
# and have a repr/eval round-trip
|
|
pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)]
|
|
od = OrderedDict(pairs)
|
|
od.x = ['x']
|
|
od.z = ['z']
|
|
def check(dup):
|
|
msg = "\ncopy: %s\nod: %s" % (dup, od)
|
|
self.assertIsNot(dup, od, msg)
|
|
self.assertEqual(dup, od)
|
|
self.assertEqual(list(dup.items()), list(od.items()))
|
|
self.assertEqual(len(dup), len(od))
|
|
self.assertEqual(type(dup), type(od))
|
|
check(od.copy())
|
|
dup = copy.copy(od)
|
|
check(dup)
|
|
self.assertIs(dup.x, od.x)
|
|
self.assertIs(dup.z, od.z)
|
|
self.assertFalse(hasattr(dup, 'y'))
|
|
dup = copy.deepcopy(od)
|
|
check(dup)
|
|
self.assertEqual(dup.x, od.x)
|
|
self.assertIsNot(dup.x, od.x)
|
|
self.assertEqual(dup.z, od.z)
|
|
self.assertIsNot(dup.z, od.z)
|
|
self.assertFalse(hasattr(dup, 'y'))
|
|
# pickle directly pulls the module, so we have to fake it
|
|
with replaced_module('collections', self.module):
|
|
for proto in range(pickle.HIGHEST_PROTOCOL + 1):
|
|
with self.subTest(proto=proto):
|
|
dup = pickle.loads(pickle.dumps(od, proto))
|
|
check(dup)
|
|
self.assertEqual(dup.x, od.x)
|
|
self.assertEqual(dup.z, od.z)
|
|
self.assertFalse(hasattr(dup, 'y'))
|
|
check(eval(repr(od)))
|
|
update_test = OrderedDict()
|
|
update_test.update(od)
|
|
check(update_test)
|
|
check(OrderedDict(od))
|
|
|
|
def test_yaml_linkage(self):
|
|
OrderedDict = self.OrderedDict
|
|
# Verify that __reduce__ is setup in a way that supports PyYAML's dump() feature.
|
|
# In yaml, lists are native but tuples are not.
|
|
pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)]
|
|
od = OrderedDict(pairs)
|
|
# yaml.dump(od) -->
|
|
# '!!python/object/apply:__main__.OrderedDict\n- - [a, 1]\n - [b, 2]\n'
|
|
self.assertTrue(all(type(pair)==list for pair in od.__reduce__()[1]))
|
|
|
|
def test_reduce_not_too_fat(self):
|
|
OrderedDict = self.OrderedDict
|
|
# do not save instance dictionary if not needed
|
|
pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)]
|
|
od = OrderedDict(pairs)
|
|
self.assertIsInstance(od.__dict__, dict)
|
|
self.assertIsNone(od.__reduce__()[2])
|
|
od.x = 10
|
|
self.assertEqual(od.__dict__['x'], 10)
|
|
self.assertEqual(od.__reduce__()[2], {'x': 10})
|
|
|
|
def test_pickle_recursive(self):
|
|
OrderedDict = self.OrderedDict
|
|
od = OrderedDict()
|
|
od[1] = od
|
|
|
|
# pickle directly pulls the module, so we have to fake it
|
|
with replaced_module('collections', self.module):
|
|
for proto in range(-1, pickle.HIGHEST_PROTOCOL + 1):
|
|
dup = pickle.loads(pickle.dumps(od, proto))
|
|
self.assertIsNot(dup, od)
|
|
self.assertEqual(list(dup.keys()), [1])
|
|
self.assertIs(dup[1], dup)
|
|
|
|
def test_repr(self):
|
|
OrderedDict = self.OrderedDict
|
|
od = OrderedDict([('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)])
|
|
self.assertEqual(repr(od),
|
|
"OrderedDict({'c': 1, 'b': 2, 'a': 3, 'd': 4, 'e': 5, 'f': 6})")
|
|
self.assertEqual(eval(repr(od)), od)
|
|
self.assertEqual(repr(OrderedDict()), "OrderedDict()")
|
|
|
|
def test_repr_recursive(self):
|
|
OrderedDict = self.OrderedDict
|
|
# See issue #9826
|
|
od = OrderedDict.fromkeys('abc')
|
|
od['x'] = od
|
|
self.assertEqual(repr(od),
|
|
"OrderedDict({'a': None, 'b': None, 'c': None, 'x': ...})")
|
|
|
|
def test_repr_recursive_values(self):
|
|
OrderedDict = self.OrderedDict
|
|
od = OrderedDict()
|
|
od[42] = od.values()
|
|
r = repr(od)
|
|
# Cannot perform a stronger test, as the contents of the repr
|
|
# are implementation-dependent. All we can say is that we
|
|
# want a str result, not an exception of any sort.
|
|
self.assertIsInstance(r, str)
|
|
od[42] = od.items()
|
|
r = repr(od)
|
|
# Again.
|
|
self.assertIsInstance(r, str)
|
|
|
|
def test_setdefault(self):
|
|
OrderedDict = self.OrderedDict
|
|
pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)]
|
|
shuffle(pairs)
|
|
od = OrderedDict(pairs)
|
|
pair_order = list(od.items())
|
|
self.assertEqual(od.setdefault('a', 10), 3)
|
|
# make sure order didn't change
|
|
self.assertEqual(list(od.items()), pair_order)
|
|
self.assertEqual(od.setdefault('x', 10), 10)
|
|
# make sure 'x' is added to the end
|
|
self.assertEqual(list(od.items())[-1], ('x', 10))
|
|
self.assertEqual(od.setdefault('g', default=9), 9)
|
|
|
|
# make sure setdefault still works when __missing__ is defined
|
|
class Missing(OrderedDict):
|
|
def __missing__(self, key):
|
|
return 0
|
|
self.assertEqual(Missing().setdefault(5, 9), 9)
|
|
|
|
def test_reinsert(self):
|
|
OrderedDict = self.OrderedDict
|
|
# Given insert a, insert b, delete a, re-insert a,
|
|
# verify that a is now later than b.
|
|
od = OrderedDict()
|
|
od['a'] = 1
|
|
od['b'] = 2
|
|
del od['a']
|
|
self.assertEqual(list(od.items()), [('b', 2)])
|
|
od['a'] = 1
|
|
self.assertEqual(list(od.items()), [('b', 2), ('a', 1)])
|
|
|
|
def test_move_to_end(self):
|
|
OrderedDict = self.OrderedDict
|
|
od = OrderedDict.fromkeys('abcde')
|
|
self.assertEqual(list(od), list('abcde'))
|
|
od.move_to_end('c')
|
|
self.assertEqual(list(od), list('abdec'))
|
|
od.move_to_end('c', False)
|
|
self.assertEqual(list(od), list('cabde'))
|
|
od.move_to_end('c', False)
|
|
self.assertEqual(list(od), list('cabde'))
|
|
od.move_to_end('e')
|
|
self.assertEqual(list(od), list('cabde'))
|
|
od.move_to_end('b', last=False)
|
|
self.assertEqual(list(od), list('bcade'))
|
|
with self.assertRaises(KeyError):
|
|
od.move_to_end('x')
|
|
with self.assertRaises(KeyError):
|
|
od.move_to_end('x', False)
|
|
|
|
def test_move_to_end_issue25406(self):
|
|
OrderedDict = self.OrderedDict
|
|
od = OrderedDict.fromkeys('abc')
|
|
od.move_to_end('c', last=False)
|
|
self.assertEqual(list(od), list('cab'))
|
|
od.move_to_end('a', last=False)
|
|
self.assertEqual(list(od), list('acb'))
|
|
|
|
od = OrderedDict.fromkeys('abc')
|
|
od.move_to_end('a')
|
|
self.assertEqual(list(od), list('bca'))
|
|
od.move_to_end('c')
|
|
self.assertEqual(list(od), list('bac'))
|
|
|
|
def test_sizeof(self):
|
|
OrderedDict = self.OrderedDict
|
|
# Wimpy test: Just verify the reported size is larger than a regular dict
|
|
d = dict(a=1)
|
|
od = OrderedDict(**d)
|
|
self.assertGreater(sys.getsizeof(od), sys.getsizeof(d))
|
|
|
|
def test_views(self):
|
|
OrderedDict = self.OrderedDict
|
|
# See http://bugs.python.org/issue24286
|
|
s = 'the quick brown fox jumped over a lazy dog yesterday before dawn'.split()
|
|
od = OrderedDict.fromkeys(s)
|
|
self.assertEqual(od.keys(), dict(od).keys())
|
|
self.assertEqual(od.items(), dict(od).items())
|
|
|
|
def test_override_update(self):
|
|
OrderedDict = self.OrderedDict
|
|
# Verify that subclasses can override update() without breaking __init__()
|
|
class MyOD(OrderedDict):
|
|
def update(self, *args, **kwds):
|
|
raise Exception()
|
|
items = [('a', 1), ('c', 3), ('b', 2)]
|
|
self.assertEqual(list(MyOD(items).items()), items)
|
|
|
|
def test_highly_nested(self):
|
|
# Issues 25395 and 35983: test that the trashcan mechanism works
|
|
# correctly for OrderedDict: deleting a highly nested OrderDict
|
|
# should not crash Python.
|
|
OrderedDict = self.OrderedDict
|
|
obj = None
|
|
for _ in range(1000):
|
|
obj = OrderedDict([(None, obj)])
|
|
del obj
|
|
support.gc_collect()
|
|
|
|
def test_highly_nested_subclass(self):
|
|
# Issues 25395 and 35983: test that the trashcan mechanism works
|
|
# correctly for OrderedDict: deleting a highly nested OrderDict
|
|
# should not crash Python.
|
|
OrderedDict = self.OrderedDict
|
|
deleted = []
|
|
class MyOD(OrderedDict):
|
|
def __del__(self):
|
|
deleted.append(self.i)
|
|
obj = None
|
|
for i in range(100):
|
|
obj = MyOD([(None, obj)])
|
|
obj.i = i
|
|
del obj
|
|
support.gc_collect()
|
|
self.assertEqual(deleted, list(reversed(range(100))))
|
|
|
|
def test_delitem_hash_collision(self):
|
|
OrderedDict = self.OrderedDict
|
|
|
|
class Key:
|
|
def __init__(self, hash):
|
|
self._hash = hash
|
|
self.value = str(id(self))
|
|
def __hash__(self):
|
|
return self._hash
|
|
def __eq__(self, other):
|
|
try:
|
|
return self.value == other.value
|
|
except AttributeError:
|
|
return False
|
|
def __repr__(self):
|
|
return self.value
|
|
|
|
def blocking_hash(hash):
|
|
# See the collision-handling in lookdict (in Objects/dictobject.c).
|
|
MINSIZE = 8
|
|
i = (hash & MINSIZE-1)
|
|
return (i << 2) + i + hash + 1
|
|
|
|
COLLIDING = 1
|
|
|
|
key = Key(COLLIDING)
|
|
colliding = Key(COLLIDING)
|
|
blocking = Key(blocking_hash(COLLIDING))
|
|
|
|
od = OrderedDict()
|
|
od[key] = ...
|
|
od[blocking] = ...
|
|
od[colliding] = ...
|
|
od['after'] = ...
|
|
|
|
del od[blocking]
|
|
del od[colliding]
|
|
self.assertEqual(list(od.items()), [(key, ...), ('after', ...)])
|
|
|
|
def test_issue24347(self):
|
|
OrderedDict = self.OrderedDict
|
|
|
|
class Key:
|
|
def __hash__(self):
|
|
return randrange(100000)
|
|
|
|
od = OrderedDict()
|
|
for i in range(100):
|
|
key = Key()
|
|
od[key] = i
|
|
|
|
# These should not crash.
|
|
with self.assertRaises(KeyError):
|
|
list(od.values())
|
|
with self.assertRaises(KeyError):
|
|
list(od.items())
|
|
with self.assertRaises(KeyError):
|
|
repr(od)
|
|
with self.assertRaises(KeyError):
|
|
od.copy()
|
|
|
|
def test_issue24348(self):
|
|
OrderedDict = self.OrderedDict
|
|
|
|
class Key:
|
|
def __hash__(self):
|
|
return 1
|
|
|
|
od = OrderedDict()
|
|
od[Key()] = 0
|
|
# This should not crash.
|
|
od.popitem()
|
|
|
|
def test_issue24667(self):
|
|
"""
|
|
dict resizes after a certain number of insertion operations,
|
|
whether or not there were deletions that freed up slots in the
|
|
hash table. During fast node lookup, OrderedDict must correctly
|
|
respond to all resizes, even if the current "size" is the same
|
|
as the old one. We verify that here by forcing a dict resize
|
|
on a sparse odict and then perform an operation that should
|
|
trigger an odict resize (e.g. popitem). One key aspect here is
|
|
that we will keep the size of the odict the same at each popitem
|
|
call. This verifies that we handled the dict resize properly.
|
|
"""
|
|
OrderedDict = self.OrderedDict
|
|
|
|
od = OrderedDict()
|
|
for c0 in '0123456789ABCDEF':
|
|
for c1 in '0123456789ABCDEF':
|
|
if len(od) == 4:
|
|
# This should not raise a KeyError.
|
|
od.popitem(last=False)
|
|
key = c0 + c1
|
|
od[key] = key
|
|
|
|
# Direct use of dict methods
|
|
|
|
def test_dict_setitem(self):
|
|
OrderedDict = self.OrderedDict
|
|
od = OrderedDict()
|
|
dict.__setitem__(od, 'spam', 1)
|
|
self.assertNotIn('NULL', repr(od))
|
|
|
|
def test_dict_delitem(self):
|
|
OrderedDict = self.OrderedDict
|
|
od = OrderedDict()
|
|
od['spam'] = 1
|
|
od['ham'] = 2
|
|
dict.__delitem__(od, 'spam')
|
|
with self.assertRaises(KeyError):
|
|
repr(od)
|
|
|
|
def test_dict_clear(self):
|
|
OrderedDict = self.OrderedDict
|
|
od = OrderedDict()
|
|
od['spam'] = 1
|
|
od['ham'] = 2
|
|
dict.clear(od)
|
|
self.assertNotIn('NULL', repr(od))
|
|
|
|
def test_dict_pop(self):
|
|
OrderedDict = self.OrderedDict
|
|
od = OrderedDict()
|
|
od['spam'] = 1
|
|
od['ham'] = 2
|
|
dict.pop(od, 'spam')
|
|
with self.assertRaises(KeyError):
|
|
repr(od)
|
|
|
|
def test_dict_popitem(self):
|
|
OrderedDict = self.OrderedDict
|
|
od = OrderedDict()
|
|
od['spam'] = 1
|
|
od['ham'] = 2
|
|
dict.popitem(od)
|
|
with self.assertRaises(KeyError):
|
|
repr(od)
|
|
|
|
def test_dict_setdefault(self):
|
|
OrderedDict = self.OrderedDict
|
|
od = OrderedDict()
|
|
dict.setdefault(od, 'spam', 1)
|
|
self.assertNotIn('NULL', repr(od))
|
|
|
|
def test_dict_update(self):
|
|
OrderedDict = self.OrderedDict
|
|
od = OrderedDict()
|
|
dict.update(od, [('spam', 1)])
|
|
self.assertNotIn('NULL', repr(od))
|
|
|
|
def test_reference_loop(self):
|
|
# Issue 25935
|
|
OrderedDict = self.OrderedDict
|
|
class A:
|
|
od = OrderedDict()
|
|
A.od[A] = None
|
|
r = weakref.ref(A)
|
|
del A
|
|
gc.collect()
|
|
self.assertIsNone(r())
|
|
|
|
def test_free_after_iterating(self):
|
|
support.check_free_after_iterating(self, iter, self.OrderedDict)
|
|
support.check_free_after_iterating(self, lambda d: iter(d.keys()), self.OrderedDict)
|
|
support.check_free_after_iterating(self, lambda d: iter(d.values()), self.OrderedDict)
|
|
support.check_free_after_iterating(self, lambda d: iter(d.items()), self.OrderedDict)
|
|
|
|
def test_merge_operator(self):
|
|
OrderedDict = self.OrderedDict
|
|
|
|
a = OrderedDict({0: 0, 1: 1, 2: 1})
|
|
b = OrderedDict({1: 1, 2: 2, 3: 3})
|
|
|
|
c = a.copy()
|
|
d = a.copy()
|
|
c |= b
|
|
d |= list(b.items())
|
|
expected = OrderedDict({0: 0, 1: 1, 2: 2, 3: 3})
|
|
self.assertEqual(a | dict(b), expected)
|
|
self.assertEqual(a | b, expected)
|
|
self.assertEqual(c, expected)
|
|
self.assertEqual(d, expected)
|
|
|
|
c = b.copy()
|
|
c |= a
|
|
expected = OrderedDict({1: 1, 2: 1, 3: 3, 0: 0})
|
|
self.assertEqual(dict(b) | a, expected)
|
|
self.assertEqual(b | a, expected)
|
|
self.assertEqual(c, expected)
|
|
|
|
self.assertIs(type(a | b), OrderedDict)
|
|
self.assertIs(type(dict(a) | b), OrderedDict)
|
|
self.assertIs(type(a | dict(b)), OrderedDict)
|
|
|
|
expected = a.copy()
|
|
a |= ()
|
|
a |= ""
|
|
self.assertEqual(a, expected)
|
|
|
|
with self.assertRaises(TypeError):
|
|
a | None
|
|
with self.assertRaises(TypeError):
|
|
a | ()
|
|
with self.assertRaises(TypeError):
|
|
a | "BAD"
|
|
with self.assertRaises(TypeError):
|
|
a | ""
|
|
with self.assertRaises(ValueError):
|
|
a |= "BAD"
|
|
|
|
@support.cpython_only
|
|
def test_ordered_dict_items_result_gc(self):
|
|
# bpo-42536: OrderedDict.items's tuple-reuse speed trick breaks the GC's
|
|
# assumptions about what can be untracked. Make sure we re-track result
|
|
# tuples whenever we reuse them.
|
|
it = iter(self.OrderedDict({None: []}).items())
|
|
gc.collect()
|
|
# That GC collection probably untracked the recycled internal result
|
|
# tuple, which is initialized to (None, None). Make sure it's re-tracked
|
|
# when it's mutated and returned from __next__:
|
|
self.assertTrue(gc.is_tracked(next(it)))
|
|
|
|
class PurePythonOrderedDictTests(OrderedDictTests, unittest.TestCase):
|
|
|
|
module = py_coll
|
|
OrderedDict = py_coll.OrderedDict
|
|
|
|
|
|
class CPythonBuiltinDictTests(unittest.TestCase):
|
|
"""Builtin dict preserves insertion order.
|
|
|
|
Reuse some of tests in OrderedDict selectively.
|
|
"""
|
|
|
|
module = builtins
|
|
OrderedDict = dict
|
|
|
|
for method in (
|
|
"test_init test_update test_abc test_clear test_delitem " +
|
|
"test_setitem test_detect_deletion_during_iteration " +
|
|
"test_popitem test_reinsert test_override_update " +
|
|
"test_highly_nested test_highly_nested_subclass " +
|
|
"test_delitem_hash_collision ").split():
|
|
setattr(CPythonBuiltinDictTests, method, getattr(OrderedDictTests, method))
|
|
del method
|
|
|
|
|
|
@unittest.skipUnless(c_coll, 'requires the C version of the collections module')
|
|
class CPythonOrderedDictTests(OrderedDictTests, unittest.TestCase):
|
|
|
|
module = c_coll
|
|
OrderedDict = c_coll.OrderedDict
|
|
check_sizeof = support.check_sizeof
|
|
|
|
@support.cpython_only
|
|
def test_sizeof_exact(self):
|
|
OrderedDict = self.OrderedDict
|
|
calcsize = struct.calcsize
|
|
size = support.calcobjsize
|
|
check = self.check_sizeof
|
|
|
|
basicsize = size('nQ2P' + '3PnPn2P')
|
|
keysize = calcsize('n2BI2n')
|
|
|
|
entrysize = calcsize('n2P')
|
|
p = calcsize('P')
|
|
nodesize = calcsize('Pn2P')
|
|
|
|
od = OrderedDict()
|
|
check(od, basicsize) # 8byte indices + 8*2//3 * entry table
|
|
od.x = 1
|
|
check(od, basicsize)
|
|
od.update([(i, i) for i in range(3)])
|
|
check(od, basicsize + keysize + 8*p + 8 + 5*entrysize + 3*nodesize)
|
|
od.update([(i, i) for i in range(3, 10)])
|
|
check(od, basicsize + keysize + 16*p + 16 + 10*entrysize + 10*nodesize)
|
|
|
|
check(od.keys(), size('P'))
|
|
check(od.items(), size('P'))
|
|
check(od.values(), size('P'))
|
|
|
|
itersize = size('iP2n2P')
|
|
check(iter(od), itersize)
|
|
check(iter(od.keys()), itersize)
|
|
check(iter(od.items()), itersize)
|
|
check(iter(od.values()), itersize)
|
|
|
|
def test_key_change_during_iteration(self):
|
|
OrderedDict = self.OrderedDict
|
|
|
|
od = OrderedDict.fromkeys('abcde')
|
|
self.assertEqual(list(od), list('abcde'))
|
|
with self.assertRaises(RuntimeError):
|
|
for i, k in enumerate(od):
|
|
od.move_to_end(k)
|
|
self.assertLess(i, 5)
|
|
with self.assertRaises(RuntimeError):
|
|
for k in od:
|
|
od['f'] = None
|
|
with self.assertRaises(RuntimeError):
|
|
for k in od:
|
|
del od['c']
|
|
self.assertEqual(list(od), list('bdeaf'))
|
|
|
|
def test_iterators_pickling(self):
|
|
OrderedDict = self.OrderedDict
|
|
pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)]
|
|
od = OrderedDict(pairs)
|
|
|
|
for method_name in ('keys', 'values', 'items'):
|
|
meth = getattr(od, method_name)
|
|
expected = list(meth())[1:]
|
|
for i in range(pickle.HIGHEST_PROTOCOL + 1):
|
|
with self.subTest(method_name=method_name, protocol=i):
|
|
it = iter(meth())
|
|
next(it)
|
|
p = pickle.dumps(it, i)
|
|
unpickled = pickle.loads(p)
|
|
self.assertEqual(list(unpickled), expected)
|
|
self.assertEqual(list(it), expected)
|
|
|
|
@support.cpython_only
|
|
def test_weakref_list_is_not_traversed(self):
|
|
# Check that the weakref list is not traversed when collecting
|
|
# OrderedDict objects. See bpo-39778 for more information.
|
|
|
|
gc.collect()
|
|
|
|
x = self.OrderedDict()
|
|
x.cycle = x
|
|
|
|
cycle = []
|
|
cycle.append(cycle)
|
|
|
|
x_ref = weakref.ref(x)
|
|
cycle.append(x_ref)
|
|
|
|
del x, cycle, x_ref
|
|
|
|
gc.collect()
|
|
|
|
|
|
class PurePythonOrderedDictSubclassTests(PurePythonOrderedDictTests):
|
|
|
|
module = py_coll
|
|
class OrderedDict(py_coll.OrderedDict):
|
|
pass
|
|
|
|
|
|
class CPythonOrderedDictSubclassTests(CPythonOrderedDictTests):
|
|
|
|
module = c_coll
|
|
class OrderedDict(c_coll.OrderedDict):
|
|
pass
|
|
|
|
|
|
class PurePythonOrderedDictWithSlotsCopyingTests(unittest.TestCase):
|
|
|
|
module = py_coll
|
|
class OrderedDict(py_coll.OrderedDict):
|
|
__slots__ = ('x', 'y')
|
|
test_copying = OrderedDictTests.test_copying
|
|
|
|
|
|
@unittest.skipUnless(c_coll, 'requires the C version of the collections module')
|
|
class CPythonOrderedDictWithSlotsCopyingTests(unittest.TestCase):
|
|
|
|
module = c_coll
|
|
class OrderedDict(c_coll.OrderedDict):
|
|
__slots__ = ('x', 'y')
|
|
test_copying = OrderedDictTests.test_copying
|
|
|
|
|
|
class PurePythonGeneralMappingTests(mapping_tests.BasicTestMappingProtocol):
|
|
|
|
@classmethod
|
|
def setUpClass(cls):
|
|
cls.type2test = py_coll.OrderedDict
|
|
|
|
def test_popitem(self):
|
|
d = self._empty_mapping()
|
|
self.assertRaises(KeyError, d.popitem)
|
|
|
|
|
|
@unittest.skipUnless(c_coll, 'requires the C version of the collections module')
|
|
class CPythonGeneralMappingTests(mapping_tests.BasicTestMappingProtocol):
|
|
|
|
@classmethod
|
|
def setUpClass(cls):
|
|
cls.type2test = c_coll.OrderedDict
|
|
|
|
def test_popitem(self):
|
|
d = self._empty_mapping()
|
|
self.assertRaises(KeyError, d.popitem)
|
|
|
|
|
|
class PurePythonSubclassMappingTests(mapping_tests.BasicTestMappingProtocol):
|
|
|
|
@classmethod
|
|
def setUpClass(cls):
|
|
class MyOrderedDict(py_coll.OrderedDict):
|
|
pass
|
|
cls.type2test = MyOrderedDict
|
|
|
|
def test_popitem(self):
|
|
d = self._empty_mapping()
|
|
self.assertRaises(KeyError, d.popitem)
|
|
|
|
|
|
@unittest.skipUnless(c_coll, 'requires the C version of the collections module')
|
|
class CPythonSubclassMappingTests(mapping_tests.BasicTestMappingProtocol):
|
|
|
|
@classmethod
|
|
def setUpClass(cls):
|
|
class MyOrderedDict(c_coll.OrderedDict):
|
|
pass
|
|
cls.type2test = MyOrderedDict
|
|
|
|
def test_popitem(self):
|
|
d = self._empty_mapping()
|
|
self.assertRaises(KeyError, d.popitem)
|
|
|
|
|
|
class SimpleLRUCache:
|
|
|
|
def __init__(self, size):
|
|
super().__init__()
|
|
self.size = size
|
|
self.counts = dict.fromkeys(('get', 'set', 'del'), 0)
|
|
|
|
def __getitem__(self, item):
|
|
self.counts['get'] += 1
|
|
value = super().__getitem__(item)
|
|
self.move_to_end(item)
|
|
return value
|
|
|
|
def __setitem__(self, key, value):
|
|
self.counts['set'] += 1
|
|
while key not in self and len(self) >= self.size:
|
|
self.popitem(last=False)
|
|
super().__setitem__(key, value)
|
|
self.move_to_end(key)
|
|
|
|
def __delitem__(self, key):
|
|
self.counts['del'] += 1
|
|
super().__delitem__(key)
|
|
|
|
|
|
class SimpleLRUCacheTests:
|
|
|
|
def test_add_after_full(self):
|
|
c = self.type2test(2)
|
|
c['t1'] = 1
|
|
c['t2'] = 2
|
|
c['t3'] = 3
|
|
self.assertEqual(c.counts, {'get': 0, 'set': 3, 'del': 0})
|
|
self.assertEqual(list(c), ['t2', 't3'])
|
|
self.assertEqual(c.counts, {'get': 0, 'set': 3, 'del': 0})
|
|
|
|
def test_popitem(self):
|
|
c = self.type2test(3)
|
|
for i in range(1, 4):
|
|
c[i] = i
|
|
self.assertEqual(c.popitem(last=False), (1, 1))
|
|
self.assertEqual(c.popitem(last=True), (3, 3))
|
|
self.assertEqual(c.counts, {'get': 0, 'set': 3, 'del': 0})
|
|
|
|
def test_pop(self):
|
|
c = self.type2test(3)
|
|
for i in range(1, 4):
|
|
c[i] = i
|
|
self.assertEqual(c.counts, {'get': 0, 'set': 3, 'del': 0})
|
|
self.assertEqual(c.pop(2), 2)
|
|
self.assertEqual(c.counts, {'get': 0, 'set': 3, 'del': 0})
|
|
self.assertEqual(c.pop(4, 0), 0)
|
|
self.assertEqual(c.counts, {'get': 0, 'set': 3, 'del': 0})
|
|
self.assertRaises(KeyError, c.pop, 4)
|
|
self.assertEqual(c.counts, {'get': 0, 'set': 3, 'del': 0})
|
|
|
|
def test_change_order_on_get(self):
|
|
c = self.type2test(3)
|
|
for i in range(1, 4):
|
|
c[i] = i
|
|
self.assertEqual(list(c), list(range(1, 4)))
|
|
self.assertEqual(c.counts, {'get': 0, 'set': 3, 'del': 0})
|
|
self.assertEqual(c[2], 2)
|
|
self.assertEqual(c.counts, {'get': 1, 'set': 3, 'del': 0})
|
|
self.assertEqual(list(c), [1, 3, 2])
|
|
|
|
|
|
class PySimpleLRUCacheTests(SimpleLRUCacheTests, unittest.TestCase):
|
|
|
|
class type2test(SimpleLRUCache, py_coll.OrderedDict):
|
|
pass
|
|
|
|
|
|
@unittest.skipUnless(c_coll, 'requires the C version of the collections module')
|
|
class CSimpleLRUCacheTests(SimpleLRUCacheTests, unittest.TestCase):
|
|
|
|
@classmethod
|
|
def setUpClass(cls):
|
|
class type2test(SimpleLRUCache, c_coll.OrderedDict):
|
|
pass
|
|
cls.type2test = type2test
|
|
|
|
|
|
if __name__ == "__main__":
|
|
unittest.main()
|