return len(set().union(*self.maps)) # reuses stored hash values if possible
def __iter__(self):
- return iter(set().union(*self.maps))
+ d = {}
+ for mapping in reversed(self.maps):
+ d.update(mapping) # reuses stored hash values if possible
+ return iter(d)
def __contains__(self, key):
return any(key in m for m in self.maps)
with self.assertRaises(KeyError):
d.popitem()
+ def test_order_preservation(self):
+ d = ChainMap(
+ OrderedDict(j=0, h=88888),
+ OrderedDict(),
+ OrderedDict(i=9999, d=4444, c=3333),
+ OrderedDict(f=666, b=222, g=777, c=333, h=888),
+ OrderedDict(),
+ OrderedDict(e=55, b=22),
+ OrderedDict(a=1, b=2, c=3, d=4, e=5),
+ OrderedDict(),
+ )
+ self.assertEqual(''.join(d), 'abcdefghij')
+ self.assertEqual(list(d.items()),
+ [('a', 1), ('b', 222), ('c', 3333), ('d', 4444),
+ ('e', 55), ('f', 666), ('g', 777), ('h', 88888),
+ ('i', 9999), ('j', 0)])
+
def test_dict_coercion(self):
d = ChainMap(dict(a=1, b=2), dict(b=20, c=30))
self.assertEqual(dict(d), dict(a=1, b=2, c=30))