cpython: 46e95e0eaae5 (original) (raw)
--- a/Lib/test/test_collections.py +++ b/Lib/test/test_collections.py @@ -1,18 +1,21 @@ """Unit tests for collections.py.""" -import unittest, doctest, operator -from test.support import TESTFN, forget, unlink, import_fresh_module -import contextlib +import collections +import copy +import doctest import inspect +import keyword +import operator +import pickle +from random import choice, randrange +import re +import string +import sys from test import support +import types +import unittest + from collections import namedtuple, Counter, OrderedDict, _count_elements -from test import mapping_tests -import pickle, copy -from random import randrange, shuffle -import keyword -import re -import sys -import types from collections import UserDict, UserString, UserList from collections import ChainMap from collections import deque @@ -313,8 +316,7 @@ class TestNamedTuple(unittest.TestCase): # n = 5000 n = 254 # SyntaxError: more than 255 arguments:
import string, random[](#l1.39)names = list(set(''.join([random.choice(string.ascii_letters)[](#l1.40)
names = list(set(''.join([choice(string.ascii_letters)[](#l1.41) for j in range(10)]) for i in range(n)))[](#l1.42) n = len(names)[](#l1.43) Big = namedtuple('Big', names)[](#l1.44)
@@ -1621,694 +1623,13 @@ class TestCounter(unittest.TestCase): ################################################################################ -### OrderedDict -################################################################################ - -py_coll = import_fresh_module('collections', blocked=['_collections']) -c_coll = import_fresh_module('collections', fresh=['_collections']) - - -@contextlib.contextmanager -def replaced_module(name, replacement):
- original_module = sys.modules[name]
- sys.modules[name] = replacement
- try:
yield[](#l1.61)- finally:
sys.modules[name] = original_module[](#l1.63)
- - -class OrderedDictTests: -
- def test_init(self):
OrderedDict = self.OrderedDict[](#l1.69)with self.assertRaises(TypeError):[](#l1.70)OrderedDict([('a', 1), ('b', 2)], None) # too many args[](#l1.71)pairs = [('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5)][](#l1.72)self.assertEqual(sorted(OrderedDict(dict(pairs)).items()), pairs) # dict input[](#l1.73)self.assertEqual(sorted(OrderedDict(**dict(pairs)).items()), pairs) # kwds input[](#l1.74)self.assertEqual(list(OrderedDict(pairs).items()), pairs) # pairs input[](#l1.75)self.assertEqual(list(OrderedDict([('a', 1), ('b', 2), ('c', 9), ('d', 4)],[](#l1.76)c=3, e=5).items()), pairs) # mixed input[](#l1.77)
# make sure no positional args conflict with possible kwdargs[](#l1.79)self.assertEqual(list(OrderedDict(self=42).items()), [('self', 42)])[](#l1.80)self.assertEqual(list(OrderedDict(other=42).items()), [('other', 42)])[](#l1.81)self.assertRaises(TypeError, OrderedDict, 42)[](#l1.82)self.assertRaises(TypeError, OrderedDict, (), ())[](#l1.83)self.assertRaises(TypeError, OrderedDict.__init__)[](#l1.84)
# Make sure that direct calls to __init__ do not clear previous contents[](#l1.86)d = OrderedDict([('a', 1), ('b', 2), ('c', 3), ('d', 44), ('e', 55)])[](#l1.87)d.__init__([('e', 5), ('f', 6)], g=7, d=4)[](#l1.88)self.assertEqual(list(d.items()),[](#l1.89)[('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5), ('f', 6), ('g', 7)])[](#l1.90)
- def test_update(self):
OrderedDict = self.OrderedDict[](#l1.93)with self.assertRaises(TypeError):[](#l1.94)OrderedDict().update([('a', 1), ('b', 2)], None) # too many args[](#l1.95)pairs = [('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5)][](#l1.96)od = OrderedDict()[](#l1.97)od.update(dict(pairs))[](#l1.98)self.assertEqual(sorted(od.items()), pairs) # dict input[](#l1.99)od = OrderedDict()[](#l1.100)od.update(**dict(pairs))[](#l1.101)self.assertEqual(sorted(od.items()), pairs) # kwds input[](#l1.102)od = OrderedDict()[](#l1.103)od.update(pairs)[](#l1.104)self.assertEqual(list(od.items()), pairs) # pairs input[](#l1.105)od = OrderedDict()[](#l1.106)od.update([('a', 1), ('b', 2), ('c', 9), ('d', 4)], c=3, e=5)[](#l1.107)self.assertEqual(list(od.items()), pairs) # mixed input[](#l1.108)
# Issue 9137: Named argument called 'other' or 'self'[](#l1.110)# shouldn't be treated specially.[](#l1.111)od = OrderedDict()[](#l1.112)od.update(self=23)[](#l1.113)self.assertEqual(list(od.items()), [('self', 23)])[](#l1.114)od = OrderedDict()[](#l1.115)od.update(other={})[](#l1.116)self.assertEqual(list(od.items()), [('other', {})])[](#l1.117)od = OrderedDict()[](#l1.118)od.update(red=5, blue=6, other=7, self=8)[](#l1.119)self.assertEqual(sorted(list(od.items())),[](#l1.120)[('blue', 6), ('other', 7), ('red', 5), ('self', 8)])[](#l1.121)
# Make sure that direct calls to update do not clear previous contents[](#l1.123)# add that updates items are not moved to the end[](#l1.124)d = OrderedDict([('a', 1), ('b', 2), ('c', 3), ('d', 44), ('e', 55)])[](#l1.125)d.update([('e', 5), ('f', 6)], g=7, d=4)[](#l1.126)self.assertEqual(list(d.items()),[](#l1.127)[('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5), ('f', 6), ('g', 7)])[](#l1.128)
self.assertRaises(TypeError, OrderedDict().update, 42)[](#l1.130)self.assertRaises(TypeError, OrderedDict().update, (), ())[](#l1.131)self.assertRaises(TypeError, OrderedDict.update)[](#l1.132)
self.assertRaises(TypeError, OrderedDict().update, 42)[](#l1.134)self.assertRaises(TypeError, OrderedDict().update, (), ())[](#l1.135)self.assertRaises(TypeError, OrderedDict.update)[](#l1.136)
- def test_fromkeys(self):
OrderedDict = self.OrderedDict[](#l1.139)od = OrderedDict.fromkeys('abc')[](#l1.140)self.assertEqual(list(od.items()), [(c, None) for c in 'abc'])[](#l1.141)od = OrderedDict.fromkeys('abc', value=None)[](#l1.142)self.assertEqual(list(od.items()), [(c, None) for c in 'abc'])[](#l1.143)od = OrderedDict.fromkeys('abc', value=0)[](#l1.144)self.assertEqual(list(od.items()), [(c, 0) for c in 'abc'])[](#l1.145)
- def test_abc(self):
OrderedDict = self.OrderedDict[](#l1.148)self.assertIsInstance(OrderedDict(), MutableMapping)[](#l1.149)self.assertTrue(issubclass(OrderedDict, MutableMapping))[](#l1.150)
- def test_clear(self):
OrderedDict = self.OrderedDict[](#l1.153)pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)][](#l1.154)shuffle(pairs)[](#l1.155)od = OrderedDict(pairs)[](#l1.156)self.assertEqual(len(od), len(pairs))[](#l1.157)od.clear()[](#l1.158)self.assertEqual(len(od), 0)[](#l1.159)
- def test_delitem(self):
OrderedDict = self.OrderedDict[](#l1.162)pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)][](#l1.163)od = OrderedDict(pairs)[](#l1.164)del od['a'][](#l1.165)self.assertNotIn('a', od)[](#l1.166)with self.assertRaises(KeyError):[](#l1.167)del od['a'][](#l1.168)self.assertEqual(list(od.items()), pairs[:2] + pairs[3:])[](#l1.169)
- def test_setitem(self):
OrderedDict = self.OrderedDict[](#l1.172)od = OrderedDict([('d', 1), ('b', 2), ('c', 3), ('a', 4), ('e', 5)])[](#l1.173)od['c'] = 10 # existing element[](#l1.174)od['f'] = 20 # new element[](#l1.175)self.assertEqual(list(od.items()),[](#l1.176)[('d', 1), ('b', 2), ('c', 10), ('a', 4), ('e', 5), ('f', 20)])[](#l1.177)
- def test_iterators(self):
OrderedDict = self.OrderedDict[](#l1.180)pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)][](#l1.181)shuffle(pairs)[](#l1.182)od = OrderedDict(pairs)[](#l1.183)self.assertEqual(list(od), [t[0] for t in pairs])[](#l1.184)self.assertEqual(list(od.keys()), [t[0] for t in pairs])[](#l1.185)self.assertEqual(list(od.values()), [t[1] for t in pairs])[](#l1.186)self.assertEqual(list(od.items()), pairs)[](#l1.187)self.assertEqual(list(reversed(od)),[](#l1.188)[t[0] for t in reversed(pairs)])[](#l1.189)self.assertEqual(list(reversed(od.keys())),[](#l1.190)[t[0] for t in reversed(pairs)])[](#l1.191)self.assertEqual(list(reversed(od.values())),[](#l1.192)[t[1] for t in reversed(pairs)])[](#l1.193)self.assertEqual(list(reversed(od.items())), list(reversed(pairs)))[](#l1.194)
- def test_detect_deletion_during_iteration(self):
OrderedDict = self.OrderedDict[](#l1.197)od = OrderedDict.fromkeys('abc')[](#l1.198)it = iter(od)[](#l1.199)key = next(it)[](#l1.200)del od[key][](#l1.201)with self.assertRaises(Exception):[](#l1.202)# Note, the exact exception raised is not guaranteed[](#l1.203)# The only guarantee that the next() will not succeed[](#l1.204)next(it)[](#l1.205)
- def test_sorted_iterators(self):
OrderedDict = self.OrderedDict[](#l1.208)with self.assertRaises(TypeError):[](#l1.209)OrderedDict([('a', 1), ('b', 2)], None)[](#l1.210)pairs = [('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5)][](#l1.211)od = OrderedDict(pairs)[](#l1.212)self.assertEqual(sorted(od), [t[0] for t in pairs])[](#l1.213)self.assertEqual(sorted(od.keys()), [t[0] for t in pairs])[](#l1.214)self.assertEqual(sorted(od.values()), [t[1] for t in pairs])[](#l1.215)self.assertEqual(sorted(od.items()), pairs)[](#l1.216)self.assertEqual(sorted(reversed(od)),[](#l1.217)sorted([t[0] for t in reversed(pairs)]))[](#l1.218)
- def test_iterators_empty(self):
OrderedDict = self.OrderedDict[](#l1.221)od = OrderedDict()[](#l1.222)empty = [][](#l1.223)self.assertEqual(list(od), empty)[](#l1.224)self.assertEqual(list(od.keys()), empty)[](#l1.225)self.assertEqual(list(od.values()), empty)[](#l1.226)self.assertEqual(list(od.items()), empty)[](#l1.227)self.assertEqual(list(reversed(od)), empty)[](#l1.228)self.assertEqual(list(reversed(od.keys())), empty)[](#l1.229)self.assertEqual(list(reversed(od.values())), empty)[](#l1.230)self.assertEqual(list(reversed(od.items())), empty)[](#l1.231)
- def test_popitem(self):
OrderedDict = self.OrderedDict[](#l1.234)pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)][](#l1.235)shuffle(pairs)[](#l1.236)od = OrderedDict(pairs)[](#l1.237)while pairs:[](#l1.238)self.assertEqual(od.popitem(), pairs.pop())[](#l1.239)with self.assertRaises(KeyError):[](#l1.240)od.popitem()[](#l1.241)self.assertEqual(len(od), 0)[](#l1.242)
- def test_popitem_last(self):
OrderedDict = self.OrderedDict[](#l1.245)pairs = [(i, i) for i in range(30)][](#l1.246)
obj = OrderedDict(pairs)[](#l1.248)for i in range(8):[](#l1.249)obj.popitem(True)[](#l1.250)obj.popitem(True)[](#l1.251)obj.popitem(last=True)[](#l1.252)self.assertEqual(len(obj), 20)[](#l1.253)
- def test_pop(self):
OrderedDict = self.OrderedDict[](#l1.256)pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)][](#l1.257)shuffle(pairs)[](#l1.258)od = OrderedDict(pairs)[](#l1.259)shuffle(pairs)[](#l1.260)while pairs:[](#l1.261)k, v = pairs.pop()[](#l1.262)self.assertEqual(od.pop(k), v)[](#l1.263)with self.assertRaises(KeyError):[](#l1.264)od.pop('xyz')[](#l1.265)self.assertEqual(len(od), 0)[](#l1.266)self.assertEqual(od.pop(k, 12345), 12345)[](#l1.267)
# make sure pop still works when __missing__ is defined[](#l1.269)class Missing(OrderedDict):[](#l1.270)def __missing__(self, key):[](#l1.271)return 0[](#l1.272)m = Missing(a=1)[](#l1.273)self.assertEqual(m.pop('b', 5), 5)[](#l1.274)self.assertEqual(m.pop('a', 6), 1)[](#l1.275)self.assertEqual(m.pop('a', 6), 6)[](#l1.276)self.assertEqual(m.pop('a', default=6), 6)[](#l1.277)with self.assertRaises(KeyError):[](#l1.278)m.pop('a')[](#l1.279)
- def test_equality(self):
OrderedDict = self.OrderedDict[](#l1.282)pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)][](#l1.283)shuffle(pairs)[](#l1.284)od1 = OrderedDict(pairs)[](#l1.285)od2 = OrderedDict(pairs)[](#l1.286)self.assertEqual(od1, od2) # same order implies equality[](#l1.287)pairs = pairs[2:] + pairs[:2][](#l1.288)od2 = OrderedDict(pairs)[](#l1.289)self.assertNotEqual(od1, od2) # different order implies inequality[](#l1.290)# comparison to regular dict is not order sensitive[](#l1.291)self.assertEqual(od1, dict(od2))[](#l1.292)self.assertEqual(dict(od2), od1)[](#l1.293)# different length implied inequality[](#l1.294)self.assertNotEqual(od1, OrderedDict(pairs[:-1]))[](#l1.295)
- def test_copying(self):
OrderedDict = self.OrderedDict[](#l1.298)# Check that ordered dicts are copyable, deepcopyable, picklable,[](#l1.299)# and have a repr/eval round-trip[](#l1.300)pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)][](#l1.301)od = OrderedDict(pairs)[](#l1.302)def check(dup):[](#l1.303)msg = "\ncopy: %s\nod: %s" % (dup, od)[](#l1.304)self.assertIsNot(dup, od, msg)[](#l1.305)self.assertEqual(dup, od)[](#l1.306)self.assertEqual(list(dup.items()), list(od.items()))[](#l1.307)self.assertEqual(len(dup), len(od))[](#l1.308)self.assertEqual(type(dup), type(od))[](#l1.309)check(od.copy())[](#l1.310)check(copy.copy(od))[](#l1.311)check(copy.deepcopy(od))[](#l1.312)# pickle directly pulls the module, so we have to fake it[](#l1.313)with replaced_module('collections', self.module):[](#l1.314)for proto in range(pickle.HIGHEST_PROTOCOL + 1):[](#l1.315)with self.subTest(proto=proto):[](#l1.316)check(pickle.loads(pickle.dumps(od, proto)))[](#l1.317)check(eval(repr(od)))[](#l1.318)update_test = OrderedDict()[](#l1.319)update_test.update(od)[](#l1.320)check(update_test)[](#l1.321)check(OrderedDict(od))[](#l1.322)
- def test_yaml_linkage(self):
OrderedDict = self.OrderedDict[](#l1.325)# Verify that __reduce__ is setup in a way that supports PyYAML's dump() feature.[](#l1.326)# In yaml, lists are native but tuples are not.[](#l1.327)pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)][](#l1.328)od = OrderedDict(pairs)[](#l1.329)# yaml.dump(od) -->[](#l1.330)# '!!python/object/apply:__main__.OrderedDict\n- - [a, 1]\n - [b, 2]\n'[](#l1.331)self.assertTrue(all(type(pair)==list for pair in od.__reduce__()[1]))[](#l1.332)
- def test_reduce_not_too_fat(self):
OrderedDict = self.OrderedDict[](#l1.335)# do not save instance dictionary if not needed[](#l1.336)pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)][](#l1.337)od = OrderedDict(pairs)[](#l1.338)self.assertIsNone(od.__reduce__()[2])[](#l1.339)od.x = 10[](#l1.340)self.assertIsNotNone(od.__reduce__()[2])[](#l1.341)
- def test_pickle_recursive(self):
OrderedDict = self.OrderedDict[](#l1.344)od = OrderedDict()[](#l1.345)od[1] = od[](#l1.346)
# pickle directly pulls the module, so we have to fake it[](#l1.348)with replaced_module('collections', self.module):[](#l1.349)for proto in range(-1, pickle.HIGHEST_PROTOCOL + 1):[](#l1.350)dup = pickle.loads(pickle.dumps(od, proto))[](#l1.351)self.assertIsNot(dup, od)[](#l1.352)self.assertEqual(list(dup.keys()), [1])[](#l1.353)self.assertIs(dup[1], dup)[](#l1.354)
- def test_repr(self):
OrderedDict = self.OrderedDict[](#l1.357)od = OrderedDict([('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)])[](#l1.358)self.assertEqual(repr(od),[](#l1.359)"OrderedDict([('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)])")[](#l1.360)self.assertEqual(eval(repr(od)), od)[](#l1.361)self.assertEqual(repr(OrderedDict()), "OrderedDict()")[](#l1.362)
- def test_repr_recursive(self):
OrderedDict = self.OrderedDict[](#l1.365)# See issue #9826[](#l1.366)od = OrderedDict.fromkeys('abc')[](#l1.367)od['x'] = od[](#l1.368)self.assertEqual(repr(od),[](#l1.369)"OrderedDict([('a', None), ('b', None), ('c', None), ('x', ...)])")[](#l1.370)
- def test_setdefault(self):
OrderedDict = self.OrderedDict[](#l1.373)pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)][](#l1.374)shuffle(pairs)[](#l1.375)od = OrderedDict(pairs)[](#l1.376)pair_order = list(od.items())[](#l1.377)self.assertEqual(od.setdefault('a', 10), 3)[](#l1.378)# make sure order didn't change[](#l1.379)self.assertEqual(list(od.items()), pair_order)[](#l1.380)self.assertEqual(od.setdefault('x', 10), 10)[](#l1.381)# make sure 'x' is added to the end[](#l1.382)self.assertEqual(list(od.items())[-1], ('x', 10))[](#l1.383)self.assertEqual(od.setdefault('g', default=9), 9)[](#l1.384)
# make sure setdefault still works when __missing__ is defined[](#l1.386)class Missing(OrderedDict):[](#l1.387)def __missing__(self, key):[](#l1.388)return 0[](#l1.389)self.assertEqual(Missing().setdefault(5, 9), 9)[](#l1.390)
- def test_reinsert(self):
OrderedDict = self.OrderedDict[](#l1.393)# Given insert a, insert b, delete a, re-insert a,[](#l1.394)# verify that a is now later than b.[](#l1.395)od = OrderedDict()[](#l1.396)od['a'] = 1[](#l1.397)od['b'] = 2[](#l1.398)del od['a'][](#l1.399)self.assertEqual(list(od.items()), [('b', 2)])[](#l1.400)od['a'] = 1[](#l1.401)self.assertEqual(list(od.items()), [('b', 2), ('a', 1)])[](#l1.402)
- def test_move_to_end(self):
OrderedDict = self.OrderedDict[](#l1.405)od = OrderedDict.fromkeys('abcde')[](#l1.406)self.assertEqual(list(od), list('abcde'))[](#l1.407)od.move_to_end('c')[](#l1.408)self.assertEqual(list(od), list('abdec'))[](#l1.409)od.move_to_end('c', 0)[](#l1.410)self.assertEqual(list(od), list('cabde'))[](#l1.411)od.move_to_end('c', 0)[](#l1.412)self.assertEqual(list(od), list('cabde'))[](#l1.413)od.move_to_end('e')[](#l1.414)self.assertEqual(list(od), list('cabde'))[](#l1.415)od.move_to_end('b', last=False)[](#l1.416)self.assertEqual(list(od), list('bcade'))[](#l1.417)with self.assertRaises(KeyError):[](#l1.418)od.move_to_end('x')[](#l1.419)with self.assertRaises(KeyError):[](#l1.420)od.move_to_end('x', 0)[](#l1.421)
- def test_move_to_end_issue25406(self):
OrderedDict = self.OrderedDict[](#l1.424)od = OrderedDict.fromkeys('abc')[](#l1.425)od.move_to_end('c', last=False)[](#l1.426)self.assertEqual(list(od), list('cab'))[](#l1.427)od.move_to_end('a', last=False)[](#l1.428)self.assertEqual(list(od), list('acb'))[](#l1.429)
od = OrderedDict.fromkeys('abc')[](#l1.431)od.move_to_end('a')[](#l1.432)self.assertEqual(list(od), list('bca'))[](#l1.433)od.move_to_end('c')[](#l1.434)self.assertEqual(list(od), list('bac'))[](#l1.435)
- def test_sizeof(self):
OrderedDict = self.OrderedDict[](#l1.438)# Wimpy test: Just verify the reported size is larger than a regular dict[](#l1.439)d = dict(a=1)[](#l1.440)od = OrderedDict(**d)[](#l1.441)self.assertGreater(sys.getsizeof(od), sys.getsizeof(d))[](#l1.442)
- def test_override_update(self):
OrderedDict = self.OrderedDict[](#l1.445)# Verify that subclasses can override update() without breaking __init__()[](#l1.446)class MyOD(OrderedDict):[](#l1.447)def update(self, *args, **kwds):[](#l1.448)raise Exception()[](#l1.449)items = [('a', 1), ('c', 3), ('b', 2)][](#l1.450)self.assertEqual(list(MyOD(items).items()), items)[](#l1.451)
- def test_highly_nested(self):
# Issue 25395: crashes during garbage collection[](#l1.454)OrderedDict = self.OrderedDict[](#l1.455)obj = None[](#l1.456)for _ in range(1000):[](#l1.457)obj = OrderedDict([(None, obj)])[](#l1.458)del obj[](#l1.459)support.gc_collect()[](#l1.460)
- def test_highly_nested_subclass(self):
# Issue 25395: crashes during garbage collection[](#l1.463)OrderedDict = self.OrderedDict[](#l1.464)deleted = [][](#l1.465)class MyOD(OrderedDict):[](#l1.466)def __del__(self):[](#l1.467)deleted.append(self.i)[](#l1.468)obj = None[](#l1.469)for i in range(100):[](#l1.470)obj = MyOD([(None, obj)])[](#l1.471)obj.i = i[](#l1.472)del obj[](#l1.473)support.gc_collect()[](#l1.474)self.assertEqual(deleted, list(reversed(range(100))))[](#l1.475)
class Key:[](#l1.480)def __init__(self, hash):[](#l1.481)self._hash = hash[](#l1.482)self.value = str(id(self))[](#l1.483)def __hash__(self):[](#l1.484)return self._hash[](#l1.485)def __eq__(self, other):[](#l1.486)try:[](#l1.487)return self.value == other.value[](#l1.488)except AttributeError:[](#l1.489)return False[](#l1.490)def __repr__(self):[](#l1.491)return self.value[](#l1.492)
def blocking_hash(hash):[](#l1.494)# See the collision-handling in lookdict (in Objects/dictobject.c).[](#l1.495)MINSIZE = 8[](#l1.496)i = (hash & MINSIZE-1)[](#l1.497)return (i << 2) + i + hash + 1[](#l1.498)
COLLIDING = 1[](#l1.500)
key = Key(COLLIDING)[](#l1.502)colliding = Key(COLLIDING)[](#l1.503)blocking = Key(blocking_hash(COLLIDING))[](#l1.504)
od = OrderedDict()[](#l1.506)od[key] = ...[](#l1.507)od[blocking] = ...[](#l1.508)od[colliding] = ...[](#l1.509)od['after'] = ...[](#l1.510)
del od[blocking][](#l1.512)del od[colliding][](#l1.513)self.assertEqual(list(od.items()), [(key, ...), ('after', ...)])[](#l1.514)
class Key:[](#l1.519)def __hash__(self):[](#l1.520)return randrange(100000)[](#l1.521)
od = OrderedDict()[](#l1.523)for i in range(100):[](#l1.524)key = Key()[](#l1.525)od[key] = i[](#l1.526)
# These should not crash.[](#l1.528)with self.assertRaises(KeyError):[](#l1.529)list(od.values())[](#l1.530)with self.assertRaises(KeyError):[](#l1.531)list(od.items())[](#l1.532)with self.assertRaises(KeyError):[](#l1.533)repr(od)[](#l1.534)with self.assertRaises(KeyError):[](#l1.535)od.copy()[](#l1.536)
class Key:[](#l1.541)def __hash__(self):[](#l1.542)return 1[](#l1.543)
od = OrderedDict()[](#l1.545)od[Key()] = 0[](#l1.546)# This should not crash.[](#l1.547)od.popitem()[](#l1.548)
- def test_issue24667(self):
"""[](#l1.551)dict resizes after a certain number of insertion operations,[](#l1.552)whether or not there were deletions that freed up slots in the[](#l1.553)hash table. During fast node lookup, OrderedDict must correctly[](#l1.554)respond to all resizes, even if the current "size" is the same[](#l1.555)as the old one. We verify that here by forcing a dict resize[](#l1.556)on a sparse odict and then perform an operation that should[](#l1.557)trigger an odict resize (e.g. popitem). One key aspect here is[](#l1.558)that we will keep the size of the odict the same at each popitem[](#l1.559)call. This verifies that we handled the dict resize properly.[](#l1.560)"""[](#l1.561)OrderedDict = self.OrderedDict[](#l1.562)
od = OrderedDict()[](#l1.564)for c0 in '0123456789ABCDEF':[](#l1.565)for c1 in '0123456789ABCDEF':[](#l1.566)if len(od) == 4:[](#l1.567)# This should not raise a KeyError.[](#l1.568)od.popitem(last=False)[](#l1.569)key = c0 + c1[](#l1.570)od[key] = key[](#l1.571)
- def test_dict_setitem(self):
OrderedDict = self.OrderedDict[](#l1.576)od = OrderedDict()[](#l1.577)dict.__setitem__(od, 'spam', 1)[](#l1.578)self.assertNotIn('NULL', repr(od))[](#l1.579)
- def test_dict_delitem(self):
OrderedDict = self.OrderedDict[](#l1.582)od = OrderedDict()[](#l1.583)od['spam'] = 1[](#l1.584)od['ham'] = 2[](#l1.585)dict.__delitem__(od, 'spam')[](#l1.586)with self.assertRaises(KeyError):[](#l1.587)repr(od)[](#l1.588)
- def test_dict_clear(self):
OrderedDict = self.OrderedDict[](#l1.591)od = OrderedDict()[](#l1.592)od['spam'] = 1[](#l1.593)od['ham'] = 2[](#l1.594)dict.clear(od)[](#l1.595)self.assertNotIn('NULL', repr(od))[](#l1.596)
- def test_dict_pop(self):
OrderedDict = self.OrderedDict[](#l1.599)od = OrderedDict()[](#l1.600)od['spam'] = 1[](#l1.601)od['ham'] = 2[](#l1.602)dict.pop(od, 'spam')[](#l1.603)with self.assertRaises(KeyError):[](#l1.604)repr(od)[](#l1.605)
- def test_dict_popitem(self):
OrderedDict = self.OrderedDict[](#l1.608)od = OrderedDict()[](#l1.609)od['spam'] = 1[](#l1.610)od['ham'] = 2[](#l1.611)dict.popitem(od)[](#l1.612)with self.assertRaises(KeyError):[](#l1.613)repr(od)[](#l1.614)
- def test_dict_setdefault(self):
OrderedDict = self.OrderedDict[](#l1.617)od = OrderedDict()[](#l1.618)dict.setdefault(od, 'spam', 1)[](#l1.619)self.assertNotIn('NULL', repr(od))[](#l1.620)
- def test_dict_update(self):
od = OrderedDict()[](#l1.623)dict.update(od, [('spam', 1)])[](#l1.624)self.assertNotIn('NULL', repr(od))[](#l1.625)
- - -class PurePythonOrderedDictTests(OrderedDictTests, unittest.TestCase): -
- - -@unittest.skipUnless(c_coll, 'requires the C version of the collections module') -class CPythonOrderedDictTests(OrderedDictTests, unittest.TestCase): -
od = OrderedDict.fromkeys('abcde')[](#l1.643)self.assertEqual(list(od), list('abcde'))[](#l1.644)with self.assertRaises(RuntimeError):[](#l1.645)for i, k in enumerate(od):[](#l1.646)od.move_to_end(k)[](#l1.647)self.assertLess(i, 5)[](#l1.648)with self.assertRaises(RuntimeError):[](#l1.649)for k in od:[](#l1.650)od['f'] = None[](#l1.651)with self.assertRaises(RuntimeError):[](#l1.652)for k in od:[](#l1.653)del od['c'][](#l1.654)self.assertEqual(list(od), list('bdeaf'))[](#l1.655)
- - -class PurePythonOrderedDictSubclassTests(PurePythonOrderedDictTests): -
- - -class CPythonOrderedDictSubclassTests(CPythonOrderedDictTests): -
- - -class PurePythonGeneralMappingTests(mapping_tests.BasicTestMappingProtocol): -
- def test_popitem(self):
d = self._empty_mapping()[](#l1.679)self.assertRaises(KeyError, d.popitem)[](#l1.680)
- - -@unittest.skipUnless(c_coll, 'requires the C version of the collections module') -class CPythonGeneralMappingTests(mapping_tests.BasicTestMappingProtocol): -
- def test_popitem(self):
d = self._empty_mapping()[](#l1.691)self.assertRaises(KeyError, d.popitem)[](#l1.692)
- - -class PurePythonSubclassMappingTests(mapping_tests.BasicTestMappingProtocol): -
- @classmethod
- def setUpClass(cls):
class MyOrderedDict(py_coll.OrderedDict):[](#l1.699)pass[](#l1.700)cls.type2test = MyOrderedDict[](#l1.701)
- def test_popitem(self):
d = self._empty_mapping()[](#l1.704)self.assertRaises(KeyError, d.popitem)[](#l1.705)
- - -@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):[](#l1.713)pass[](#l1.714)cls.type2test = MyOrderedDict[](#l1.715)
- def test_popitem(self):
d = self._empty_mapping()[](#l1.718)self.assertRaises(KeyError, d.popitem)[](#l1.719)
- - -################################################################################
Run tests
################################################################################ -import doctest, collections - def test_main(verbose=None): NamedTupleDocs = doctest.DocTestSuite(module=collections) test_classes = [TestNamedTuple, NamedTupleDocs, TestOneTrickPonyABCs, TestCollectionABCs, TestCounter, TestChainMap,
PurePythonOrderedDictTests, CPythonOrderedDictTests,[](#l1.732)PurePythonOrderedDictSubclassTests,[](#l1.733)CPythonOrderedDictSubclassTests,[](#l1.734)PurePythonGeneralMappingTests, CPythonGeneralMappingTests,[](#l1.735)
support.run_unittest(*test_classes)PurePythonSubclassMappingTests, CPythonSubclassMappingTests,[](#l1.736) TestUserObjects,[](#l1.737) ][](#l1.738)
copy from Lib/test/test_collections.py copy to Lib/test/test_ordered_dict.py --- a/Lib/test/test_collections.py +++ b/Lib/test/test_ordered_dict.py @@ -1,1631 +1,15 @@ -"""Unit tests for collections.py.""" - -import unittest, doctest, operator -from test.support import TESTFN, forget, unlink, import_fresh_module import contextlib -import inspect -from test import support -from collections import namedtuple, Counter, OrderedDict, _count_elements -from test import mapping_tests -import pickle, copy +import copy +import pickle from random import randrange, shuffle -import keyword -import re import sys -import types -from collections import UserDict, UserString, UserList -from collections import ChainMap -from collections import deque -from collections.abc import Awaitable, Coroutine, AsyncIterator, AsyncIterable -from collections.abc import Hashable, Iterable, Iterator, Generator -from collections.abc import Sized, Container, Callable -from collections.abc import Set, MutableSet -from collections.abc import Mapping, MutableMapping, KeysView, ItemsView -from collections.abc import Sequence, MutableSequence -from collections.abc import ByteString - - -class TestUserObjects(unittest.TestCase):
- def _superset_test(self, a, b):
self.assertGreaterEqual([](#l2.37)set(dir(a)),[](#l2.38)set(dir(b)),[](#l2.39)'{a} should have all the methods of {b}'.format([](#l2.40)a=a.__name__,[](#l2.41)b=b.__name__,[](#l2.42)),[](#l2.43))[](#l2.44)- def test_str_protocol(self):
self._superset_test(UserString, str)[](#l2.46)
- - -################################################################################ -### ChainMap (helper class for configparser and the string module) -################################################################################ - -class TestChainMap(unittest.TestCase): -
- def test_basics(self):
c = ChainMap()[](#l2.62)c['a'] = 1[](#l2.63)c['b'] = 2[](#l2.64)d = c.new_child()[](#l2.65)d['b'] = 20[](#l2.66)d['c'] = 30[](#l2.67)self.assertEqual(d.maps, [{'b':20, 'c':30}, {'a':1, 'b':2}]) # check internal state[](#l2.68)self.assertEqual(d.items(), dict(a=1, b=20, c=30).items()) # check items/iter/getitem[](#l2.69)self.assertEqual(len(d), 3) # check len[](#l2.70)for key in 'abc': # check contains[](#l2.71)self.assertIn(key, d)[](#l2.72)for k, v in dict(a=1, b=20, c=30, z=100).items(): # check get[](#l2.73)self.assertEqual(d.get(k, 100), v)[](#l2.74)
del d['b'] # unmask a value[](#l2.76)self.assertEqual(d.maps, [{'c':30}, {'a':1, 'b':2}]) # check internal state[](#l2.77)self.assertEqual(d.items(), dict(a=1, b=2, c=30).items()) # check items/iter/getitem[](#l2.78)self.assertEqual(len(d), 3) # check len[](#l2.79)for key in 'abc': # check contains[](#l2.80)self.assertIn(key, d)[](#l2.81)for k, v in dict(a=1, b=2, c=30, z=100).items(): # check get[](#l2.82)self.assertEqual(d.get(k, 100), v)[](#l2.83)self.assertIn(repr(d), [ # check repr[](#l2.84)type(d).__name__ + "({'c': 30}, {'a': 1, 'b': 2})",[](#l2.85)type(d).__name__ + "({'c': 30}, {'b': 2, 'a': 1})"[](#l2.86)])[](#l2.87)
for e in d.copy(), copy.copy(d): # check shallow copies[](#l2.89)self.assertEqual(d, e)[](#l2.90)self.assertEqual(d.maps, e.maps)[](#l2.91)self.assertIsNot(d, e)[](#l2.92)self.assertIsNot(d.maps[0], e.maps[0])[](#l2.93)for m1, m2 in zip(d.maps[1:], e.maps[1:]):[](#l2.94)self.assertIs(m1, m2)[](#l2.95)
# check deep copies[](#l2.97)for proto in range(pickle.HIGHEST_PROTOCOL + 1):[](#l2.98)e = pickle.loads(pickle.dumps(d, proto))[](#l2.99)self.assertEqual(d, e)[](#l2.100)self.assertEqual(d.maps, e.maps)[](#l2.101)self.assertIsNot(d, e)[](#l2.102)for m1, m2 in zip(d.maps, e.maps):[](#l2.103)self.assertIsNot(m1, m2, e)[](#l2.104)for e in [copy.deepcopy(d),[](#l2.105)eval(repr(d))[](#l2.106)]:[](#l2.107)self.assertEqual(d, e)[](#l2.108)self.assertEqual(d.maps, e.maps)[](#l2.109)self.assertIsNot(d, e)[](#l2.110)for m1, m2 in zip(d.maps, e.maps):[](#l2.111)self.assertIsNot(m1, m2, e)[](#l2.112)
f = d.new_child()[](#l2.114)f['b'] = 5[](#l2.115)self.assertEqual(f.maps, [{'b': 5}, {'c':30}, {'a':1, 'b':2}])[](#l2.116)self.assertEqual(f.parents.maps, [{'c':30}, {'a':1, 'b':2}]) # check parents[](#l2.117)self.assertEqual(f['b'], 5) # find first in chain[](#l2.118)self.assertEqual(f.parents['b'], 2) # look beyond maps[0][](#l2.119)
- def test_contructor(self):
self.assertEqual(ChainMap().maps, [{}]) # no-args --> one new dict[](#l2.122)self.assertEqual(ChainMap({1:2}).maps, [{1:2}]) # 1 arg --> list[](#l2.123)
- def test_bool(self):
self.assertFalse(ChainMap())[](#l2.126)self.assertFalse(ChainMap({}, {}))[](#l2.127)self.assertTrue(ChainMap({1:2}, {}))[](#l2.128)self.assertTrue(ChainMap({}, {1:2}))[](#l2.129)
- def test_missing(self):
class DefaultChainMap(ChainMap):[](#l2.132)def __missing__(self, key):[](#l2.133)return 999[](#l2.134)d = DefaultChainMap(dict(a=1, b=2), dict(b=20, c=30))[](#l2.135)for k, v in dict(a=1, b=2, c=30, d=999).items():[](#l2.136)self.assertEqual(d[k], v) # check __getitem__ w/missing[](#l2.137)for k, v in dict(a=1, b=2, c=30, d=77).items():[](#l2.138)self.assertEqual(d.get(k, 77), v) # check get() w/ missing[](#l2.139)for k, v in dict(a=True, b=True, c=True, d=False).items():[](#l2.140)self.assertEqual(k in d, v) # check __contains__ w/missing[](#l2.141)self.assertEqual(d.pop('a', 1001), 1, d)[](#l2.142)self.assertEqual(d.pop('a', 1002), 1002) # check pop() w/missing[](#l2.143)self.assertEqual(d.popitem(), ('b', 2)) # check popitem() w/missing[](#l2.144)with self.assertRaises(KeyError):[](#l2.145)d.popitem()[](#l2.146)
- def test_dict_coercion(self):
d = ChainMap(dict(a=1, b=2), dict(b=20, c=30))[](#l2.149)self.assertEqual(dict(d), dict(a=1, b=2, c=30))[](#l2.150)self.assertEqual(dict(d.items()), dict(a=1, b=2, c=30))[](#l2.151)
- def test_new_child(self):
'Tests for changes for issue #16613.'[](#l2.154)c = ChainMap()[](#l2.155)c['a'] = 1[](#l2.156)c['b'] = 2[](#l2.157)m = {'b':20, 'c': 30}[](#l2.158)d = c.new_child(m)[](#l2.159)self.assertEqual(d.maps, [{'b':20, 'c':30}, {'a':1, 'b':2}]) # check internal state[](#l2.160)self.assertIs(m, d.maps[0])[](#l2.161)
# Use a different map than a dict[](#l2.163)class lowerdict(dict):[](#l2.164)def __getitem__(self, key):[](#l2.165)if isinstance(key, str):[](#l2.166)key = key.lower()[](#l2.167)return dict.__getitem__(self, key)[](#l2.168)def __contains__(self, key):[](#l2.169)if isinstance(key, str):[](#l2.170)key = key.lower()[](#l2.171)return dict.__contains__(self, key)[](#l2.172)
c = ChainMap()[](#l2.174)c['a'] = 1[](#l2.175)c['b'] = 2[](#l2.176)m = lowerdict(b=20, c=30)[](#l2.177)d = c.new_child(m)[](#l2.178)self.assertIs(m, d.maps[0])[](#l2.179)for key in 'abc': # check contains[](#l2.180)self.assertIn(key, d)[](#l2.181)for k, v in dict(a=1, B=20, C=30, z=100).items(): # check get[](#l2.182)self.assertEqual(d.get(k, 100), v)[](#l2.183)
- - -################################################################################ -### Named Tuples -################################################################################ - -TestNT = namedtuple('TestNT', 'x y z') # type used for pickle tests - -class TestNamedTuple(unittest.TestCase): -
- def test_factory(self):
Point = namedtuple('Point', 'x y')[](#l2.195)self.assertEqual(Point.__name__, 'Point')[](#l2.196)self.assertEqual(Point.__slots__, ())[](#l2.197)self.assertEqual(Point.__module__, __name__)[](#l2.198)self.assertEqual(Point.__getitem__, tuple.__getitem__)[](#l2.199)self.assertEqual(Point._fields, ('x', 'y'))[](#l2.200)self.assertIn('class Point(tuple)', Point._source)[](#l2.201)
self.assertRaises(ValueError, namedtuple, 'abc%', 'efg ghi') # type has non-alpha char[](#l2.203)self.assertRaises(ValueError, namedtuple, 'class', 'efg ghi') # type has keyword[](#l2.204)self.assertRaises(ValueError, namedtuple, '9abc', 'efg ghi') # type starts with digit[](#l2.205)
self.assertRaises(ValueError, namedtuple, 'abc', 'efg g%hi') # field with non-alpha char[](#l2.207)self.assertRaises(ValueError, namedtuple, 'abc', 'abc class') # field has keyword[](#l2.208)self.assertRaises(ValueError, namedtuple, 'abc', '8efg 9ghi') # field starts with digit[](#l2.209)self.assertRaises(ValueError, namedtuple, 'abc', '_efg ghi') # field with leading underscore[](#l2.210)self.assertRaises(ValueError, namedtuple, 'abc', 'efg efg ghi') # duplicate field[](#l2.211)
namedtuple('Point0', 'x1 y2') # Verify that numbers are allowed in names[](#l2.213)namedtuple('_', 'a b c') # Test leading underscores in a typename[](#l2.214)
nt = namedtuple('nt', 'the quick brown fox') # check unicode input[](#l2.216)self.assertNotIn("u'", repr(nt._fields))[](#l2.217)nt = namedtuple('nt', ('the', 'quick')) # check unicode input[](#l2.218)self.assertNotIn("u'", repr(nt._fields))[](#l2.219)
self.assertRaises(TypeError, Point._make, [11]) # catch too few args[](#l2.221)self.assertRaises(TypeError, Point._make, [11, 22, 33]) # catch too many args[](#l2.222)
- @unittest.skipIf(sys.flags.optimize >= 2,
"Docstrings are omitted with -O2 and above")[](#l2.225)- def test_factory_doc_attr(self):
Point = namedtuple('Point', 'x y')[](#l2.227)self.assertEqual(Point.__doc__, 'Point(x, y)')[](#l2.228)
- @unittest.skipIf(sys.flags.optimize >= 2,
"Docstrings are omitted with -O2 and above")[](#l2.231)- def test_doc_writable(self):
Point = namedtuple('Point', 'x y')[](#l2.233)self.assertEqual(Point.x.__doc__, 'Alias for field number 0')[](#l2.234)Point.x.__doc__ = 'docstring for Point.x'[](#l2.235)self.assertEqual(Point.x.__doc__, 'docstring for Point.x')[](#l2.236)
- def test_name_fixer(self):
for spec, renamed in [[](#l2.239)[('efg', 'g%hi'), ('efg', '_1')], # field with non-alpha char[](#l2.240)[('abc', 'class'), ('abc', '_1')], # field has keyword[](#l2.241)[('8efg', '9ghi'), ('_0', '_1')], # field starts with digit[](#l2.242)[('abc', '_efg'), ('abc', '_1')], # field with leading underscore[](#l2.243)[('abc', 'efg', 'efg', 'ghi'), ('abc', 'efg', '_2', 'ghi')], # duplicate field[](#l2.244)[('abc', '', 'x'), ('abc', '_1', 'x')], # fieldname is a space[](#l2.245)]:[](#l2.246)self.assertEqual(namedtuple('NT', spec, rename=True)._fields, renamed)[](#l2.247)
- def test_instance(self):
Point = namedtuple('Point', 'x y')[](#l2.250)p = Point(11, 22)[](#l2.251)self.assertEqual(p, Point(x=11, y=22))[](#l2.252)self.assertEqual(p, Point(11, y=22))[](#l2.253)self.assertEqual(p, Point(y=22, x=11))[](#l2.254)self.assertEqual(p, Point(*(11, 22)))[](#l2.255)self.assertEqual(p, Point(**dict(x=11, y=22)))[](#l2.256)self.assertRaises(TypeError, Point, 1) # too few args[](#l2.257)self.assertRaises(TypeError, Point, 1, 2, 3) # too many args[](#l2.258)self.assertRaises(TypeError, eval, 'Point(XXX=1, y=2)', locals()) # wrong keyword argument[](#l2.259)self.assertRaises(TypeError, eval, 'Point(x=1)', locals()) # missing keyword argument[](#l2.260)self.assertEqual(repr(p), 'Point(x=11, y=22)')[](#l2.261)self.assertNotIn('__weakref__', dir(p))[](#l2.262)self.assertEqual(p, Point._make([11, 22])) # test _make classmethod[](#l2.263)self.assertEqual(p._fields, ('x', 'y')) # test _fields attribute[](#l2.264)self.assertEqual(p._replace(x=1), (1, 22)) # test _replace method[](#l2.265)self.assertEqual(p._asdict(), dict(x=11, y=22)) # test _asdict method[](#l2.266)
try:[](#l2.268)p._replace(x=1, error=2)[](#l2.269)except ValueError:[](#l2.270)pass[](#l2.271)else:[](#l2.272)self._fail('Did not detect an incorrect fieldname')[](#l2.273)
# verify that field string can have commas[](#l2.275)Point = namedtuple('Point', 'x, y')[](#l2.276)p = Point(x=11, y=22)[](#l2.277)self.assertEqual(repr(p), 'Point(x=11, y=22)')[](#l2.278)
# verify that fieldspec can be a non-string sequence[](#l2.280)Point = namedtuple('Point', ('x', 'y'))[](#l2.281)p = Point(x=11, y=22)[](#l2.282)self.assertEqual(repr(p), 'Point(x=11, y=22)')[](#l2.283)
- def test_tupleness(self):
Point = namedtuple('Point', 'x y')[](#l2.286)p = Point(11, 22)[](#l2.287)
self.assertIsInstance(p, tuple)[](#l2.289)self.assertEqual(p, (11, 22)) # matches a real tuple[](#l2.290)self.assertEqual(tuple(p), (11, 22)) # coercable to a real tuple[](#l2.291)self.assertEqual(list(p), [11, 22]) # coercable to a list[](#l2.292)self.assertEqual(max(p), 22) # iterable[](#l2.293)self.assertEqual(max(*p), 22) # star-able[](#l2.294)x, y = p[](#l2.295)self.assertEqual(p, (x, y)) # unpacks like a tuple[](#l2.296)self.assertEqual((p[0], p[1]), (11, 22)) # indexable like a tuple[](#l2.297)self.assertRaises(IndexError, p.__getitem__, 3)[](#l2.298)
self.assertEqual(p.x, x)[](#l2.300)self.assertEqual(p.y, y)[](#l2.301)self.assertRaises(AttributeError, eval, 'p.z', locals())[](#l2.302)
- def test_odd_sizes(self):
Zero = namedtuple('Zero', '')[](#l2.305)self.assertEqual(Zero(), ())[](#l2.306)self.assertEqual(Zero._make([]), ())[](#l2.307)self.assertEqual(repr(Zero()), 'Zero()')[](#l2.308)self.assertEqual(Zero()._asdict(), {})[](#l2.309)self.assertEqual(Zero()._fields, ())[](#l2.310)
Dot = namedtuple('Dot', 'd')[](#l2.312)self.assertEqual(Dot(1), (1,))[](#l2.313)self.assertEqual(Dot._make([1]), (1,))[](#l2.314)self.assertEqual(Dot(1).d, 1)[](#l2.315)self.assertEqual(repr(Dot(1)), 'Dot(d=1)')[](#l2.316)self.assertEqual(Dot(1)._asdict(), {'d':1})[](#l2.317)self.assertEqual(Dot(1)._replace(d=999), (999,))[](#l2.318)self.assertEqual(Dot(1)._fields, ('d',))[](#l2.319)
# n = 5000[](#l2.321)n = 254 # SyntaxError: more than 255 arguments:[](#l2.322)import string, random[](#l2.323)names = list(set(''.join([random.choice(string.ascii_letters)[](#l2.324)for j in range(10)]) for i in range(n)))[](#l2.325)n = len(names)[](#l2.326)Big = namedtuple('Big', names)[](#l2.327)b = Big(*range(n))[](#l2.328)self.assertEqual(b, tuple(range(n)))[](#l2.329)self.assertEqual(Big._make(range(n)), tuple(range(n)))[](#l2.330)for pos, name in enumerate(names):[](#l2.331)self.assertEqual(getattr(b, name), pos)[](#l2.332)repr(b) # make sure repr() doesn't blow-up[](#l2.333)d = b._asdict()[](#l2.334)d_expected = dict(zip(names, range(n)))[](#l2.335)self.assertEqual(d, d_expected)[](#l2.336)b2 = b._replace(**dict([(names[1], 999),(names[-5], 42)]))[](#l2.337)b2_expected = list(range(n))[](#l2.338)b2_expected[1] = 999[](#l2.339)b2_expected[-5] = 42[](#l2.340)self.assertEqual(b2, tuple(b2_expected))[](#l2.341)self.assertEqual(b._fields, tuple(names))[](#l2.342)
- def test_pickle(self):
p = TestNT(x=10, y=20, z=30)[](#l2.345)for module in (pickle,):[](#l2.346)loads = getattr(module, 'loads')[](#l2.347)dumps = getattr(module, 'dumps')[](#l2.348)for protocol in range(-1, module.HIGHEST_PROTOCOL + 1):[](#l2.349)q = loads(dumps(p, protocol))[](#l2.350)self.assertEqual(p, q)[](#l2.351)self.assertEqual(p._fields, q._fields)[](#l2.352)self.assertNotIn(b'OrderedDict', dumps(p, protocol))[](#l2.353)
- def test_copy(self):
p = TestNT(x=10, y=20, z=30)[](#l2.356)for copier in copy.copy, copy.deepcopy:[](#l2.357)q = copier(p)[](#l2.358)self.assertEqual(p, q)[](#l2.359)self.assertEqual(p._fields, q._fields)[](#l2.360)
- def test_name_conflicts(self):
# Some names like "self", "cls", "tuple", "itemgetter", and "property"[](#l2.363)# failed when used as field names. Test to make sure these now work.[](#l2.364)T = namedtuple('T', 'itemgetter property self cls tuple')[](#l2.365)t = T(1, 2, 3, 4, 5)[](#l2.366)self.assertEqual(t, (1,2,3,4,5))[](#l2.367)newt = t._replace(itemgetter=10, property=20, self=30, cls=40, tuple=50)[](#l2.368)self.assertEqual(newt, (10,20,30,40,50))[](#l2.369)
# Broader test of all interesting names in a template[](#l2.371)with support.captured_stdout() as template:[](#l2.372)T = namedtuple('T', 'x', verbose=True)[](#l2.373)words = set(re.findall('[A-Za-z]+', template.getvalue()))[](#l2.374)words -= set(keyword.kwlist)[](#l2.375)T = namedtuple('T', words)[](#l2.376)# test __new__[](#l2.377)values = tuple(range(len(words)))[](#l2.378)t = T(*values)[](#l2.379)self.assertEqual(t, values)[](#l2.380)t = T(**dict(zip(T._fields, values)))[](#l2.381)self.assertEqual(t, values)[](#l2.382)# test _make[](#l2.383)t = T._make(values)[](#l2.384)self.assertEqual(t, values)[](#l2.385)# exercise __repr__[](#l2.386)repr(t)[](#l2.387)# test _asdict[](#l2.388)self.assertEqual(t._asdict(), dict(zip(T._fields, values)))[](#l2.389)# test _replace[](#l2.390)t = T._make(values)[](#l2.391)newvalues = tuple(v*10 for v in values)[](#l2.392)newt = t._replace(**dict(zip(T._fields, newvalues)))[](#l2.393)self.assertEqual(newt, newvalues)[](#l2.394)# test _fields[](#l2.395)self.assertEqual(T._fields, tuple(words))[](#l2.396)# test __getnewargs__[](#l2.397)self.assertEqual(t.__getnewargs__(), values)[](#l2.398)
- def test_repr(self):
with support.captured_stdout() as template:[](#l2.401)A = namedtuple('A', 'x', verbose=True)[](#l2.402)self.assertEqual(repr(A(1)), 'A(x=1)')[](#l2.403)# repr should show the name of the subclass[](#l2.404)class B(A):[](#l2.405)pass[](#l2.406)self.assertEqual(repr(B(1)), 'B(x=1)')[](#l2.407)
- def test_source(self):
# verify that _source can be run through exec()[](#l2.410)tmp = namedtuple('NTColor', 'red green blue')[](#l2.411)globals().pop('NTColor', None) # remove artifacts from other tests[](#l2.412)exec(tmp._source, globals())[](#l2.413)self.assertIn('NTColor', globals())[](#l2.414)c = NTColor(10, 20, 30)[](#l2.415)self.assertEqual((c.red, c.green, c.blue), (10, 20, 30))[](#l2.416)self.assertEqual(NTColor._fields, ('red', 'green', 'blue'))[](#l2.417)globals().pop('NTColor', None) # clean-up after this test[](#l2.418)
- def test_namedtuple_subclass_issue_24931(self):
class Point(namedtuple('_Point', ['x', 'y'])):[](#l2.422)pass[](#l2.423)
a = Point(3, 4)[](#l2.425)self.assertEqual(a._asdict(), OrderedDict([('x', 3), ('y', 4)]))[](#l2.426)
a.w = 5[](#l2.428)self.assertEqual(a.__dict__, {'w': 5})[](#l2.429)
+import unittest +from collections.abc import MutableMapping +from test import mapping_tests, support -################################################################################ -### Abstract Base Classes -################################################################################ - -class ABCTestCase(unittest.TestCase): -
- def validate_abstract_methods(self, abc, *names):
methodstubs = dict.fromkeys(names, lambda s, *args: 0)[](#l2.442)
# everything should work will all required methods are present[](#l2.444)C = type('C', (abc,), methodstubs)[](#l2.445)C()[](#l2.446)
# instantiation should fail if a required method is missing[](#l2.448)for name in names:[](#l2.449)stubs = methodstubs.copy()[](#l2.450)del stubs[name][](#l2.451)C = type('C', (abc,), stubs)[](#l2.452)self.assertRaises(TypeError, C, name)[](#l2.453)
C = type('C', (object,), {'__hash__': None})[](#l2.458)setattr(C, name, stub)[](#l2.459)self.assertIsInstance(C(), abc)[](#l2.460)self.assertTrue(issubclass(C, abc))[](#l2.461)
C = type('C', (object,), {'__hash__': None})[](#l2.463)self.assertNotIsInstance(C(), abc)[](#l2.464)self.assertFalse(issubclass(C, abc))[](#l2.465)
- def validate_comparison(self, instance):
ops = ['lt', 'gt', 'le', 'ge', 'ne', 'or', 'and', 'xor', 'sub'][](#l2.468)operators = {}[](#l2.469)for op in ops:[](#l2.470)name = '__' + op + '__'[](#l2.471)operators[name] = getattr(operator, name)[](#l2.472)
class Other:[](#l2.474)def __init__(self):[](#l2.475)self.right_side = False[](#l2.476)def __eq__(self, other):[](#l2.477)self.right_side = True[](#l2.478)return True[](#l2.479)__lt__ = __eq__[](#l2.480)__gt__ = __eq__[](#l2.481)__le__ = __eq__[](#l2.482)__ge__ = __eq__[](#l2.483)__ne__ = __eq__[](#l2.484)__ror__ = __eq__[](#l2.485)__rand__ = __eq__[](#l2.486)__rxor__ = __eq__[](#l2.487)__rsub__ = __eq__[](#l2.488)
for name, op in operators.items():[](#l2.490)if not hasattr(instance, name):[](#l2.491)continue[](#l2.492)other = Other()[](#l2.493)op(instance, other)[](#l2.494)self.assertTrue(other.right_side,'Right side not called for %s.%s'[](#l2.495)% (type(instance), name))[](#l2.496)
- -class TestOneTrickPonyABCs(ABCTestCase): -
@types.coroutine[](#l2.504)def coro():[](#l2.505)yield[](#l2.506)
async def new_coro():[](#l2.508)pass[](#l2.509)
class Bar:[](#l2.511)def __await__(self):[](#l2.512)yield[](#l2.513)
class MinimalCoro(Coroutine):[](#l2.515)def send(self, value):[](#l2.516)return value[](#l2.517)def throw(self, typ, val=None, tb=None):[](#l2.518)super().throw(typ, val, tb)[](#l2.519)def __await__(self):[](#l2.520)yield[](#l2.521)
non_samples = [None, int(), gen(), object()][](#l2.523)for x in non_samples:[](#l2.524)self.assertNotIsInstance(x, Awaitable)[](#l2.525)self.assertFalse(issubclass(type(x), Awaitable), repr(type(x)))[](#l2.526)
samples = [Bar(), MinimalCoro()][](#l2.528)for x in samples:[](#l2.529)self.assertIsInstance(x, Awaitable)[](#l2.530)self.assertTrue(issubclass(type(x), Awaitable))[](#l2.531)
c = coro()[](#l2.533)# Iterable coroutines (generators with CO_ITERABLE_COROUTINE[](#l2.534)# flag don't have '__await__' method, hence can't be instances[](#l2.535)# of Awaitable. Use inspect.isawaitable to detect them.[](#l2.536)self.assertNotIsInstance(c, Awaitable)[](#l2.537)
c = new_coro()[](#l2.539)self.assertIsInstance(c, Awaitable)[](#l2.540)c.close() # awoid RuntimeWarning that coro() was not awaited[](#l2.541)
class CoroLike: pass[](#l2.543)Coroutine.register(CoroLike)[](#l2.544)self.assertTrue(isinstance(CoroLike(), Awaitable))[](#l2.545)self.assertTrue(issubclass(CoroLike, Awaitable))[](#l2.546)CoroLike = None[](#l2.547)support.gc_collect() # Kill CoroLike to clean-up ABCMeta cache[](#l2.548)
@types.coroutine[](#l2.554)def coro():[](#l2.555)yield[](#l2.556)
async def new_coro():[](#l2.558)pass[](#l2.559)
class Bar:[](#l2.561)def __await__(self):[](#l2.562)yield[](#l2.563)
class MinimalCoro(Coroutine):[](#l2.565)def send(self, value):[](#l2.566)return value[](#l2.567)def throw(self, typ, val=None, tb=None):[](#l2.568)super().throw(typ, val, tb)[](#l2.569)def __await__(self):[](#l2.570)yield[](#l2.571)
non_samples = [None, int(), gen(), object(), Bar()][](#l2.573)for x in non_samples:[](#l2.574)self.assertNotIsInstance(x, Coroutine)[](#l2.575)self.assertFalse(issubclass(type(x), Coroutine), repr(type(x)))[](#l2.576)
samples = [MinimalCoro()][](#l2.578)for x in samples:[](#l2.579)self.assertIsInstance(x, Awaitable)[](#l2.580)self.assertTrue(issubclass(type(x), Awaitable))[](#l2.581)
c = coro()[](#l2.583)# Iterable coroutines (generators with CO_ITERABLE_COROUTINE[](#l2.584)# flag don't have '__await__' method, hence can't be instances[](#l2.585)# of Coroutine. Use inspect.isawaitable to detect them.[](#l2.586)self.assertNotIsInstance(c, Coroutine)[](#l2.587)
c = new_coro()[](#l2.589)self.assertIsInstance(c, Coroutine)[](#l2.590)c.close() # awoid RuntimeWarning that coro() was not awaited[](#l2.591)
class CoroLike:[](#l2.593)def send(self, value):[](#l2.594)pass[](#l2.595)def throw(self, typ, val=None, tb=None):[](#l2.596)pass[](#l2.597)def close(self):[](#l2.598)pass[](#l2.599)def __await__(self):[](#l2.600)pass[](#l2.601)self.assertTrue(isinstance(CoroLike(), Coroutine))[](#l2.602)self.assertTrue(issubclass(CoroLike, Coroutine))[](#l2.603)
class CoroLike:[](#l2.605)def send(self, value):[](#l2.606)pass[](#l2.607)def close(self):[](#l2.608)pass[](#l2.609)def __await__(self):[](#l2.610)pass[](#l2.611)self.assertFalse(isinstance(CoroLike(), Coroutine))[](#l2.612)self.assertFalse(issubclass(CoroLike, Coroutine))[](#l2.613)
- def test_Hashable(self):
# Check some non-hashables[](#l2.616)non_samples = [bytearray(), list(), set(), dict()][](#l2.617)for x in non_samples:[](#l2.618)self.assertNotIsInstance(x, Hashable)[](#l2.619)self.assertFalse(issubclass(type(x), Hashable), repr(type(x)))[](#l2.620)# Check some hashables[](#l2.621)samples = [None,[](#l2.622)int(), float(), complex(),[](#l2.623)str(),[](#l2.624)tuple(), frozenset(),[](#l2.625)int, list, object, type, bytes()[](#l2.626)][](#l2.627)for x in samples:[](#l2.628)self.assertIsInstance(x, Hashable)[](#l2.629)self.assertTrue(issubclass(type(x), Hashable), repr(type(x)))[](#l2.630)self.assertRaises(TypeError, Hashable)[](#l2.631)# Check direct subclassing[](#l2.632)class H(Hashable):[](#l2.633)def __hash__(self):[](#l2.634)return super().__hash__()[](#l2.635)self.assertEqual(hash(H()), 0)[](#l2.636)self.assertFalse(issubclass(int, H))[](#l2.637)self.validate_abstract_methods(Hashable, '__hash__')[](#l2.638)self.validate_isinstance(Hashable, '__hash__')[](#l2.639)
- def test_AsyncIterable(self):
class AI:[](#l2.642)async def __aiter__(self):[](#l2.643)return self[](#l2.644)self.assertTrue(isinstance(AI(), AsyncIterable))[](#l2.645)self.assertTrue(issubclass(AI, AsyncIterable))[](#l2.646)# Check some non-iterables[](#l2.647)non_samples = [None, object, []][](#l2.648)for x in non_samples:[](#l2.649)self.assertNotIsInstance(x, AsyncIterable)[](#l2.650)self.assertFalse(issubclass(type(x), AsyncIterable), repr(type(x)))[](#l2.651)self.validate_abstract_methods(AsyncIterable, '__aiter__')[](#l2.652)self.validate_isinstance(AsyncIterable, '__aiter__')[](#l2.653)
- def test_AsyncIterator(self):
class AI:[](#l2.656)async def __aiter__(self):[](#l2.657)return self[](#l2.658)async def __anext__(self):[](#l2.659)raise StopAsyncIteration[](#l2.660)self.assertTrue(isinstance(AI(), AsyncIterator))[](#l2.661)self.assertTrue(issubclass(AI, AsyncIterator))[](#l2.662)non_samples = [None, object, []][](#l2.663)# Check some non-iterables[](#l2.664)for x in non_samples:[](#l2.665)self.assertNotIsInstance(x, AsyncIterator)[](#l2.666)self.assertFalse(issubclass(type(x), AsyncIterator), repr(type(x)))[](#l2.667)# Similarly to regular iterators (see issue 10565)[](#l2.668)class AnextOnly:[](#l2.669)async def __anext__(self):[](#l2.670)raise StopAsyncIteration[](#l2.671)self.assertNotIsInstance(AnextOnly(), AsyncIterator)[](#l2.672)self.validate_abstract_methods(AsyncIterator, '__anext__', '__aiter__')[](#l2.673)
- def test_Iterable(self):
# Check some non-iterables[](#l2.676)non_samples = [None, 42, 3.14, 1j][](#l2.677)for x in non_samples:[](#l2.678)self.assertNotIsInstance(x, Iterable)[](#l2.679)self.assertFalse(issubclass(type(x), Iterable), repr(type(x)))[](#l2.680)# Check some iterables[](#l2.681)samples = [bytes(), str(),[](#l2.682)tuple(), list(), set(), frozenset(), dict(),[](#l2.683)dict().keys(), dict().items(), dict().values(),[](#l2.684)(lambda: (yield))(),[](#l2.685)(x for x in []),[](#l2.686)][](#l2.687)for x in samples:[](#l2.688)self.assertIsInstance(x, Iterable)[](#l2.689)self.assertTrue(issubclass(type(x), Iterable), repr(type(x)))[](#l2.690)# Check direct subclassing[](#l2.691)class I(Iterable):[](#l2.692)def __iter__(self):[](#l2.693)return super().__iter__()[](#l2.694)self.assertEqual(list(I()), [])[](#l2.695)self.assertFalse(issubclass(str, I))[](#l2.696)self.validate_abstract_methods(Iterable, '__iter__')[](#l2.697)self.validate_isinstance(Iterable, '__iter__')[](#l2.698)
- def test_Iterator(self):
non_samples = [None, 42, 3.14, 1j, b"", "", (), [], {}, set()][](#l2.701)for x in non_samples:[](#l2.702)self.assertNotIsInstance(x, Iterator)[](#l2.703)self.assertFalse(issubclass(type(x), Iterator), repr(type(x)))[](#l2.704)samples = [iter(bytes()), iter(str()),[](#l2.705)iter(tuple()), iter(list()), iter(dict()),[](#l2.706)iter(set()), iter(frozenset()),[](#l2.707)iter(dict().keys()), iter(dict().items()),[](#l2.708)iter(dict().values()),[](#l2.709)(lambda: (yield))(),[](#l2.710)(x for x in []),[](#l2.711)][](#l2.712)for x in samples:[](#l2.713)self.assertIsInstance(x, Iterator)[](#l2.714)self.assertTrue(issubclass(type(x), Iterator), repr(type(x)))[](#l2.715)self.validate_abstract_methods(Iterator, '__next__', '__iter__')[](#l2.716)
# Issue 10565[](#l2.718)class NextOnly:[](#l2.719)def __next__(self):[](#l2.720)yield 1[](#l2.721)return[](#l2.722)self.assertNotIsInstance(NextOnly(), Iterator)[](#l2.723)
- def test_Generator(self):
class NonGen1:[](#l2.726)def __iter__(self): return self[](#l2.727)def __next__(self): return None[](#l2.728)def close(self): pass[](#l2.729)def throw(self, typ, val=None, tb=None): pass[](#l2.730)
class NonGen2:[](#l2.732)def __iter__(self): return self[](#l2.733)def __next__(self): return None[](#l2.734)def close(self): pass[](#l2.735)def send(self, value): return value[](#l2.736)
class NonGen3:[](#l2.738)def close(self): pass[](#l2.739)def send(self, value): return value[](#l2.740)def throw(self, typ, val=None, tb=None): pass[](#l2.741)
non_samples = [[](#l2.743)None, 42, 3.14, 1j, b"", "", (), [], {}, set(),[](#l2.744)iter(()), iter([]), NonGen1(), NonGen2(), NonGen3()][](#l2.745)for x in non_samples:[](#l2.746)self.assertNotIsInstance(x, Generator)[](#l2.747)self.assertFalse(issubclass(type(x), Generator), repr(type(x)))[](#l2.748)
class Gen:[](#l2.750)def __iter__(self): return self[](#l2.751)def __next__(self): return None[](#l2.752)def close(self): pass[](#l2.753)def send(self, value): return value[](#l2.754)def throw(self, typ, val=None, tb=None): pass[](#l2.755)
class MinimalGen(Generator):[](#l2.757)def send(self, value):[](#l2.758)return value[](#l2.759)def throw(self, typ, val=None, tb=None):[](#l2.760)super().throw(typ, val, tb)[](#l2.761)
def gen():[](#l2.763)yield 1[](#l2.764)
samples = [gen(), (lambda: (yield))(), Gen(), MinimalGen()][](#l2.766)for x in samples:[](#l2.767)self.assertIsInstance(x, Iterator)[](#l2.768)self.assertIsInstance(x, Generator)[](#l2.769)self.assertTrue(issubclass(type(x), Generator), repr(type(x)))[](#l2.770)self.validate_abstract_methods(Generator, 'send', 'throw')[](#l2.771)
# mixin tests[](#l2.773)mgen = MinimalGen()[](#l2.774)self.assertIs(mgen, iter(mgen))[](#l2.775)self.assertIs(mgen.send(None), next(mgen))[](#l2.776)self.assertEqual(2, mgen.send(2))[](#l2.777)self.assertIsNone(mgen.close())[](#l2.778)self.assertRaises(ValueError, mgen.throw, ValueError)[](#l2.779)self.assertRaisesRegex(ValueError, "^huhu$",[](#l2.780)mgen.throw, ValueError, ValueError("huhu"))[](#l2.781)self.assertRaises(StopIteration, mgen.throw, StopIteration())[](#l2.782)
class FailOnClose(Generator):[](#l2.784)def send(self, value): return value[](#l2.785)def throw(self, *args): raise ValueError[](#l2.786)
self.assertRaises(ValueError, FailOnClose().close)[](#l2.788)
class IgnoreGeneratorExit(Generator):[](#l2.790)def send(self, value): return value[](#l2.791)def throw(self, *args): pass[](#l2.792)
self.assertRaises(RuntimeError, IgnoreGeneratorExit().close)[](#l2.794)
- def test_Sized(self):
non_samples = [None, 42, 3.14, 1j,[](#l2.797)(lambda: (yield))(),[](#l2.798)(x for x in []),[](#l2.799)][](#l2.800)for x in non_samples:[](#l2.801)self.assertNotIsInstance(x, Sized)[](#l2.802)self.assertFalse(issubclass(type(x), Sized), repr(type(x)))[](#l2.803)samples = [bytes(), str(),[](#l2.804)tuple(), list(), set(), frozenset(), dict(),[](#l2.805)dict().keys(), dict().items(), dict().values(),[](#l2.806)][](#l2.807)for x in samples:[](#l2.808)self.assertIsInstance(x, Sized)[](#l2.809)self.assertTrue(issubclass(type(x), Sized), repr(type(x)))[](#l2.810)self.validate_abstract_methods(Sized, '__len__')[](#l2.811)self.validate_isinstance(Sized, '__len__')[](#l2.812)
- def test_Container(self):
non_samples = [None, 42, 3.14, 1j,[](#l2.815)(lambda: (yield))(),[](#l2.816)(x for x in []),[](#l2.817)][](#l2.818)for x in non_samples:[](#l2.819)self.assertNotIsInstance(x, Container)[](#l2.820)self.assertFalse(issubclass(type(x), Container), repr(type(x)))[](#l2.821)samples = [bytes(), str(),[](#l2.822)tuple(), list(), set(), frozenset(), dict(),[](#l2.823)dict().keys(), dict().items(),[](#l2.824)][](#l2.825)for x in samples:[](#l2.826)self.assertIsInstance(x, Container)[](#l2.827)self.assertTrue(issubclass(type(x), Container), repr(type(x)))[](#l2.828)self.validate_abstract_methods(Container, '__contains__')[](#l2.829)self.validate_isinstance(Container, '__contains__')[](#l2.830)
- def test_Callable(self):
non_samples = [None, 42, 3.14, 1j,[](#l2.833)"", b"", (), [], {}, set(),[](#l2.834)(lambda: (yield))(),[](#l2.835)(x for x in []),[](#l2.836)][](#l2.837)for x in non_samples:[](#l2.838)self.assertNotIsInstance(x, Callable)[](#l2.839)self.assertFalse(issubclass(type(x), Callable), repr(type(x)))[](#l2.840)samples = [lambda: None,[](#l2.841)type, int, object,[](#l2.842)len,[](#l2.843)list.append, [].append,[](#l2.844)][](#l2.845)for x in samples:[](#l2.846)self.assertIsInstance(x, Callable)[](#l2.847)self.assertTrue(issubclass(type(x), Callable), repr(type(x)))[](#l2.848)self.validate_abstract_methods(Callable, '__call__')[](#l2.849)self.validate_isinstance(Callable, '__call__')[](#l2.850)
- def test_direct_subclassing(self):
for B in Hashable, Iterable, Iterator, Sized, Container, Callable:[](#l2.853)class C(B):[](#l2.854)pass[](#l2.855)self.assertTrue(issubclass(C, B))[](#l2.856)self.assertFalse(issubclass(int, C))[](#l2.857)
- def test_registration(self):
for B in Hashable, Iterable, Iterator, Sized, Container, Callable:[](#l2.860)class C:[](#l2.861)__hash__ = None # Make sure it isn't hashable by default[](#l2.862)self.assertFalse(issubclass(C, B), B.__name__)[](#l2.863)B.register(C)[](#l2.864)self.assertTrue(issubclass(C, B))[](#l2.865)
- -class WithSet(MutableSet): -
- -class TestCollectionABCs(ABCTestCase): -
XXX For now, we only test some virtual inheritance properties.
We should also test the proper behavior of the collection ABCs
as real base classes or mix-in classes.
- def test_Set(self):
for sample in [set, frozenset]:[](#l2.894)self.assertIsInstance(sample(), Set)[](#l2.895)self.assertTrue(issubclass(sample, Set))[](#l2.896)self.validate_abstract_methods(Set, '__contains__', '__iter__', '__len__')[](#l2.897)class MySet(Set):[](#l2.898)def __contains__(self, x):[](#l2.899)return False[](#l2.900)def __len__(self):[](#l2.901)return 0[](#l2.902)def __iter__(self):[](#l2.903)return iter([])[](#l2.904)self.validate_comparison(MySet())[](#l2.905)
- def test_hash_Set(self):
class OneTwoThreeSet(Set):[](#l2.908)def __init__(self):[](#l2.909)self.contents = [1, 2, 3][](#l2.910)def __contains__(self, x):[](#l2.911)return x in self.contents[](#l2.912)def __len__(self):[](#l2.913)return len(self.contents)[](#l2.914)def __iter__(self):[](#l2.915)return iter(self.contents)[](#l2.916)def __hash__(self):[](#l2.917)return self._hash()[](#l2.918)a, b = OneTwoThreeSet(), OneTwoThreeSet()[](#l2.919)self.assertTrue(hash(a) == hash(b))[](#l2.920)
- def test_isdisjoint_Set(self):
class MySet(Set):[](#l2.923)def __init__(self, itr):[](#l2.924)self.contents = itr[](#l2.925)def __contains__(self, x):[](#l2.926)return x in self.contents[](#l2.927)def __iter__(self):[](#l2.928)return iter(self.contents)[](#l2.929)def __len__(self):[](#l2.930)return len([x for x in self.contents])[](#l2.931)s1 = MySet((1, 2, 3))[](#l2.932)s2 = MySet((4, 5, 6))[](#l2.933)s3 = MySet((1, 5, 6))[](#l2.934)self.assertTrue(s1.isdisjoint(s2))[](#l2.935)self.assertFalse(s1.isdisjoint(s3))[](#l2.936)
- def test_equality_Set(self):
class MySet(Set):[](#l2.939)def __init__(self, itr):[](#l2.940)self.contents = itr[](#l2.941)def __contains__(self, x):[](#l2.942)return x in self.contents[](#l2.943)def __iter__(self):[](#l2.944)return iter(self.contents)[](#l2.945)def __len__(self):[](#l2.946)return len([x for x in self.contents])[](#l2.947)s1 = MySet((1,))[](#l2.948)s2 = MySet((1, 2))[](#l2.949)s3 = MySet((3, 4))[](#l2.950)s4 = MySet((3, 4))[](#l2.951)self.assertTrue(s2 > s1)[](#l2.952)self.assertTrue(s1 < s2)[](#l2.953)self.assertFalse(s2 <= s1)[](#l2.954)self.assertFalse(s2 <= s3)[](#l2.955)self.assertFalse(s1 >= s2)[](#l2.956)self.assertEqual(s3, s4)[](#l2.957)self.assertNotEqual(s2, s3)[](#l2.958)
- def test_arithmetic_Set(self):
class MySet(Set):[](#l2.961)def __init__(self, itr):[](#l2.962)self.contents = itr[](#l2.963)def __contains__(self, x):[](#l2.964)return x in self.contents[](#l2.965)def __iter__(self):[](#l2.966)return iter(self.contents)[](#l2.967)def __len__(self):[](#l2.968)return len([x for x in self.contents])[](#l2.969)s1 = MySet((1, 2, 3))[](#l2.970)s2 = MySet((3, 4, 5))[](#l2.971)s3 = s1 & s2[](#l2.972)self.assertEqual(s3, MySet((3,)))[](#l2.973)
- def test_MutableSet(self):
self.assertIsInstance(set(), MutableSet)[](#l2.976)self.assertTrue(issubclass(set, MutableSet))[](#l2.977)self.assertNotIsInstance(frozenset(), MutableSet)[](#l2.978)self.assertFalse(issubclass(frozenset, MutableSet))[](#l2.979)self.validate_abstract_methods(MutableSet, '__contains__', '__iter__', '__len__',[](#l2.980)'add', 'discard')[](#l2.981)
- def test_issue_5647(self):
# MutableSet.__iand__ mutated the set during iteration[](#l2.984)s = WithSet('abcd')[](#l2.985)s &= WithSet('cdef') # This used to fail[](#l2.986)self.assertEqual(set(s), set('cd'))[](#l2.987)
- def test_issue_4920(self):
# MutableSet.pop() method did not work[](#l2.990)class MySet(MutableSet):[](#l2.991)__slots__=['__s'][](#l2.992)def __init__(self,items=None):[](#l2.993)if items is None:[](#l2.994)items=[][](#l2.995)self.__s=set(items)[](#l2.996)def __contains__(self,v):[](#l2.997)return v in self.__s[](#l2.998)def __iter__(self):[](#l2.999)return iter(self.__s)[](#l2.1000)def __len__(self):[](#l2.1001)return len(self.__s)[](#l2.1002)def add(self,v):[](#l2.1003)result=v not in self.__s[](#l2.1004)self.__s.add(v)[](#l2.1005)return result[](#l2.1006)def discard(self,v):[](#l2.1007)result=v in self.__s[](#l2.1008)self.__s.discard(v)[](#l2.1009)return result[](#l2.1010)def __repr__(self):[](#l2.1011)return "MySet(%s)" % repr(list(self))[](#l2.1012)s = MySet([5,43,2,1])[](#l2.1013)self.assertEqual(s.pop(), 1)[](#l2.1014)
- def test_issue8750(self):
empty = WithSet()[](#l2.1017)full = WithSet(range(10))[](#l2.1018)s = WithSet(full)[](#l2.1019)s -= s[](#l2.1020)self.assertEqual(s, empty)[](#l2.1021)s = WithSet(full)[](#l2.1022)s ^= s[](#l2.1023)self.assertEqual(s, empty)[](#l2.1024)s = WithSet(full)[](#l2.1025)s &= s[](#l2.1026)self.assertEqual(s, full)[](#l2.1027)s |= s[](#l2.1028)self.assertEqual(s, full)[](#l2.1029)
- def test_issue16373(self):
# Recursion error comparing comparable and noncomparable[](#l2.1032)# Set instances[](#l2.1033)class MyComparableSet(Set):[](#l2.1034)def __contains__(self, x):[](#l2.1035)return False[](#l2.1036)def __len__(self):[](#l2.1037)return 0[](#l2.1038)def __iter__(self):[](#l2.1039)return iter([])[](#l2.1040)class MyNonComparableSet(Set):[](#l2.1041)def __contains__(self, x):[](#l2.1042)return False[](#l2.1043)def __len__(self):[](#l2.1044)return 0[](#l2.1045)def __iter__(self):[](#l2.1046)return iter([])[](#l2.1047)def __le__(self, x):[](#l2.1048)return NotImplemented[](#l2.1049)def __lt__(self, x):[](#l2.1050)return NotImplemented[](#l2.1051)
cs = MyComparableSet()[](#l2.1053)ncs = MyNonComparableSet()[](#l2.1054)self.assertFalse(ncs < cs)[](#l2.1055)self.assertTrue(ncs <= cs)[](#l2.1056)self.assertFalse(ncs > cs)[](#l2.1057)self.assertTrue(ncs >= cs)[](#l2.1058)
- def assertSameSet(self, s1, s2):
# coerce both to a real set then check equality[](#l2.1061)self.assertSetEqual(set(s1), set(s2))[](#l2.1062)
- def test_Set_interoperability_with_real_sets(self):
# Issue: 8743[](#l2.1065)class ListSet(Set):[](#l2.1066)def __init__(self, elements=()):[](#l2.1067)self.data = [][](#l2.1068)for elem in elements:[](#l2.1069)if elem not in self.data:[](#l2.1070)self.data.append(elem)[](#l2.1071)def __contains__(self, elem):[](#l2.1072)return elem in self.data[](#l2.1073)def __iter__(self):[](#l2.1074)return iter(self.data)[](#l2.1075)def __len__(self):[](#l2.1076)return len(self.data)[](#l2.1077)def __repr__(self):[](#l2.1078)return 'Set({!r})'.format(self.data)[](#l2.1079)
r1 = set('abc')[](#l2.1081)r2 = set('bcd')[](#l2.1082)r3 = set('abcde')[](#l2.1083)f1 = ListSet('abc')[](#l2.1084)f2 = ListSet('bcd')[](#l2.1085)f3 = ListSet('abcde')[](#l2.1086)l1 = list('abccba')[](#l2.1087)l2 = list('bcddcb')[](#l2.1088)l3 = list('abcdeedcba')[](#l2.1089)
target = r1 & r2[](#l2.1091)self.assertSameSet(f1 & f2, target)[](#l2.1092)self.assertSameSet(f1 & r2, target)[](#l2.1093)self.assertSameSet(r2 & f1, target)[](#l2.1094)self.assertSameSet(f1 & l2, target)[](#l2.1095)
target = r1 | r2[](#l2.1097)self.assertSameSet(f1 | f2, target)[](#l2.1098)self.assertSameSet(f1 | r2, target)[](#l2.1099)self.assertSameSet(r2 | f1, target)[](#l2.1100)self.assertSameSet(f1 | l2, target)[](#l2.1101)
fwd_target = r1 - r2[](#l2.1103)rev_target = r2 - r1[](#l2.1104)self.assertSameSet(f1 - f2, fwd_target)[](#l2.1105)self.assertSameSet(f2 - f1, rev_target)[](#l2.1106)self.assertSameSet(f1 - r2, fwd_target)[](#l2.1107)self.assertSameSet(f2 - r1, rev_target)[](#l2.1108)self.assertSameSet(r1 - f2, fwd_target)[](#l2.1109)self.assertSameSet(r2 - f1, rev_target)[](#l2.1110)self.assertSameSet(f1 - l2, fwd_target)[](#l2.1111)self.assertSameSet(f2 - l1, rev_target)[](#l2.1112)
target = r1 ^ r2[](#l2.1114)self.assertSameSet(f1 ^ f2, target)[](#l2.1115)self.assertSameSet(f1 ^ r2, target)[](#l2.1116)self.assertSameSet(r2 ^ f1, target)[](#l2.1117)self.assertSameSet(f1 ^ l2, target)[](#l2.1118)
# Don't change the following to use assertLess or other[](#l2.1120)# "more specific" unittest assertions. The current[](#l2.1121)# assertTrue/assertFalse style makes the pattern of test[](#l2.1122)# case combinations clear and allows us to know for sure[](#l2.1123)# the exact operator being invoked.[](#l2.1124)
# proper subset[](#l2.1126)self.assertTrue(f1 < f3)[](#l2.1127)self.assertFalse(f1 < f1)[](#l2.1128)self.assertFalse(f1 < f2)[](#l2.1129)self.assertTrue(r1 < f3)[](#l2.1130)self.assertFalse(r1 < f1)[](#l2.1131)self.assertFalse(r1 < f2)[](#l2.1132)self.assertTrue(r1 < r3)[](#l2.1133)self.assertFalse(r1 < r1)[](#l2.1134)self.assertFalse(r1 < r2)[](#l2.1135)with self.assertRaises(TypeError):[](#l2.1136)f1 < l3[](#l2.1137)with self.assertRaises(TypeError):[](#l2.1138)f1 < l1[](#l2.1139)with self.assertRaises(TypeError):[](#l2.1140)f1 < l2[](#l2.1141)
# any subset[](#l2.1143)self.assertTrue(f1 <= f3)[](#l2.1144)self.assertTrue(f1 <= f1)[](#l2.1145)self.assertFalse(f1 <= f2)[](#l2.1146)self.assertTrue(r1 <= f3)[](#l2.1147)self.assertTrue(r1 <= f1)[](#l2.1148)self.assertFalse(r1 <= f2)[](#l2.1149)self.assertTrue(r1 <= r3)[](#l2.1150)self.assertTrue(r1 <= r1)[](#l2.1151)self.assertFalse(r1 <= r2)[](#l2.1152)with self.assertRaises(TypeError):[](#l2.1153)f1 <= l3[](#l2.1154)with self.assertRaises(TypeError):[](#l2.1155)f1 <= l1[](#l2.1156)with self.assertRaises(TypeError):[](#l2.1157)f1 <= l2[](#l2.1158)
# proper superset[](#l2.1160)self.assertTrue(f3 > f1)[](#l2.1161)self.assertFalse(f1 > f1)[](#l2.1162)self.assertFalse(f2 > f1)[](#l2.1163)self.assertTrue(r3 > r1)[](#l2.1164)self.assertFalse(f1 > r1)[](#l2.1165)self.assertFalse(f2 > r1)[](#l2.1166)self.assertTrue(r3 > r1)[](#l2.1167)self.assertFalse(r1 > r1)[](#l2.1168)self.assertFalse(r2 > r1)[](#l2.1169)with self.assertRaises(TypeError):[](#l2.1170)f1 > l3[](#l2.1171)with self.assertRaises(TypeError):[](#l2.1172)f1 > l1[](#l2.1173)with self.assertRaises(TypeError):[](#l2.1174)f1 > l2[](#l2.1175)
# any superset[](#l2.1177)self.assertTrue(f3 >= f1)[](#l2.1178)self.assertTrue(f1 >= f1)[](#l2.1179)self.assertFalse(f2 >= f1)[](#l2.1180)self.assertTrue(r3 >= r1)[](#l2.1181)self.assertTrue(f1 >= r1)[](#l2.1182)self.assertFalse(f2 >= r1)[](#l2.1183)self.assertTrue(r3 >= r1)[](#l2.1184)self.assertTrue(r1 >= r1)[](#l2.1185)self.assertFalse(r2 >= r1)[](#l2.1186)with self.assertRaises(TypeError):[](#l2.1187)f1 >= l3[](#l2.1188)with self.assertRaises(TypeError):[](#l2.1189)f1 >=l1[](#l2.1190)with self.assertRaises(TypeError):[](#l2.1191)f1 >= l2[](#l2.1192)
# equality[](#l2.1194)self.assertTrue(f1 == f1)[](#l2.1195)self.assertTrue(r1 == f1)[](#l2.1196)self.assertTrue(f1 == r1)[](#l2.1197)self.assertFalse(f1 == f3)[](#l2.1198)self.assertFalse(r1 == f3)[](#l2.1199)self.assertFalse(f1 == r3)[](#l2.1200)self.assertFalse(f1 == l3)[](#l2.1201)self.assertFalse(f1 == l1)[](#l2.1202)self.assertFalse(f1 == l2)[](#l2.1203)
# inequality[](#l2.1205)self.assertFalse(f1 != f1)[](#l2.1206)self.assertFalse(r1 != f1)[](#l2.1207)self.assertFalse(f1 != r1)[](#l2.1208)self.assertTrue(f1 != f3)[](#l2.1209)self.assertTrue(r1 != f3)[](#l2.1210)self.assertTrue(f1 != r3)[](#l2.1211)self.assertTrue(f1 != l3)[](#l2.1212)self.assertTrue(f1 != l1)[](#l2.1213)self.assertTrue(f1 != l2)[](#l2.1214)
- def test_Mapping(self):
for sample in [dict]:[](#l2.1217)self.assertIsInstance(sample(), Mapping)[](#l2.1218)self.assertTrue(issubclass(sample, Mapping))[](#l2.1219)self.validate_abstract_methods(Mapping, '__contains__', '__iter__', '__len__',[](#l2.1220)'__getitem__')[](#l2.1221)class MyMapping(Mapping):[](#l2.1222)def __len__(self):[](#l2.1223)return 0[](#l2.1224)def __getitem__(self, i):[](#l2.1225)raise IndexError[](#l2.1226)def __iter__(self):[](#l2.1227)return iter(())[](#l2.1228)self.validate_comparison(MyMapping())[](#l2.1229)
- def test_MutableMapping(self):
for sample in [dict]:[](#l2.1232)self.assertIsInstance(sample(), MutableMapping)[](#l2.1233)self.assertTrue(issubclass(sample, MutableMapping))[](#l2.1234)self.validate_abstract_methods(MutableMapping, '__contains__', '__iter__', '__len__',[](#l2.1235)'__getitem__', '__setitem__', '__delitem__')[](#l2.1236)
- def test_MutableMapping_subclass(self):
# Test issue 9214[](#l2.1239)mymap = UserDict()[](#l2.1240)mymap['red'] = 5[](#l2.1241)self.assertIsInstance(mymap.keys(), Set)[](#l2.1242)self.assertIsInstance(mymap.keys(), KeysView)[](#l2.1243)self.assertIsInstance(mymap.items(), Set)[](#l2.1244)self.assertIsInstance(mymap.items(), ItemsView)[](#l2.1245)
mymap = UserDict()[](#l2.1247)mymap['red'] = 5[](#l2.1248)z = mymap.keys() | {'orange'}[](#l2.1249)self.assertIsInstance(z, set)[](#l2.1250)list(z)[](#l2.1251)mymap['blue'] = 7 # Shouldn't affect 'z'[](#l2.1252)self.assertEqual(sorted(z), ['orange', 'red'])[](#l2.1253)
mymap = UserDict()[](#l2.1255)mymap['red'] = 5[](#l2.1256)z = mymap.items() | {('orange', 3)}[](#l2.1257)self.assertIsInstance(z, set)[](#l2.1258)list(z)[](#l2.1259)mymap['blue'] = 7 # Shouldn't affect 'z'[](#l2.1260)self.assertEqual(sorted(z), [('orange', 3), ('red', 5)])[](#l2.1261)
- def test_Sequence(self):
for sample in [tuple, list, bytes, str]:[](#l2.1264)self.assertIsInstance(sample(), Sequence)[](#l2.1265)self.assertTrue(issubclass(sample, Sequence))[](#l2.1266)self.assertIsInstance(range(10), Sequence)[](#l2.1267)self.assertTrue(issubclass(range, Sequence))[](#l2.1268)self.assertIsInstance(memoryview(b""), Sequence)[](#l2.1269)self.assertTrue(issubclass(memoryview, Sequence))[](#l2.1270)self.assertTrue(issubclass(str, Sequence))[](#l2.1271)self.validate_abstract_methods(Sequence, '__contains__', '__iter__', '__len__',[](#l2.1272)'__getitem__')[](#l2.1273)
- def test_Sequence_mixins(self):
class SequenceSubclass(Sequence):[](#l2.1276)def __init__(self, seq=()):[](#l2.1277)self.seq = seq[](#l2.1278)
def __getitem__(self, index):[](#l2.1280)return self.seq[index][](#l2.1281)
def __len__(self):[](#l2.1283)return len(self.seq)[](#l2.1284)
# Compare Sequence.index() behavior to (list|str).index() behavior[](#l2.1286)def assert_index_same(seq1, seq2, index_args):[](#l2.1287)try:[](#l2.1288)expected = seq1.index(*index_args)[](#l2.1289)except ValueError:[](#l2.1290)with self.assertRaises(ValueError):[](#l2.1291)seq2.index(*index_args)[](#l2.1292)else:[](#l2.1293)actual = seq2.index(*index_args)[](#l2.1294)self.assertEqual([](#l2.1295)actual, expected, '%r.index%s' % (seq1, index_args))[](#l2.1296)
for ty in list, str:[](#l2.1298)nativeseq = ty('abracadabra')[](#l2.1299)indexes = [-10000, -9999] + list(range(-3, len(nativeseq) + 3))[](#l2.1300)seqseq = SequenceSubclass(nativeseq)[](#l2.1301)for letter in set(nativeseq) | {'z'}:[](#l2.1302)assert_index_same(nativeseq, seqseq, (letter,))[](#l2.1303)for start in range(-3, len(nativeseq) + 3):[](#l2.1304)assert_index_same(nativeseq, seqseq, (letter, start))[](#l2.1305)for stop in range(-3, len(nativeseq) + 3):[](#l2.1306)assert_index_same([](#l2.1307)nativeseq, seqseq, (letter, start, stop))[](#l2.1308)
- def test_ByteString(self):
for sample in [bytes, bytearray]:[](#l2.1311)self.assertIsInstance(sample(), ByteString)[](#l2.1312)self.assertTrue(issubclass(sample, ByteString))[](#l2.1313)for sample in [str, list, tuple]:[](#l2.1314)self.assertNotIsInstance(sample(), ByteString)[](#l2.1315)self.assertFalse(issubclass(sample, ByteString))[](#l2.1316)self.assertNotIsInstance(memoryview(b""), ByteString)[](#l2.1317)self.assertFalse(issubclass(memoryview, ByteString))[](#l2.1318)
- def test_MutableSequence(self):
for sample in [tuple, str, bytes]:[](#l2.1321)self.assertNotIsInstance(sample(), MutableSequence)[](#l2.1322)self.assertFalse(issubclass(sample, MutableSequence))[](#l2.1323)for sample in [list, bytearray, deque]:[](#l2.1324)self.assertIsInstance(sample(), MutableSequence)[](#l2.1325)self.assertTrue(issubclass(sample, MutableSequence))[](#l2.1326)self.assertFalse(issubclass(str, MutableSequence))[](#l2.1327)self.validate_abstract_methods(MutableSequence, '__contains__', '__iter__',[](#l2.1328)'__len__', '__getitem__', '__setitem__', '__delitem__', 'insert')[](#l2.1329)
- def test_MutableSequence_mixins(self):
# Test the mixins of MutableSequence by creating a miminal concrete[](#l2.1332)# class inherited from it.[](#l2.1333)class MutableSequenceSubclass(MutableSequence):[](#l2.1334)def __init__(self):[](#l2.1335)self.lst = [][](#l2.1336)
def __setitem__(self, index, value):[](#l2.1338)self.lst[index] = value[](#l2.1339)
def __getitem__(self, index):[](#l2.1341)return self.lst[index][](#l2.1342)
def __len__(self):[](#l2.1344)return len(self.lst)[](#l2.1345)
def __delitem__(self, index):[](#l2.1347)del self.lst[index][](#l2.1348)
def insert(self, index, value):[](#l2.1350)self.lst.insert(index, value)[](#l2.1351)
mss = MutableSequenceSubclass()[](#l2.1353)mss.append(0)[](#l2.1354)mss.extend((1, 2, 3, 4))[](#l2.1355)self.assertEqual(len(mss), 5)[](#l2.1356)self.assertEqual(mss[3], 3)[](#l2.1357)mss.reverse()[](#l2.1358)self.assertEqual(mss[3], 1)[](#l2.1359)mss.pop()[](#l2.1360)self.assertEqual(len(mss), 4)[](#l2.1361)mss.remove(3)[](#l2.1362)self.assertEqual(len(mss), 3)[](#l2.1363)mss += (10, 20, 30)[](#l2.1364)self.assertEqual(len(mss), 6)[](#l2.1365)self.assertEqual(mss[-1], 30)[](#l2.1366)mss.clear()[](#l2.1367)self.assertEqual(len(mss), 0)[](#l2.1368)
- -################################################################################ -### Counter -################################################################################ - -class CounterSubclassWithSetItem(Counter):
Test a counter subclass that overrides setitem
- def init(self, *args, **kwds):
self.called = False[](#l2.1377)Counter.__init__(self, *args, **kwds)[](#l2.1378)- def setitem(self, key, value):
self.called = True[](#l2.1380)Counter.__setitem__(self, key, value)[](#l2.1381)
- -class CounterSubclassWithGet(Counter):
Test a counter subclass that overrides get()
- def init(self, *args, **kwds):
self.called = False[](#l2.1386)Counter.__init__(self, *args, **kwds)[](#l2.1387)- def get(self, key, default):
self.called = True[](#l2.1389)return Counter.get(self, key, default)[](#l2.1390)
- -class TestCounter(unittest.TestCase): -
- def test_basics(self):
c = Counter('abcaba')[](#l2.1395)self.assertEqual(c, Counter({'a':3 , 'b': 2, 'c': 1}))[](#l2.1396)self.assertEqual(c, Counter(a=3, b=2, c=1))[](#l2.1397)self.assertIsInstance(c, dict)[](#l2.1398)self.assertIsInstance(c, Mapping)[](#l2.1399)self.assertTrue(issubclass(Counter, dict))[](#l2.1400)self.assertTrue(issubclass(Counter, Mapping))[](#l2.1401)self.assertEqual(len(c), 3)[](#l2.1402)self.assertEqual(sum(c.values()), 6)[](#l2.1403)self.assertEqual(sorted(c.values()), [1, 2, 3])[](#l2.1404)self.assertEqual(sorted(c.keys()), ['a', 'b', 'c'])[](#l2.1405)self.assertEqual(sorted(c), ['a', 'b', 'c'])[](#l2.1406)self.assertEqual(sorted(c.items()),[](#l2.1407)[('a', 3), ('b', 2), ('c', 1)])[](#l2.1408)self.assertEqual(c['b'], 2)[](#l2.1409)self.assertEqual(c['z'], 0)[](#l2.1410)self.assertEqual(c.__contains__('c'), True)[](#l2.1411)self.assertEqual(c.__contains__('z'), False)[](#l2.1412)self.assertEqual(c.get('b', 10), 2)[](#l2.1413)self.assertEqual(c.get('z', 10), 10)[](#l2.1414)self.assertEqual(c, dict(a=3, b=2, c=1))[](#l2.1415)self.assertEqual(repr(c), "Counter({'a': 3, 'b': 2, 'c': 1})")[](#l2.1416)self.assertEqual(c.most_common(), [('a', 3), ('b', 2), ('c', 1)])[](#l2.1417)for i in range(5):[](#l2.1418)self.assertEqual(c.most_common(i),[](#l2.1419)[('a', 3), ('b', 2), ('c', 1)][:i])[](#l2.1420)self.assertEqual(''.join(sorted(c.elements())), 'aaabbc')[](#l2.1421)c['a'] += 1 # increment an existing value[](#l2.1422)c['b'] -= 2 # sub existing value to zero[](#l2.1423)del c['c'] # remove an entry[](#l2.1424)del c['c'] # make sure that del doesn't raise KeyError[](#l2.1425)c['d'] -= 2 # sub from a missing value[](#l2.1426)c['e'] = -5 # directly assign a missing value[](#l2.1427)c['f'] += 4 # add to a missing value[](#l2.1428)self.assertEqual(c, dict(a=4, b=0, d=-2, e=-5, f=4))[](#l2.1429)self.assertEqual(''.join(sorted(c.elements())), 'aaaaffff')[](#l2.1430)self.assertEqual(c.pop('f'), 4)[](#l2.1431)self.assertNotIn('f', c)[](#l2.1432)for i in range(3):[](#l2.1433)elem, cnt = c.popitem()[](#l2.1434)self.assertNotIn(elem, c)[](#l2.1435)c.clear()[](#l2.1436)self.assertEqual(c, {})[](#l2.1437)self.assertEqual(repr(c), 'Counter()')[](#l2.1438)self.assertRaises(NotImplementedError, Counter.fromkeys, 'abc')[](#l2.1439)self.assertRaises(TypeError, hash, c)[](#l2.1440)c.update(dict(a=5, b=3))[](#l2.1441)c.update(c=1)[](#l2.1442)c.update(Counter('a' * 50 + 'b' * 30))[](#l2.1443)c.update() # test case with no args[](#l2.1444)c.__init__('a' * 500 + 'b' * 300)[](#l2.1445)c.__init__('cdc')[](#l2.1446)c.__init__()[](#l2.1447)self.assertEqual(c, dict(a=555, b=333, c=3, d=1))[](#l2.1448)self.assertEqual(c.setdefault('d', 5), 1)[](#l2.1449)self.assertEqual(c['d'], 1)[](#l2.1450)self.assertEqual(c.setdefault('e', 5), 5)[](#l2.1451)self.assertEqual(c['e'], 5)[](#l2.1452)
- def test_init(self):
self.assertEqual(list(Counter(self=42).items()), [('self', 42)])[](#l2.1455)self.assertEqual(list(Counter(iterable=42).items()), [('iterable', 42)])[](#l2.1456)self.assertEqual(list(Counter(iterable=None).items()), [('iterable', None)])[](#l2.1457)self.assertRaises(TypeError, Counter, 42)[](#l2.1458)self.assertRaises(TypeError, Counter, (), ())[](#l2.1459)self.assertRaises(TypeError, Counter.__init__)[](#l2.1460)
- def test_update(self):
c = Counter()[](#l2.1463)c.update(self=42)[](#l2.1464)self.assertEqual(list(c.items()), [('self', 42)])[](#l2.1465)c = Counter()[](#l2.1466)c.update(iterable=42)[](#l2.1467)self.assertEqual(list(c.items()), [('iterable', 42)])[](#l2.1468)c = Counter()[](#l2.1469)c.update(iterable=None)[](#l2.1470)self.assertEqual(list(c.items()), [('iterable', None)])[](#l2.1471)self.assertRaises(TypeError, Counter().update, 42)[](#l2.1472)self.assertRaises(TypeError, Counter().update, {}, {})[](#l2.1473)self.assertRaises(TypeError, Counter.update)[](#l2.1474)
- def test_copying(self):
# Check that counters are copyable, deepcopyable, picklable, and[](#l2.1477)#have a repr/eval round-trip[](#l2.1478)words = Counter('which witch had which witches wrist watch'.split())[](#l2.1479)def check(dup):[](#l2.1480)msg = "\ncopy: %s\nwords: %s" % (dup, words)[](#l2.1481)self.assertIsNot(dup, words, msg)[](#l2.1482)self.assertEqual(dup, words)[](#l2.1483)check(words.copy())[](#l2.1484)check(copy.copy(words))[](#l2.1485)check(copy.deepcopy(words))[](#l2.1486)for proto in range(pickle.HIGHEST_PROTOCOL + 1):[](#l2.1487)with self.subTest(proto=proto):[](#l2.1488)check(pickle.loads(pickle.dumps(words, proto)))[](#l2.1489)check(eval(repr(words)))[](#l2.1490)update_test = Counter()[](#l2.1491)update_test.update(words)[](#l2.1492)check(update_test)[](#l2.1493)check(Counter(words))[](#l2.1494)
- def test_copy_subclass(self):
class MyCounter(Counter):[](#l2.1497)pass[](#l2.1498)c = MyCounter('slartibartfast')[](#l2.1499)d = c.copy()[](#l2.1500)self.assertEqual(d, c)[](#l2.1501)self.assertEqual(len(d), len(c))[](#l2.1502)self.assertEqual(type(d), type(c))[](#l2.1503)
- def test_conversions(self):
# Convert to: set, list, dict[](#l2.1506)s = 'she sells sea shells by the sea shore'[](#l2.1507)self.assertEqual(sorted(Counter(s).elements()), sorted(s))[](#l2.1508)self.assertEqual(sorted(Counter(s)), sorted(set(s)))[](#l2.1509)self.assertEqual(dict(Counter(s)), dict(Counter(s).items()))[](#l2.1510)self.assertEqual(set(Counter(s)), set(s))[](#l2.1511)
- def test_invariant_for_the_in_operator(self):
c = Counter(a=10, b=-2, c=0)[](#l2.1514)for elem in c:[](#l2.1515)self.assertTrue(elem in c)[](#l2.1516)self.assertIn(elem, c)[](#l2.1517)
- def test_multiset_operations(self):
# Verify that adding a zero counter will strip zeros and negatives[](#l2.1520)c = Counter(a=10, b=-2, c=0) + Counter()[](#l2.1521)self.assertEqual(dict(c), dict(a=10))[](#l2.1522)
elements = 'abcd'[](#l2.1524)for i in range(1000):[](#l2.1525)# test random pairs of multisets[](#l2.1526)p = Counter(dict((elem, randrange(-2,4)) for elem in elements))[](#l2.1527)p.update(e=1, f=-1, g=0)[](#l2.1528)q = Counter(dict((elem, randrange(-2,4)) for elem in elements))[](#l2.1529)q.update(h=1, i=-1, j=0)[](#l2.1530)for counterop, numberop in [[](#l2.1531)(Counter.__add__, lambda x, y: max(0, x+y)),[](#l2.1532)(Counter.__sub__, lambda x, y: max(0, x-y)),[](#l2.1533)(Counter.__or__, lambda x, y: max(0,x,y)),[](#l2.1534)(Counter.__and__, lambda x, y: max(0, min(x,y))),[](#l2.1535)]:[](#l2.1536)result = counterop(p, q)[](#l2.1537)for x in elements:[](#l2.1538)self.assertEqual(numberop(p[x], q[x]), result[x],[](#l2.1539)(counterop, x, p, q))[](#l2.1540)# verify that results exclude non-positive counts[](#l2.1541)self.assertTrue(x>0 for x in result.values())[](#l2.1542)
elements = 'abcdef'[](#l2.1544)for i in range(100):[](#l2.1545)# verify that random multisets with no repeats are exactly like sets[](#l2.1546)p = Counter(dict((elem, randrange(0, 2)) for elem in elements))[](#l2.1547)q = Counter(dict((elem, randrange(0, 2)) for elem in elements))[](#l2.1548)for counterop, setop in [[](#l2.1549)(Counter.__sub__, set.__sub__),[](#l2.1550)(Counter.__or__, set.__or__),[](#l2.1551)(Counter.__and__, set.__and__),[](#l2.1552)]:[](#l2.1553)counter_result = counterop(p, q)[](#l2.1554)set_result = setop(set(p.elements()), set(q.elements()))[](#l2.1555)self.assertEqual(counter_result, dict.fromkeys(set_result, 1))[](#l2.1556)
- def test_inplace_operations(self):
elements = 'abcd'[](#l2.1559)for i in range(1000):[](#l2.1560)# test random pairs of multisets[](#l2.1561)p = Counter(dict((elem, randrange(-2,4)) for elem in elements))[](#l2.1562)p.update(e=1, f=-1, g=0)[](#l2.1563)q = Counter(dict((elem, randrange(-2,4)) for elem in elements))[](#l2.1564)q.update(h=1, i=-1, j=0)[](#l2.1565)for inplace_op, regular_op in [[](#l2.1566)(Counter.__iadd__, Counter.__add__),[](#l2.1567)(Counter.__isub__, Counter.__sub__),[](#l2.1568)(Counter.__ior__, Counter.__or__),[](#l2.1569)(Counter.__iand__, Counter.__and__),[](#l2.1570)]:[](#l2.1571)c = p.copy()[](#l2.1572)c_id = id(c)[](#l2.1573)regular_result = regular_op(c, q)[](#l2.1574)inplace_result = inplace_op(c, q)[](#l2.1575)self.assertEqual(inplace_result, regular_result)[](#l2.1576)self.assertEqual(id(inplace_result), c_id)[](#l2.1577)
- def test_subtract(self):
c = Counter(a=-5, b=0, c=5, d=10, e=15,g=40)[](#l2.1580)c.subtract(a=1, b=2, c=-3, d=10, e=20, f=30, h=-50)[](#l2.1581)self.assertEqual(c, Counter(a=-6, b=-2, c=8, d=0, e=-5, f=-30, g=40, h=50))[](#l2.1582)c = Counter(a=-5, b=0, c=5, d=10, e=15,g=40)[](#l2.1583)c.subtract(Counter(a=1, b=2, c=-3, d=10, e=20, f=30, h=-50))[](#l2.1584)self.assertEqual(c, Counter(a=-6, b=-2, c=8, d=0, e=-5, f=-30, g=40, h=50))[](#l2.1585)c = Counter('aaabbcd')[](#l2.1586)c.subtract('aaaabbcce')[](#l2.1587)self.assertEqual(c, Counter(a=-1, b=0, c=-1, d=1, e=-1))[](#l2.1588)
c = Counter()[](#l2.1590)c.subtract(self=42)[](#l2.1591)self.assertEqual(list(c.items()), [('self', -42)])[](#l2.1592)c = Counter()[](#l2.1593)c.subtract(iterable=42)[](#l2.1594)self.assertEqual(list(c.items()), [('iterable', -42)])[](#l2.1595)self.assertRaises(TypeError, Counter().subtract, 42)[](#l2.1596)self.assertRaises(TypeError, Counter().subtract, {}, {})[](#l2.1597)self.assertRaises(TypeError, Counter.subtract)[](#l2.1598)
- def test_unary(self):
c = Counter(a=-5, b=0, c=5, d=10, e=15,g=40)[](#l2.1601)self.assertEqual(dict(+c), dict(c=5, d=10, e=15, g=40))[](#l2.1602)self.assertEqual(dict(-c), dict(a=5))[](#l2.1603)
- def test_repr_nonsortable(self):
c = Counter(a=2, b=None)[](#l2.1606)r = repr(c)[](#l2.1607)self.assertIn("'a': 2", r)[](#l2.1608)self.assertIn("'b': None", r)[](#l2.1609)
- def test_helper_function(self):
# two paths, one for real dicts and one for other mappings[](#l2.1612)elems = list('abracadabra')[](#l2.1613)
d = dict()[](#l2.1615)_count_elements(d, elems)[](#l2.1616)self.assertEqual(d, {'a': 5, 'r': 2, 'b': 2, 'c': 1, 'd': 1})[](#l2.1617)
m = OrderedDict()[](#l2.1619)_count_elements(m, elems)[](#l2.1620)self.assertEqual(m,[](#l2.1621)OrderedDict([('a', 5), ('b', 2), ('r', 2), ('c', 1), ('d', 1)]))[](#l2.1622)
# test fidelity to the pure python version[](#l2.1624)c = CounterSubclassWithSetItem('abracadabra')[](#l2.1625)self.assertTrue(c.called)[](#l2.1626)self.assertEqual(dict(c), {'a': 5, 'b': 2, 'c': 1, 'd': 1, 'r':2 })[](#l2.1627)c = CounterSubclassWithGet('abracadabra')[](#l2.1628)self.assertTrue(c.called)[](#l2.1629)self.assertEqual(dict(c), {'a': 5, 'b': 2, 'c': 1, 'd': 1, 'r':2 })[](#l2.1630)
- - -################################################################################ -### OrderedDict -################################################################################ - -py_coll = import_fresh_module('collections', blocked=['_collections']) -c_coll = import_fresh_module('collections', fresh=['_collections']) +py_coll = support.import_fresh_module('collections', blocked=['_collections']) +c_coll = support.import_fresh_module('collections', fresh=['_collections']) @contextlib.contextmanager @@ -2195,6 +579,7 @@ class OrderedDictTests: self.assertNotIn('NULL', repr(od)) def test_dict_update(self):
OrderedDict = self.OrderedDict[](#l2.1648) od = OrderedDict()[](#l2.1649) dict.update(od, [('spam', 1)])[](#l2.1650) self.assertNotIn('NULL', repr(od))[](#l2.1651)
@@ -2294,26 +679,5 @@ class CPythonSubclassMappingTests(mappin self.assertRaises(KeyError, d.popitem) -################################################################################ -### Run tests -################################################################################ - -import doctest, collections - -def test_main(verbose=None):
- NamedTupleDocs = doctest.DocTestSuite(module=collections)
- test_classes = [TestNamedTuple, NamedTupleDocs, TestOneTrickPonyABCs,
TestCollectionABCs, TestCounter, TestChainMap,[](#l2.1665)PurePythonOrderedDictTests, CPythonOrderedDictTests,[](#l2.1666)PurePythonOrderedDictSubclassTests,[](#l2.1667)CPythonOrderedDictSubclassTests,[](#l2.1668)PurePythonGeneralMappingTests, CPythonGeneralMappingTests,[](#l2.1669)PurePythonSubclassMappingTests, CPythonSubclassMappingTests,[](#l2.1670)TestUserObjects,[](#l2.1671)][](#l2.1672)- support.run_unittest(*test_classes)
- support.run_doctest(collections, verbose)