cpython: 8d9a0540adf9 (original) (raw)
--- a/Lib/test/test_collections.py +++ b/Lib/test/test_collections.py @@ -1,16 +1,19 @@ """Unit tests for collections.py.""" -import unittest, doctest, operator -from test.support import TESTFN, forget, unlink -import inspect +import collections +import copy +import doctest +import keyword +import operator +import pickle +from random import choice, randrange +import re +import string +import sys from test import support +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 from collections import UserDict from collections import ChainMap from collections.abc import Hashable, Iterable, Iterator @@ -281,8 +284,7 @@ class TestNamedTuple(unittest.TestCase): # n = 5000 n = 254 # SyntaxError: more than 255 arguments:
import string, random[](#l1.36)names = list(set(''.join([random.choice(string.ascii_letters)[](#l1.37)
names = list(set(''.join([choice(string.ascii_letters)[](#l1.38) for j in range(10)]) for i in range(n)))[](#l1.39) n = len(names)[](#l1.40) Big = namedtuple('Big', names)[](#l1.41)
@@ -1281,309 +1283,13 @@ class TestCounter(unittest.TestCase): ################################################################################ -### OrderedDict -################################################################################ - -class TestOrderedDict(unittest.TestCase): -
- def test_init(self):
with self.assertRaises(TypeError):[](#l1.52)OrderedDict([('a', 1), ('b', 2)], None) # too many args[](#l1.53)pairs = [('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5)][](#l1.54)self.assertEqual(sorted(OrderedDict(dict(pairs)).items()), pairs) # dict input[](#l1.55)self.assertEqual(sorted(OrderedDict(**dict(pairs)).items()), pairs) # kwds input[](#l1.56)self.assertEqual(list(OrderedDict(pairs).items()), pairs) # pairs input[](#l1.57)self.assertEqual(list(OrderedDict([('a', 1), ('b', 2), ('c', 9), ('d', 4)],[](#l1.58)c=3, e=5).items()), pairs) # mixed input[](#l1.59)
# make sure no positional args conflict with possible kwdargs[](#l1.61)self.assertEqual(list(OrderedDict(self=42).items()), [('self', 42)])[](#l1.62)self.assertEqual(list(OrderedDict(other=42).items()), [('other', 42)])[](#l1.63)self.assertRaises(TypeError, OrderedDict, 42)[](#l1.64)self.assertRaises(TypeError, OrderedDict, (), ())[](#l1.65)self.assertRaises(TypeError, OrderedDict.__init__)[](#l1.66)
# Make sure that direct calls to __init__ do not clear previous contents[](#l1.68)d = OrderedDict([('a', 1), ('b', 2), ('c', 3), ('d', 44), ('e', 55)])[](#l1.69)d.__init__([('e', 5), ('f', 6)], g=7, d=4)[](#l1.70)self.assertEqual(list(d.items()),[](#l1.71)[('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5), ('f', 6), ('g', 7)])[](#l1.72)
- def test_update(self):
with self.assertRaises(TypeError):[](#l1.75)OrderedDict().update([('a', 1), ('b', 2)], None) # too many args[](#l1.76)pairs = [('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5)][](#l1.77)od = OrderedDict()[](#l1.78)od.update(dict(pairs))[](#l1.79)self.assertEqual(sorted(od.items()), pairs) # dict input[](#l1.80)od = OrderedDict()[](#l1.81)od.update(**dict(pairs))[](#l1.82)self.assertEqual(sorted(od.items()), pairs) # kwds input[](#l1.83)od = OrderedDict()[](#l1.84)od.update(pairs)[](#l1.85)self.assertEqual(list(od.items()), pairs) # pairs input[](#l1.86)od = OrderedDict()[](#l1.87)od.update([('a', 1), ('b', 2), ('c', 9), ('d', 4)], c=3, e=5)[](#l1.88)self.assertEqual(list(od.items()), pairs) # mixed input[](#l1.89)
# Issue 9137: Named argument called 'other' or 'self'[](#l1.91)# shouldn't be treated specially.[](#l1.92)od = OrderedDict()[](#l1.93)od.update(self=23)[](#l1.94)self.assertEqual(list(od.items()), [('self', 23)])[](#l1.95)od = OrderedDict()[](#l1.96)od.update(other={})[](#l1.97)self.assertEqual(list(od.items()), [('other', {})])[](#l1.98)od = OrderedDict()[](#l1.99)od.update(red=5, blue=6, other=7, self=8)[](#l1.100)self.assertEqual(sorted(list(od.items())),[](#l1.101)[('blue', 6), ('other', 7), ('red', 5), ('self', 8)])[](#l1.102)
# Make sure that direct calls to update do not clear previous contents[](#l1.104)# add that updates items are not moved to the end[](#l1.105)d = OrderedDict([('a', 1), ('b', 2), ('c', 3), ('d', 44), ('e', 55)])[](#l1.106)d.update([('e', 5), ('f', 6)], g=7, d=4)[](#l1.107)self.assertEqual(list(d.items()),[](#l1.108)[('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5), ('f', 6), ('g', 7)])[](#l1.109)
self.assertRaises(TypeError, OrderedDict().update, 42)[](#l1.111)self.assertRaises(TypeError, OrderedDict().update, (), ())[](#l1.112)self.assertRaises(TypeError, OrderedDict.update)[](#l1.113)
- def test_abc(self):
self.assertIsInstance(OrderedDict(), MutableMapping)[](#l1.116)self.assertTrue(issubclass(OrderedDict, MutableMapping))[](#l1.117)
- def test_clear(self):
pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)][](#l1.120)shuffle(pairs)[](#l1.121)od = OrderedDict(pairs)[](#l1.122)self.assertEqual(len(od), len(pairs))[](#l1.123)od.clear()[](#l1.124)self.assertEqual(len(od), 0)[](#l1.125)
- def test_delitem(self):
pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)][](#l1.128)od = OrderedDict(pairs)[](#l1.129)del od['a'][](#l1.130)self.assertNotIn('a', od)[](#l1.131)with self.assertRaises(KeyError):[](#l1.132)del od['a'][](#l1.133)self.assertEqual(list(od.items()), pairs[:2] + pairs[3:])[](#l1.134)
- def test_setitem(self):
od = OrderedDict([('d', 1), ('b', 2), ('c', 3), ('a', 4), ('e', 5)])[](#l1.137)od['c'] = 10 # existing element[](#l1.138)od['f'] = 20 # new element[](#l1.139)self.assertEqual(list(od.items()),[](#l1.140)[('d', 1), ('b', 2), ('c', 10), ('a', 4), ('e', 5), ('f', 20)])[](#l1.141)
- def test_iterators(self):
pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)][](#l1.144)shuffle(pairs)[](#l1.145)od = OrderedDict(pairs)[](#l1.146)self.assertEqual(list(od), [t[0] for t in pairs])[](#l1.147)self.assertEqual(list(od.keys()), [t[0] for t in pairs])[](#l1.148)self.assertEqual(list(od.values()), [t[1] for t in pairs])[](#l1.149)self.assertEqual(list(od.items()), pairs)[](#l1.150)self.assertEqual(list(reversed(od)),[](#l1.151)[t[0] for t in reversed(pairs)])[](#l1.152)
- def test_popitem(self):
pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)][](#l1.155)shuffle(pairs)[](#l1.156)od = OrderedDict(pairs)[](#l1.157)while pairs:[](#l1.158)self.assertEqual(od.popitem(), pairs.pop())[](#l1.159)with self.assertRaises(KeyError):[](#l1.160)od.popitem()[](#l1.161)self.assertEqual(len(od), 0)[](#l1.162)
- def test_pop(self):
pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)][](#l1.165)shuffle(pairs)[](#l1.166)od = OrderedDict(pairs)[](#l1.167)shuffle(pairs)[](#l1.168)while pairs:[](#l1.169)k, v = pairs.pop()[](#l1.170)self.assertEqual(od.pop(k), v)[](#l1.171)with self.assertRaises(KeyError):[](#l1.172)od.pop('xyz')[](#l1.173)self.assertEqual(len(od), 0)[](#l1.174)self.assertEqual(od.pop(k, 12345), 12345)[](#l1.175)
# make sure pop still works when __missing__ is defined[](#l1.177)class Missing(OrderedDict):[](#l1.178)def __missing__(self, key):[](#l1.179)return 0[](#l1.180)m = Missing(a=1)[](#l1.181)self.assertEqual(m.pop('b', 5), 5)[](#l1.182)self.assertEqual(m.pop('a', 6), 1)[](#l1.183)self.assertEqual(m.pop('a', 6), 6)[](#l1.184)with self.assertRaises(KeyError):[](#l1.185)m.pop('a')[](#l1.186)
- def test_equality(self):
pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)][](#l1.189)shuffle(pairs)[](#l1.190)od1 = OrderedDict(pairs)[](#l1.191)od2 = OrderedDict(pairs)[](#l1.192)self.assertEqual(od1, od2) # same order implies equality[](#l1.193)pairs = pairs[2:] + pairs[:2][](#l1.194)od2 = OrderedDict(pairs)[](#l1.195)self.assertNotEqual(od1, od2) # different order implies inequality[](#l1.196)# comparison to regular dict is not order sensitive[](#l1.197)self.assertEqual(od1, dict(od2))[](#l1.198)self.assertEqual(dict(od2), od1)[](#l1.199)# different length implied inequality[](#l1.200)self.assertNotEqual(od1, OrderedDict(pairs[:-1]))[](#l1.201)
- def test_copying(self):
# Check that ordered dicts are copyable, deepcopyable, picklable,[](#l1.204)# and have a repr/eval round-trip[](#l1.205)pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)][](#l1.206)od = OrderedDict(pairs)[](#l1.207)def check(dup):[](#l1.208)msg = "\ncopy: %s\nod: %s" % (dup, od)[](#l1.209)self.assertIsNot(dup, od, msg)[](#l1.210)self.assertEqual(dup, od)[](#l1.211)check(od.copy())[](#l1.212)check(copy.copy(od))[](#l1.213)check(copy.deepcopy(od))[](#l1.214)for proto in range(pickle.HIGHEST_PROTOCOL + 1):[](#l1.215)with self.subTest(proto=proto):[](#l1.216)check(pickle.loads(pickle.dumps(od, proto)))[](#l1.217)check(eval(repr(od)))[](#l1.218)update_test = OrderedDict()[](#l1.219)update_test.update(od)[](#l1.220)check(update_test)[](#l1.221)check(OrderedDict(od))[](#l1.222)
- def test_yaml_linkage(self):
# Verify that __reduce__ is setup in a way that supports PyYAML's dump() feature.[](#l1.225)# In yaml, lists are native but tuples are not.[](#l1.226)pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)][](#l1.227)od = OrderedDict(pairs)[](#l1.228)# yaml.dump(od) -->[](#l1.229)# '!!python/object/apply:__main__.OrderedDict\n- - [a, 1]\n - [b, 2]\n'[](#l1.230)self.assertTrue(all(type(pair)==list for pair in od.__reduce__()[1]))[](#l1.231)
- def test_reduce_not_too_fat(self):
# do not save instance dictionary if not needed[](#l1.234)pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)][](#l1.235)od = OrderedDict(pairs)[](#l1.236)self.assertIsNone(od.__reduce__()[2])[](#l1.237)od.x = 10[](#l1.238)self.assertIsNotNone(od.__reduce__()[2])[](#l1.239)
- def test_pickle_recursive(self):
od = OrderedDict()[](#l1.242)od[1] = od[](#l1.243)for proto in range(-1, pickle.HIGHEST_PROTOCOL + 1):[](#l1.244)dup = pickle.loads(pickle.dumps(od, proto))[](#l1.245)self.assertIsNot(dup, od)[](#l1.246)self.assertEqual(list(dup.keys()), [1])[](#l1.247)self.assertIs(dup[1], dup)[](#l1.248)
- def test_repr(self):
od = OrderedDict([('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)])[](#l1.251)self.assertEqual(repr(od),[](#l1.252)"OrderedDict([('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)])")[](#l1.253)self.assertEqual(eval(repr(od)), od)[](#l1.254)self.assertEqual(repr(OrderedDict()), "OrderedDict()")[](#l1.255)
- def test_repr_recursive(self):
# See issue #9826[](#l1.258)od = OrderedDict.fromkeys('abc')[](#l1.259)od['x'] = od[](#l1.260)self.assertEqual(repr(od),[](#l1.261)"OrderedDict([('a', None), ('b', None), ('c', None), ('x', ...)])")[](#l1.262)
- def test_setdefault(self):
pairs = [('c', 1), ('b', 2), ('a', 3), ('d', 4), ('e', 5), ('f', 6)][](#l1.265)shuffle(pairs)[](#l1.266)od = OrderedDict(pairs)[](#l1.267)pair_order = list(od.items())[](#l1.268)self.assertEqual(od.setdefault('a', 10), 3)[](#l1.269)# make sure order didn't change[](#l1.270)self.assertEqual(list(od.items()), pair_order)[](#l1.271)self.assertEqual(od.setdefault('x', 10), 10)[](#l1.272)# make sure 'x' is added to the end[](#l1.273)self.assertEqual(list(od.items())[-1], ('x', 10))[](#l1.274)
# make sure setdefault still works when __missing__ is defined[](#l1.276)class Missing(OrderedDict):[](#l1.277)def __missing__(self, key):[](#l1.278)return 0[](#l1.279)self.assertEqual(Missing().setdefault(5, 9), 9)[](#l1.280)
- def test_reinsert(self):
# Given insert a, insert b, delete a, re-insert a,[](#l1.283)# verify that a is now later than b.[](#l1.284)od = OrderedDict()[](#l1.285)od['a'] = 1[](#l1.286)od['b'] = 2[](#l1.287)del od['a'][](#l1.288)od['a'] = 1[](#l1.289)self.assertEqual(list(od.items()), [('b', 2), ('a', 1)])[](#l1.290)
- def test_move_to_end(self):
od = OrderedDict.fromkeys('abcde')[](#l1.293)self.assertEqual(list(od), list('abcde'))[](#l1.294)od.move_to_end('c')[](#l1.295)self.assertEqual(list(od), list('abdec'))[](#l1.296)od.move_to_end('c', 0)[](#l1.297)self.assertEqual(list(od), list('cabde'))[](#l1.298)od.move_to_end('c', 0)[](#l1.299)self.assertEqual(list(od), list('cabde'))[](#l1.300)od.move_to_end('e')[](#l1.301)self.assertEqual(list(od), list('cabde'))[](#l1.302)with self.assertRaises(KeyError):[](#l1.303)od.move_to_end('x')[](#l1.304)
- def test_sizeof(self):
# Wimpy test: Just verify the reported size is larger than a regular dict[](#l1.307)d = dict(a=1)[](#l1.308)od = OrderedDict(**d)[](#l1.309)self.assertGreater(sys.getsizeof(od), sys.getsizeof(d))[](#l1.310)
- def test_override_update(self):
# Verify that subclasses can override update() without breaking __init__()[](#l1.313)class MyOD(OrderedDict):[](#l1.314)def update(self, *args, **kwds):[](#l1.315)raise Exception()[](#l1.316)items = [('a', 1), ('c', 3), ('b', 2)][](#l1.317)self.assertEqual(list(MyOD(items).items()), items)[](#l1.318)
- -class GeneralMappingTests(mapping_tests.BasicTestMappingProtocol):
- def test_popitem(self):
d = self._empty_mapping()[](#l1.324)self.assertRaises(KeyError, d.popitem)[](#l1.325)
- -class MyOrderedDict(OrderedDict):
- -class SubclassMappingTests(mapping_tests.BasicTestMappingProtocol):
- def test_popitem(self):
d = self._empty_mapping()[](#l1.334)self.assertRaises(KeyError, d.popitem)[](#l1.335)
- - -################################################################################
Run tests
################################################################################ -import doctest, collections - def test_main(verbose=None): NamedTupleDocs = doctest.DocTestSuite(module=collections) test_classes = [TestNamedTuple, NamedTupleDocs, TestOneTrickPonyABCs,
TestCollectionABCs, TestCounter, TestChainMap,[](#l1.347)TestOrderedDict, GeneralMappingTests, SubclassMappingTests][](#l1.348)
support.run_unittest(*test_classes) support.run_doctest(collections, verbose)TestCollectionABCs, TestCounter, TestChainMap][](#l1.349)
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,1288 +1,13 @@ -"""Unit tests for collections.py.""" - -import unittest, doctest, operator -from test.support import TESTFN, forget, unlink -import inspect -from test import support -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 contextlib +import copy +import pickle +from random import shuffle import sys -from collections import UserDict -from collections import ChainMap -from collections.abc import Hashable, Iterable, Iterator -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 - - -################################################################################ -### ChainMap (helper class for configparser and the string module) -################################################################################ - -class TestChainMap(unittest.TestCase): -
- def test_basics(self):
c = ChainMap()[](#l2.40)c['a'] = 1[](#l2.41)c['b'] = 2[](#l2.42)d = c.new_child()[](#l2.43)d['b'] = 20[](#l2.44)d['c'] = 30[](#l2.45)self.assertEqual(d.maps, [{'b':20, 'c':30}, {'a':1, 'b':2}]) # check internal state[](#l2.46)self.assertEqual(d.items(), dict(a=1, b=20, c=30).items()) # check items/iter/getitem[](#l2.47)self.assertEqual(len(d), 3) # check len[](#l2.48)for key in 'abc': # check contains[](#l2.49)self.assertIn(key, d)[](#l2.50)for k, v in dict(a=1, b=20, c=30, z=100).items(): # check get[](#l2.51)self.assertEqual(d.get(k, 100), v)[](#l2.52)
del d['b'] # unmask a value[](#l2.54)self.assertEqual(d.maps, [{'c':30}, {'a':1, 'b':2}]) # check internal state[](#l2.55)self.assertEqual(d.items(), dict(a=1, b=2, c=30).items()) # check items/iter/getitem[](#l2.56)self.assertEqual(len(d), 3) # check len[](#l2.57)for key in 'abc': # check contains[](#l2.58)self.assertIn(key, d)[](#l2.59)for k, v in dict(a=1, b=2, c=30, z=100).items(): # check get[](#l2.60)self.assertEqual(d.get(k, 100), v)[](#l2.61)self.assertIn(repr(d), [ # check repr[](#l2.62)type(d).__name__ + "({'c': 30}, {'a': 1, 'b': 2})",[](#l2.63)type(d).__name__ + "({'c': 30}, {'b': 2, 'a': 1})"[](#l2.64)])[](#l2.65)
for e in d.copy(), copy.copy(d): # check shallow copies[](#l2.67)self.assertEqual(d, e)[](#l2.68)self.assertEqual(d.maps, e.maps)[](#l2.69)self.assertIsNot(d, e)[](#l2.70)self.assertIsNot(d.maps[0], e.maps[0])[](#l2.71)for m1, m2 in zip(d.maps[1:], e.maps[1:]):[](#l2.72)self.assertIs(m1, m2)[](#l2.73)
# check deep copies[](#l2.75)for proto in range(pickle.HIGHEST_PROTOCOL + 1):[](#l2.76)e = pickle.loads(pickle.dumps(d, proto))[](#l2.77)self.assertEqual(d, e)[](#l2.78)self.assertEqual(d.maps, e.maps)[](#l2.79)self.assertIsNot(d, e)[](#l2.80)for m1, m2 in zip(d.maps, e.maps):[](#l2.81)self.assertIsNot(m1, m2, e)[](#l2.82)for e in [copy.deepcopy(d),[](#l2.83)eval(repr(d))[](#l2.84)]:[](#l2.85)self.assertEqual(d, e)[](#l2.86)self.assertEqual(d.maps, e.maps)[](#l2.87)self.assertIsNot(d, e)[](#l2.88)for m1, m2 in zip(d.maps, e.maps):[](#l2.89)self.assertIsNot(m1, m2, e)[](#l2.90)
f = d.new_child()[](#l2.92)f['b'] = 5[](#l2.93)self.assertEqual(f.maps, [{'b': 5}, {'c':30}, {'a':1, 'b':2}])[](#l2.94)self.assertEqual(f.parents.maps, [{'c':30}, {'a':1, 'b':2}]) # check parents[](#l2.95)self.assertEqual(f['b'], 5) # find first in chain[](#l2.96)self.assertEqual(f.parents['b'], 2) # look beyond maps[0][](#l2.97)
- def test_contructor(self):
self.assertEqual(ChainMap().maps, [{}]) # no-args --> one new dict[](#l2.100)self.assertEqual(ChainMap({1:2}).maps, [{1:2}]) # 1 arg --> list[](#l2.101)
- def test_bool(self):
self.assertFalse(ChainMap())[](#l2.104)self.assertFalse(ChainMap({}, {}))[](#l2.105)self.assertTrue(ChainMap({1:2}, {}))[](#l2.106)self.assertTrue(ChainMap({}, {1:2}))[](#l2.107)
- def test_missing(self):
class DefaultChainMap(ChainMap):[](#l2.110)def __missing__(self, key):[](#l2.111)return 999[](#l2.112)d = DefaultChainMap(dict(a=1, b=2), dict(b=20, c=30))[](#l2.113)for k, v in dict(a=1, b=2, c=30, d=999).items():[](#l2.114)self.assertEqual(d[k], v) # check __getitem__ w/missing[](#l2.115)for k, v in dict(a=1, b=2, c=30, d=77).items():[](#l2.116)self.assertEqual(d.get(k, 77), v) # check get() w/ missing[](#l2.117)for k, v in dict(a=True, b=True, c=True, d=False).items():[](#l2.118)self.assertEqual(k in d, v) # check __contains__ w/missing[](#l2.119)self.assertEqual(d.pop('a', 1001), 1, d)[](#l2.120)self.assertEqual(d.pop('a', 1002), 1002) # check pop() w/missing[](#l2.121)self.assertEqual(d.popitem(), ('b', 2)) # check popitem() w/missing[](#l2.122)with self.assertRaises(KeyError):[](#l2.123)d.popitem()[](#l2.124)
- def test_dict_coercion(self):
d = ChainMap(dict(a=1, b=2), dict(b=20, c=30))[](#l2.127)self.assertEqual(dict(d), dict(a=1, b=2, c=30))[](#l2.128)self.assertEqual(dict(d.items()), dict(a=1, b=2, c=30))[](#l2.129)
- def test_new_child(self):
'Tests for changes for issue #16613.'[](#l2.132)c = ChainMap()[](#l2.133)c['a'] = 1[](#l2.134)c['b'] = 2[](#l2.135)m = {'b':20, 'c': 30}[](#l2.136)d = c.new_child(m)[](#l2.137)self.assertEqual(d.maps, [{'b':20, 'c':30}, {'a':1, 'b':2}]) # check internal state[](#l2.138)self.assertIs(m, d.maps[0])[](#l2.139)
# Use a different map than a dict[](#l2.141)class lowerdict(dict):[](#l2.142)def __getitem__(self, key):[](#l2.143)if isinstance(key, str):[](#l2.144)key = key.lower()[](#l2.145)return dict.__getitem__(self, key)[](#l2.146)def __contains__(self, key):[](#l2.147)if isinstance(key, str):[](#l2.148)key = key.lower()[](#l2.149)return dict.__contains__(self, key)[](#l2.150)
c = ChainMap()[](#l2.152)c['a'] = 1[](#l2.153)c['b'] = 2[](#l2.154)m = lowerdict(b=20, c=30)[](#l2.155)d = c.new_child(m)[](#l2.156)self.assertIs(m, d.maps[0])[](#l2.157)for key in 'abc': # check contains[](#l2.158)self.assertIn(key, d)[](#l2.159)for k, v in dict(a=1, B=20, C=30, z=100).items(): # check get[](#l2.160)self.assertEqual(d.get(k, 100), v)[](#l2.161)
- - -################################################################################ -### 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.173)self.assertEqual(Point.__name__, 'Point')[](#l2.174)self.assertEqual(Point.__slots__, ())[](#l2.175)self.assertEqual(Point.__module__, __name__)[](#l2.176)self.assertEqual(Point.__getitem__, tuple.__getitem__)[](#l2.177)self.assertEqual(Point._fields, ('x', 'y'))[](#l2.178)self.assertIn('class Point(tuple)', Point._source)[](#l2.179)
self.assertRaises(ValueError, namedtuple, 'abc%', 'efg ghi') # type has non-alpha char[](#l2.181)self.assertRaises(ValueError, namedtuple, 'class', 'efg ghi') # type has keyword[](#l2.182)self.assertRaises(ValueError, namedtuple, '9abc', 'efg ghi') # type starts with digit[](#l2.183)
self.assertRaises(ValueError, namedtuple, 'abc', 'efg g%hi') # field with non-alpha char[](#l2.185)self.assertRaises(ValueError, namedtuple, 'abc', 'abc class') # field has keyword[](#l2.186)self.assertRaises(ValueError, namedtuple, 'abc', '8efg 9ghi') # field starts with digit[](#l2.187)self.assertRaises(ValueError, namedtuple, 'abc', '_efg ghi') # field with leading underscore[](#l2.188)self.assertRaises(ValueError, namedtuple, 'abc', 'efg efg ghi') # duplicate field[](#l2.189)
namedtuple('Point0', 'x1 y2') # Verify that numbers are allowed in names[](#l2.191)namedtuple('_', 'a b c') # Test leading underscores in a typename[](#l2.192)
nt = namedtuple('nt', 'the quick brown fox') # check unicode input[](#l2.194)self.assertNotIn("u'", repr(nt._fields))[](#l2.195)nt = namedtuple('nt', ('the', 'quick')) # check unicode input[](#l2.196)self.assertNotIn("u'", repr(nt._fields))[](#l2.197)
self.assertRaises(TypeError, Point._make, [11]) # catch too few args[](#l2.199)self.assertRaises(TypeError, Point._make, [11, 22, 33]) # catch too many args[](#l2.200)
- @unittest.skipIf(sys.flags.optimize >= 2,
"Docstrings are omitted with -O2 and above")[](#l2.203)- def test_factory_doc_attr(self):
Point = namedtuple('Point', 'x y')[](#l2.205)self.assertEqual(Point.__doc__, 'Point(x, y)')[](#l2.206)
- def test_name_fixer(self):
for spec, renamed in [[](#l2.209)[('efg', 'g%hi'), ('efg', '_1')], # field with non-alpha char[](#l2.210)[('abc', 'class'), ('abc', '_1')], # field has keyword[](#l2.211)[('8efg', '9ghi'), ('_0', '_1')], # field starts with digit[](#l2.212)[('abc', '_efg'), ('abc', '_1')], # field with leading underscore[](#l2.213)[('abc', 'efg', 'efg', 'ghi'), ('abc', 'efg', '_2', 'ghi')], # duplicate field[](#l2.214)[('abc', '', 'x'), ('abc', '_1', 'x')], # fieldname is a space[](#l2.215)]:[](#l2.216)self.assertEqual(namedtuple('NT', spec, rename=True)._fields, renamed)[](#l2.217)
- def test_instance(self):
Point = namedtuple('Point', 'x y')[](#l2.220)p = Point(11, 22)[](#l2.221)self.assertEqual(p, Point(x=11, y=22))[](#l2.222)self.assertEqual(p, Point(11, y=22))[](#l2.223)self.assertEqual(p, Point(y=22, x=11))[](#l2.224)self.assertEqual(p, Point(*(11, 22)))[](#l2.225)self.assertEqual(p, Point(**dict(x=11, y=22)))[](#l2.226)self.assertRaises(TypeError, Point, 1) # too few args[](#l2.227)self.assertRaises(TypeError, Point, 1, 2, 3) # too many args[](#l2.228)self.assertRaises(TypeError, eval, 'Point(XXX=1, y=2)', locals()) # wrong keyword argument[](#l2.229)self.assertRaises(TypeError, eval, 'Point(x=1)', locals()) # missing keyword argument[](#l2.230)self.assertEqual(repr(p), 'Point(x=11, y=22)')[](#l2.231)self.assertNotIn('__weakref__', dir(p))[](#l2.232)self.assertEqual(p, Point._make([11, 22])) # test _make classmethod[](#l2.233)self.assertEqual(p._fields, ('x', 'y')) # test _fields attribute[](#l2.234)self.assertEqual(p._replace(x=1), (1, 22)) # test _replace method[](#l2.235)self.assertEqual(p._asdict(), dict(x=11, y=22)) # test _asdict method[](#l2.236)
try:[](#l2.238)p._replace(x=1, error=2)[](#l2.239)except ValueError:[](#l2.240)pass[](#l2.241)else:[](#l2.242)self._fail('Did not detect an incorrect fieldname')[](#l2.243)
# verify that field string can have commas[](#l2.245)Point = namedtuple('Point', 'x, y')[](#l2.246)p = Point(x=11, y=22)[](#l2.247)self.assertEqual(repr(p), 'Point(x=11, y=22)')[](#l2.248)
# verify that fieldspec can be a non-string sequence[](#l2.250)Point = namedtuple('Point', ('x', 'y'))[](#l2.251)p = Point(x=11, y=22)[](#l2.252)self.assertEqual(repr(p), 'Point(x=11, y=22)')[](#l2.253)
- def test_tupleness(self):
Point = namedtuple('Point', 'x y')[](#l2.256)p = Point(11, 22)[](#l2.257)
self.assertIsInstance(p, tuple)[](#l2.259)self.assertEqual(p, (11, 22)) # matches a real tuple[](#l2.260)self.assertEqual(tuple(p), (11, 22)) # coercable to a real tuple[](#l2.261)self.assertEqual(list(p), [11, 22]) # coercable to a list[](#l2.262)self.assertEqual(max(p), 22) # iterable[](#l2.263)self.assertEqual(max(*p), 22) # star-able[](#l2.264)x, y = p[](#l2.265)self.assertEqual(p, (x, y)) # unpacks like a tuple[](#l2.266)self.assertEqual((p[0], p[1]), (11, 22)) # indexable like a tuple[](#l2.267)self.assertRaises(IndexError, p.__getitem__, 3)[](#l2.268)
self.assertEqual(p.x, x)[](#l2.270)self.assertEqual(p.y, y)[](#l2.271)self.assertRaises(AttributeError, eval, 'p.z', locals())[](#l2.272)
- def test_odd_sizes(self):
Zero = namedtuple('Zero', '')[](#l2.275)self.assertEqual(Zero(), ())[](#l2.276)self.assertEqual(Zero._make([]), ())[](#l2.277)self.assertEqual(repr(Zero()), 'Zero()')[](#l2.278)self.assertEqual(Zero()._asdict(), {})[](#l2.279)self.assertEqual(Zero()._fields, ())[](#l2.280)
Dot = namedtuple('Dot', 'd')[](#l2.282)self.assertEqual(Dot(1), (1,))[](#l2.283)self.assertEqual(Dot._make([1]), (1,))[](#l2.284)self.assertEqual(Dot(1).d, 1)[](#l2.285)self.assertEqual(repr(Dot(1)), 'Dot(d=1)')[](#l2.286)self.assertEqual(Dot(1)._asdict(), {'d':1})[](#l2.287)self.assertEqual(Dot(1)._replace(d=999), (999,))[](#l2.288)self.assertEqual(Dot(1)._fields, ('d',))[](#l2.289)
# n = 5000[](#l2.291)n = 254 # SyntaxError: more than 255 arguments:[](#l2.292)import string, random[](#l2.293)names = list(set(''.join([random.choice(string.ascii_letters)[](#l2.294)for j in range(10)]) for i in range(n)))[](#l2.295)n = len(names)[](#l2.296)Big = namedtuple('Big', names)[](#l2.297)b = Big(*range(n))[](#l2.298)self.assertEqual(b, tuple(range(n)))[](#l2.299)self.assertEqual(Big._make(range(n)), tuple(range(n)))[](#l2.300)for pos, name in enumerate(names):[](#l2.301)self.assertEqual(getattr(b, name), pos)[](#l2.302)repr(b) # make sure repr() doesn't blow-up[](#l2.303)d = b._asdict()[](#l2.304)d_expected = dict(zip(names, range(n)))[](#l2.305)self.assertEqual(d, d_expected)[](#l2.306)b2 = b._replace(**dict([(names[1], 999),(names[-5], 42)]))[](#l2.307)b2_expected = list(range(n))[](#l2.308)b2_expected[1] = 999[](#l2.309)b2_expected[-5] = 42[](#l2.310)self.assertEqual(b2, tuple(b2_expected))[](#l2.311)self.assertEqual(b._fields, tuple(names))[](#l2.312)
- def test_pickle(self):
p = TestNT(x=10, y=20, z=30)[](#l2.315)for module in (pickle,):[](#l2.316)loads = getattr(module, 'loads')[](#l2.317)dumps = getattr(module, 'dumps')[](#l2.318)for protocol in range(-1, module.HIGHEST_PROTOCOL + 1):[](#l2.319)q = loads(dumps(p, protocol))[](#l2.320)self.assertEqual(p, q)[](#l2.321)self.assertEqual(p._fields, q._fields)[](#l2.322)self.assertNotIn(b'OrderedDict', dumps(p, protocol))[](#l2.323)
- def test_copy(self):
p = TestNT(x=10, y=20, z=30)[](#l2.326)for copier in copy.copy, copy.deepcopy:[](#l2.327)q = copier(p)[](#l2.328)self.assertEqual(p, q)[](#l2.329)self.assertEqual(p._fields, q._fields)[](#l2.330)
- def test_name_conflicts(self):
# Some names like "self", "cls", "tuple", "itemgetter", and "property"[](#l2.333)# failed when used as field names. Test to make sure these now work.[](#l2.334)T = namedtuple('T', 'itemgetter property self cls tuple')[](#l2.335)t = T(1, 2, 3, 4, 5)[](#l2.336)self.assertEqual(t, (1,2,3,4,5))[](#l2.337)newt = t._replace(itemgetter=10, property=20, self=30, cls=40, tuple=50)[](#l2.338)self.assertEqual(newt, (10,20,30,40,50))[](#l2.339)
# Broader test of all interesting names in a template[](#l2.341)with support.captured_stdout() as template:[](#l2.342)T = namedtuple('T', 'x', verbose=True)[](#l2.343)words = set(re.findall('[A-Za-z]+', template.getvalue()))[](#l2.344)words -= set(keyword.kwlist)[](#l2.345)T = namedtuple('T', words)[](#l2.346)# test __new__[](#l2.347)values = tuple(range(len(words)))[](#l2.348)t = T(*values)[](#l2.349)self.assertEqual(t, values)[](#l2.350)t = T(**dict(zip(T._fields, values)))[](#l2.351)self.assertEqual(t, values)[](#l2.352)# test _make[](#l2.353)t = T._make(values)[](#l2.354)self.assertEqual(t, values)[](#l2.355)# exercise __repr__[](#l2.356)repr(t)[](#l2.357)# test _asdict[](#l2.358)self.assertEqual(t._asdict(), dict(zip(T._fields, values)))[](#l2.359)# test _replace[](#l2.360)t = T._make(values)[](#l2.361)newvalues = tuple(v*10 for v in values)[](#l2.362)newt = t._replace(**dict(zip(T._fields, newvalues)))[](#l2.363)self.assertEqual(newt, newvalues)[](#l2.364)# test _fields[](#l2.365)self.assertEqual(T._fields, tuple(words))[](#l2.366)# test __getnewargs__[](#l2.367)self.assertEqual(t.__getnewargs__(), values)[](#l2.368)
- def test_repr(self):
with support.captured_stdout() as template:[](#l2.371)A = namedtuple('A', 'x', verbose=True)[](#l2.372)self.assertEqual(repr(A(1)), 'A(x=1)')[](#l2.373)# repr should show the name of the subclass[](#l2.374)class B(A):[](#l2.375)pass[](#l2.376)self.assertEqual(repr(B(1)), 'B(x=1)')[](#l2.377)
- def test_source(self):
# verify that _source can be run through exec()[](#l2.380)tmp = namedtuple('NTColor', 'red green blue')[](#l2.381)globals().pop('NTColor', None) # remove artifacts from other tests[](#l2.382)exec(tmp._source, globals())[](#l2.383)self.assertIn('NTColor', globals())[](#l2.384)c = NTColor(10, 20, 30)[](#l2.385)self.assertEqual((c.red, c.green, c.blue), (10, 20, 30))[](#l2.386)self.assertEqual(NTColor._fields, ('red', 'green', 'blue'))[](#l2.387)globals().pop('NTColor', None) # clean-up after this test[](#l2.388)
- def test_namedtuple_subclass_issue_24931(self):
class Point(namedtuple('_Point', ['x', 'y'])):[](#l2.392)pass[](#l2.393)
a = Point(3, 4)[](#l2.395)self.assertEqual(a._asdict(), OrderedDict([('x', 3), ('y', 4)]))[](#l2.396)
a.w = 5[](#l2.398)self.assertEqual(a.__dict__, {'w': 5})[](#l2.399)
- - -################################################################################ -### Abstract Base Classes -################################################################################ - -class ABCTestCase(unittest.TestCase): -
- def validate_abstract_methods(self, abc, *names):
methodstubs = dict.fromkeys(names, lambda s, *args: 0)[](#l2.409)
# everything should work will all required methods are present[](#l2.411)C = type('C', (abc,), methodstubs)[](#l2.412)C()[](#l2.413)
# instantiation should fail if a required method is missing[](#l2.415)for name in names:[](#l2.416)stubs = methodstubs.copy()[](#l2.417)del stubs[name][](#l2.418)C = type('C', (abc,), stubs)[](#l2.419)self.assertRaises(TypeError, C, name)[](#l2.420)
C = type('C', (object,), {'__hash__': None})[](#l2.425)setattr(C, name, stub)[](#l2.426)self.assertIsInstance(C(), abc)[](#l2.427)self.assertTrue(issubclass(C, abc))[](#l2.428)
C = type('C', (object,), {'__hash__': None})[](#l2.430)self.assertNotIsInstance(C(), abc)[](#l2.431)self.assertFalse(issubclass(C, abc))[](#l2.432)
- def validate_comparison(self, instance):
ops = ['lt', 'gt', 'le', 'ge', 'ne', 'or', 'and', 'xor', 'sub'][](#l2.435)operators = {}[](#l2.436)for op in ops:[](#l2.437)name = '__' + op + '__'[](#l2.438)operators[name] = getattr(operator, name)[](#l2.439)
class Other:[](#l2.441)def __init__(self):[](#l2.442)self.right_side = False[](#l2.443)def __eq__(self, other):[](#l2.444)self.right_side = True[](#l2.445)return True[](#l2.446)__lt__ = __eq__[](#l2.447)__gt__ = __eq__[](#l2.448)__le__ = __eq__[](#l2.449)__ge__ = __eq__[](#l2.450)__ne__ = __eq__[](#l2.451)__ror__ = __eq__[](#l2.452)__rand__ = __eq__[](#l2.453)__rxor__ = __eq__[](#l2.454)__rsub__ = __eq__[](#l2.455)
for name, op in operators.items():[](#l2.457)if not hasattr(instance, name):[](#l2.458)continue[](#l2.459)other = Other()[](#l2.460)op(instance, other)[](#l2.461)self.assertTrue(other.right_side,'Right side not called for %s.%s'[](#l2.462)% (type(instance), name))[](#l2.463)
- -class TestOneTrickPonyABCs(ABCTestCase): -
- def test_Hashable(self):
# Check some non-hashables[](#l2.468)non_samples = [bytearray(), list(), set(), dict()][](#l2.469)for x in non_samples:[](#l2.470)self.assertNotIsInstance(x, Hashable)[](#l2.471)self.assertFalse(issubclass(type(x), Hashable), repr(type(x)))[](#l2.472)# Check some hashables[](#l2.473)samples = [None,[](#l2.474)int(), float(), complex(),[](#l2.475)str(),[](#l2.476)tuple(), frozenset(),[](#l2.477)int, list, object, type, bytes()[](#l2.478)][](#l2.479)for x in samples:[](#l2.480)self.assertIsInstance(x, Hashable)[](#l2.481)self.assertTrue(issubclass(type(x), Hashable), repr(type(x)))[](#l2.482)self.assertRaises(TypeError, Hashable)[](#l2.483)# Check direct subclassing[](#l2.484)class H(Hashable):[](#l2.485)def __hash__(self):[](#l2.486)return super().__hash__()[](#l2.487)self.assertEqual(hash(H()), 0)[](#l2.488)self.assertFalse(issubclass(int, H))[](#l2.489)self.validate_abstract_methods(Hashable, '__hash__')[](#l2.490)self.validate_isinstance(Hashable, '__hash__')[](#l2.491)
- def test_Iterable(self):
# Check some non-iterables[](#l2.494)non_samples = [None, 42, 3.14, 1j][](#l2.495)for x in non_samples:[](#l2.496)self.assertNotIsInstance(x, Iterable)[](#l2.497)self.assertFalse(issubclass(type(x), Iterable), repr(type(x)))[](#l2.498)# Check some iterables[](#l2.499)samples = [bytes(), str(),[](#l2.500)tuple(), list(), set(), frozenset(), dict(),[](#l2.501)dict().keys(), dict().items(), dict().values(),[](#l2.502)(lambda: (yield))(),[](#l2.503)(x for x in []),[](#l2.504)][](#l2.505)for x in samples:[](#l2.506)self.assertIsInstance(x, Iterable)[](#l2.507)self.assertTrue(issubclass(type(x), Iterable), repr(type(x)))[](#l2.508)# Check direct subclassing[](#l2.509)class I(Iterable):[](#l2.510)def __iter__(self):[](#l2.511)return super().__iter__()[](#l2.512)self.assertEqual(list(I()), [])[](#l2.513)self.assertFalse(issubclass(str, I))[](#l2.514)self.validate_abstract_methods(Iterable, '__iter__')[](#l2.515)self.validate_isinstance(Iterable, '__iter__')[](#l2.516)
- def test_Iterator(self):
non_samples = [None, 42, 3.14, 1j, b"", "", (), [], {}, set()][](#l2.519)for x in non_samples:[](#l2.520)self.assertNotIsInstance(x, Iterator)[](#l2.521)self.assertFalse(issubclass(type(x), Iterator), repr(type(x)))[](#l2.522)samples = [iter(bytes()), iter(str()),[](#l2.523)iter(tuple()), iter(list()), iter(dict()),[](#l2.524)iter(set()), iter(frozenset()),[](#l2.525)iter(dict().keys()), iter(dict().items()),[](#l2.526)iter(dict().values()),[](#l2.527)(lambda: (yield))(),[](#l2.528)(x for x in []),[](#l2.529)][](#l2.530)for x in samples:[](#l2.531)self.assertIsInstance(x, Iterator)[](#l2.532)self.assertTrue(issubclass(type(x), Iterator), repr(type(x)))[](#l2.533)self.validate_abstract_methods(Iterator, '__next__', '__iter__')[](#l2.534)
# Issue 10565[](#l2.536)class NextOnly:[](#l2.537)def __next__(self):[](#l2.538)yield 1[](#l2.539)raise StopIteration[](#l2.540)self.assertNotIsInstance(NextOnly(), Iterator)[](#l2.541)
- def test_Sized(self):
non_samples = [None, 42, 3.14, 1j,[](#l2.544)(lambda: (yield))(),[](#l2.545)(x for x in []),[](#l2.546)][](#l2.547)for x in non_samples:[](#l2.548)self.assertNotIsInstance(x, Sized)[](#l2.549)self.assertFalse(issubclass(type(x), Sized), repr(type(x)))[](#l2.550)samples = [bytes(), str(),[](#l2.551)tuple(), list(), set(), frozenset(), dict(),[](#l2.552)dict().keys(), dict().items(), dict().values(),[](#l2.553)][](#l2.554)for x in samples:[](#l2.555)self.assertIsInstance(x, Sized)[](#l2.556)self.assertTrue(issubclass(type(x), Sized), repr(type(x)))[](#l2.557)self.validate_abstract_methods(Sized, '__len__')[](#l2.558)self.validate_isinstance(Sized, '__len__')[](#l2.559)
- def test_Container(self):
non_samples = [None, 42, 3.14, 1j,[](#l2.562)(lambda: (yield))(),[](#l2.563)(x for x in []),[](#l2.564)][](#l2.565)for x in non_samples:[](#l2.566)self.assertNotIsInstance(x, Container)[](#l2.567)self.assertFalse(issubclass(type(x), Container), repr(type(x)))[](#l2.568)samples = [bytes(), str(),[](#l2.569)tuple(), list(), set(), frozenset(), dict(),[](#l2.570)dict().keys(), dict().items(),[](#l2.571)][](#l2.572)for x in samples:[](#l2.573)self.assertIsInstance(x, Container)[](#l2.574)self.assertTrue(issubclass(type(x), Container), repr(type(x)))[](#l2.575)self.validate_abstract_methods(Container, '__contains__')[](#l2.576)self.validate_isinstance(Container, '__contains__')[](#l2.577)
- def test_Callable(self):
non_samples = [None, 42, 3.14, 1j,[](#l2.580)"", b"", (), [], {}, set(),[](#l2.581)(lambda: (yield))(),[](#l2.582)(x for x in []),[](#l2.583)][](#l2.584)for x in non_samples:[](#l2.585)self.assertNotIsInstance(x, Callable)[](#l2.586)self.assertFalse(issubclass(type(x), Callable), repr(type(x)))[](#l2.587)samples = [lambda: None,[](#l2.588)type, int, object,[](#l2.589)len,[](#l2.590)list.append, [].append,[](#l2.591)][](#l2.592)for x in samples:[](#l2.593)self.assertIsInstance(x, Callable)[](#l2.594)self.assertTrue(issubclass(type(x), Callable), repr(type(x)))[](#l2.595)self.validate_abstract_methods(Callable, '__call__')[](#l2.596)self.validate_isinstance(Callable, '__call__')[](#l2.597)
- def test_direct_subclassing(self):
for B in Hashable, Iterable, Iterator, Sized, Container, Callable:[](#l2.600)class C(B):[](#l2.601)pass[](#l2.602)self.assertTrue(issubclass(C, B))[](#l2.603)self.assertFalse(issubclass(int, C))[](#l2.604)
- def test_registration(self):
for B in Hashable, Iterable, Iterator, Sized, Container, Callable:[](#l2.607)class C:[](#l2.608)__hash__ = None # Make sure it isn't hashable by default[](#l2.609)self.assertFalse(issubclass(C, B), B.__name__)[](#l2.610)B.register(C)[](#l2.611)self.assertTrue(issubclass(C, B))[](#l2.612)
- -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.
+import unittest +from collections import OrderedDict +from collections.abc import MutableMapping +from test import mapping_tests, support
- def test_Set(self):
for sample in [set, frozenset]:[](#l2.645)self.assertIsInstance(sample(), Set)[](#l2.646)self.assertTrue(issubclass(sample, Set))[](#l2.647)self.validate_abstract_methods(Set, '__contains__', '__iter__', '__len__')[](#l2.648)class MySet(Set):[](#l2.649)def __contains__(self, x):[](#l2.650)return False[](#l2.651)def __len__(self):[](#l2.652)return 0[](#l2.653)def __iter__(self):[](#l2.654)return iter([])[](#l2.655)self.validate_comparison(MySet())[](#l2.656)
- def test_hash_Set(self):
class OneTwoThreeSet(Set):[](#l2.659)def __init__(self):[](#l2.660)self.contents = [1, 2, 3][](#l2.661)def __contains__(self, x):[](#l2.662)return x in self.contents[](#l2.663)def __len__(self):[](#l2.664)return len(self.contents)[](#l2.665)def __iter__(self):[](#l2.666)return iter(self.contents)[](#l2.667)def __hash__(self):[](#l2.668)return self._hash()[](#l2.669)a, b = OneTwoThreeSet(), OneTwoThreeSet()[](#l2.670)self.assertTrue(hash(a) == hash(b))[](#l2.671)
- def test_MutableSet(self):
self.assertIsInstance(set(), MutableSet)[](#l2.674)self.assertTrue(issubclass(set, MutableSet))[](#l2.675)self.assertNotIsInstance(frozenset(), MutableSet)[](#l2.676)self.assertFalse(issubclass(frozenset, MutableSet))[](#l2.677)self.validate_abstract_methods(MutableSet, '__contains__', '__iter__', '__len__',[](#l2.678)'add', 'discard')[](#l2.679)
- def test_issue_5647(self):
# MutableSet.__iand__ mutated the set during iteration[](#l2.682)s = WithSet('abcd')[](#l2.683)s &= WithSet('cdef') # This used to fail[](#l2.684)self.assertEqual(set(s), set('cd'))[](#l2.685)
- def test_issue_4920(self):
# MutableSet.pop() method did not work[](#l2.688)class MySet(MutableSet):[](#l2.689)__slots__=['__s'][](#l2.690)def __init__(self,items=None):[](#l2.691)if items is None:[](#l2.692)items=[][](#l2.693)self.__s=set(items)[](#l2.694)def __contains__(self,v):[](#l2.695)return v in self.__s[](#l2.696)def __iter__(self):[](#l2.697)return iter(self.__s)[](#l2.698)def __len__(self):[](#l2.699)return len(self.__s)[](#l2.700)def add(self,v):[](#l2.701)result=v not in self.__s[](#l2.702)self.__s.add(v)[](#l2.703)return result[](#l2.704)def discard(self,v):[](#l2.705)result=v in self.__s[](#l2.706)self.__s.discard(v)[](#l2.707)return result[](#l2.708)def __repr__(self):[](#l2.709)return "MySet(%s)" % repr(list(self))[](#l2.710)s = MySet([5,43,2,1])[](#l2.711)self.assertEqual(s.pop(), 1)[](#l2.712)
- def test_issue8750(self):
empty = WithSet()[](#l2.715)full = WithSet(range(10))[](#l2.716)s = WithSet(full)[](#l2.717)s -= s[](#l2.718)self.assertEqual(s, empty)[](#l2.719)s = WithSet(full)[](#l2.720)s ^= s[](#l2.721)self.assertEqual(s, empty)[](#l2.722)s = WithSet(full)[](#l2.723)s &= s[](#l2.724)self.assertEqual(s, full)[](#l2.725)s |= s[](#l2.726)self.assertEqual(s, full)[](#l2.727)
- def test_issue16373(self):
# Recursion error comparing comparable and noncomparable[](#l2.730)# Set instances[](#l2.731)class MyComparableSet(Set):[](#l2.732)def __contains__(self, x):[](#l2.733)return False[](#l2.734)def __len__(self):[](#l2.735)return 0[](#l2.736)def __iter__(self):[](#l2.737)return iter([])[](#l2.738)class MyNonComparableSet(Set):[](#l2.739)def __contains__(self, x):[](#l2.740)return False[](#l2.741)def __len__(self):[](#l2.742)return 0[](#l2.743)def __iter__(self):[](#l2.744)return iter([])[](#l2.745)def __le__(self, x):[](#l2.746)return NotImplemented[](#l2.747)def __lt__(self, x):[](#l2.748)return NotImplemented[](#l2.749)
cs = MyComparableSet()[](#l2.751)ncs = MyNonComparableSet()[](#l2.752)self.assertFalse(ncs < cs)[](#l2.753)self.assertTrue(ncs <= cs)[](#l2.754)self.assertFalse(ncs > cs)[](#l2.755)self.assertTrue(ncs >= cs)[](#l2.756)
- def assertSameSet(self, s1, s2):
# coerce both to a real set then check equality[](#l2.759)self.assertSetEqual(set(s1), set(s2))[](#l2.760)
- def test_Set_interoperability_with_real_sets(self):
# Issue: 8743[](#l2.763)class ListSet(Set):[](#l2.764)def __init__(self, elements=()):[](#l2.765)self.data = [][](#l2.766)for elem in elements:[](#l2.767)if elem not in self.data:[](#l2.768)self.data.append(elem)[](#l2.769)def __contains__(self, elem):[](#l2.770)return elem in self.data[](#l2.771)def __iter__(self):[](#l2.772)return iter(self.data)[](#l2.773)def __len__(self):[](#l2.774)return len(self.data)[](#l2.775)def __repr__(self):[](#l2.776)return 'Set({!r})'.format(self.data)[](#l2.777)
r1 = set('abc')[](#l2.779)r2 = set('bcd')[](#l2.780)r3 = set('abcde')[](#l2.781)f1 = ListSet('abc')[](#l2.782)f2 = ListSet('bcd')[](#l2.783)f3 = ListSet('abcde')[](#l2.784)l1 = list('abccba')[](#l2.785)l2 = list('bcddcb')[](#l2.786)l3 = list('abcdeedcba')[](#l2.787)
target = r1 & r2[](#l2.789)self.assertSameSet(f1 & f2, target)[](#l2.790)self.assertSameSet(f1 & r2, target)[](#l2.791)self.assertSameSet(r2 & f1, target)[](#l2.792)self.assertSameSet(f1 & l2, target)[](#l2.793)
target = r1 | r2[](#l2.795)self.assertSameSet(f1 | f2, target)[](#l2.796)self.assertSameSet(f1 | r2, target)[](#l2.797)self.assertSameSet(r2 | f1, target)[](#l2.798)self.assertSameSet(f1 | l2, target)[](#l2.799)
fwd_target = r1 - r2[](#l2.801)rev_target = r2 - r1[](#l2.802)self.assertSameSet(f1 - f2, fwd_target)[](#l2.803)self.assertSameSet(f2 - f1, rev_target)[](#l2.804)self.assertSameSet(f1 - r2, fwd_target)[](#l2.805)self.assertSameSet(f2 - r1, rev_target)[](#l2.806)self.assertSameSet(r1 - f2, fwd_target)[](#l2.807)self.assertSameSet(r2 - f1, rev_target)[](#l2.808)self.assertSameSet(f1 - l2, fwd_target)[](#l2.809)self.assertSameSet(f2 - l1, rev_target)[](#l2.810)
target = r1 ^ r2[](#l2.812)self.assertSameSet(f1 ^ f2, target)[](#l2.813)self.assertSameSet(f1 ^ r2, target)[](#l2.814)self.assertSameSet(r2 ^ f1, target)[](#l2.815)self.assertSameSet(f1 ^ l2, target)[](#l2.816)
# Don't change the following to use assertLess or other[](#l2.818)# "more specific" unittest assertions. The current[](#l2.819)# assertTrue/assertFalse style makes the pattern of test[](#l2.820)# case combinations clear and allows us to know for sure[](#l2.821)# the exact operator being invoked.[](#l2.822)
# proper subset[](#l2.824)self.assertTrue(f1 < f3)[](#l2.825)self.assertFalse(f1 < f1)[](#l2.826)self.assertFalse(f1 < f2)[](#l2.827)self.assertTrue(r1 < f3)[](#l2.828)self.assertFalse(r1 < f1)[](#l2.829)self.assertFalse(r1 < f2)[](#l2.830)self.assertTrue(r1 < r3)[](#l2.831)self.assertFalse(r1 < r1)[](#l2.832)self.assertFalse(r1 < r2)[](#l2.833)with self.assertRaises(TypeError):[](#l2.834)f1 < l3[](#l2.835)with self.assertRaises(TypeError):[](#l2.836)f1 < l1[](#l2.837)with self.assertRaises(TypeError):[](#l2.838)f1 < l2[](#l2.839)
# any subset[](#l2.841)self.assertTrue(f1 <= f3)[](#l2.842)self.assertTrue(f1 <= f1)[](#l2.843)self.assertFalse(f1 <= f2)[](#l2.844)self.assertTrue(r1 <= f3)[](#l2.845)self.assertTrue(r1 <= f1)[](#l2.846)self.assertFalse(r1 <= f2)[](#l2.847)self.assertTrue(r1 <= r3)[](#l2.848)self.assertTrue(r1 <= r1)[](#l2.849)self.assertFalse(r1 <= r2)[](#l2.850)with self.assertRaises(TypeError):[](#l2.851)f1 <= l3[](#l2.852)with self.assertRaises(TypeError):[](#l2.853)f1 <= l1[](#l2.854)with self.assertRaises(TypeError):[](#l2.855)f1 <= l2[](#l2.856)
# proper superset[](#l2.858)self.assertTrue(f3 > f1)[](#l2.859)self.assertFalse(f1 > f1)[](#l2.860)self.assertFalse(f2 > f1)[](#l2.861)self.assertTrue(r3 > r1)[](#l2.862)self.assertFalse(f1 > r1)[](#l2.863)self.assertFalse(f2 > r1)[](#l2.864)self.assertTrue(r3 > r1)[](#l2.865)self.assertFalse(r1 > r1)[](#l2.866)self.assertFalse(r2 > r1)[](#l2.867)with self.assertRaises(TypeError):[](#l2.868)f1 > l3[](#l2.869)with self.assertRaises(TypeError):[](#l2.870)f1 > l1[](#l2.871)with self.assertRaises(TypeError):[](#l2.872)f1 > l2[](#l2.873)
# any superset[](#l2.875)self.assertTrue(f3 >= f1)[](#l2.876)self.assertTrue(f1 >= f1)[](#l2.877)self.assertFalse(f2 >= f1)[](#l2.878)self.assertTrue(r3 >= r1)[](#l2.879)self.assertTrue(f1 >= r1)[](#l2.880)self.assertFalse(f2 >= r1)[](#l2.881)self.assertTrue(r3 >= r1)[](#l2.882)self.assertTrue(r1 >= r1)[](#l2.883)self.assertFalse(r2 >= r1)[](#l2.884)with self.assertRaises(TypeError):[](#l2.885)f1 >= l3[](#l2.886)with self.assertRaises(TypeError):[](#l2.887)f1 >=l1[](#l2.888)with self.assertRaises(TypeError):[](#l2.889)f1 >= l2[](#l2.890)
# equality[](#l2.892)self.assertTrue(f1 == f1)[](#l2.893)self.assertTrue(r1 == f1)[](#l2.894)self.assertTrue(f1 == r1)[](#l2.895)self.assertFalse(f1 == f3)[](#l2.896)self.assertFalse(r1 == f3)[](#l2.897)self.assertFalse(f1 == r3)[](#l2.898)self.assertFalse(f1 == l3)[](#l2.899)self.assertFalse(f1 == l1)[](#l2.900)self.assertFalse(f1 == l2)[](#l2.901)
# inequality[](#l2.903)self.assertFalse(f1 != f1)[](#l2.904)self.assertFalse(r1 != f1)[](#l2.905)self.assertFalse(f1 != r1)[](#l2.906)self.assertTrue(f1 != f3)[](#l2.907)self.assertTrue(r1 != f3)[](#l2.908)self.assertTrue(f1 != r3)[](#l2.909)self.assertTrue(f1 != l3)[](#l2.910)self.assertTrue(f1 != l1)[](#l2.911)self.assertTrue(f1 != l2)[](#l2.912)
- def test_Mapping(self):
for sample in [dict]:[](#l2.915)self.assertIsInstance(sample(), Mapping)[](#l2.916)self.assertTrue(issubclass(sample, Mapping))[](#l2.917)self.validate_abstract_methods(Mapping, '__contains__', '__iter__', '__len__',[](#l2.918)'__getitem__')[](#l2.919)class MyMapping(Mapping):[](#l2.920)def __len__(self):[](#l2.921)return 0[](#l2.922)def __getitem__(self, i):[](#l2.923)raise IndexError[](#l2.924)def __iter__(self):[](#l2.925)return iter(())[](#l2.926)self.validate_comparison(MyMapping())[](#l2.927)
- def test_MutableMapping(self):
for sample in [dict]:[](#l2.930)self.assertIsInstance(sample(), MutableMapping)[](#l2.931)self.assertTrue(issubclass(sample, MutableMapping))[](#l2.932)self.validate_abstract_methods(MutableMapping, '__contains__', '__iter__', '__len__',[](#l2.933)'__getitem__', '__setitem__', '__delitem__')[](#l2.934)
- def test_MutableMapping_subclass(self):
# Test issue 9214[](#l2.937)mymap = UserDict()[](#l2.938)mymap['red'] = 5[](#l2.939)self.assertIsInstance(mymap.keys(), Set)[](#l2.940)self.assertIsInstance(mymap.keys(), KeysView)[](#l2.941)self.assertIsInstance(mymap.items(), Set)[](#l2.942)self.assertIsInstance(mymap.items(), ItemsView)[](#l2.943)
mymap = UserDict()[](#l2.945)mymap['red'] = 5[](#l2.946)z = mymap.keys() | {'orange'}[](#l2.947)self.assertIsInstance(z, set)[](#l2.948)list(z)[](#l2.949)mymap['blue'] = 7 # Shouldn't affect 'z'[](#l2.950)self.assertEqual(sorted(z), ['orange', 'red'])[](#l2.951)
mymap = UserDict()[](#l2.953)mymap['red'] = 5[](#l2.954)z = mymap.items() | {('orange', 3)}[](#l2.955)self.assertIsInstance(z, set)[](#l2.956)list(z)[](#l2.957)mymap['blue'] = 7 # Shouldn't affect 'z'[](#l2.958)self.assertEqual(sorted(z), [('orange', 3), ('red', 5)])[](#l2.959)
- def test_Sequence(self):
for sample in [tuple, list, bytes, str]:[](#l2.962)self.assertIsInstance(sample(), Sequence)[](#l2.963)self.assertTrue(issubclass(sample, Sequence))[](#l2.964)self.assertIsInstance(range(10), Sequence)[](#l2.965)self.assertTrue(issubclass(range, Sequence))[](#l2.966)self.assertIsInstance(memoryview(b""), Sequence)[](#l2.967)self.assertTrue(issubclass(memoryview, Sequence))[](#l2.968)self.assertTrue(issubclass(str, Sequence))[](#l2.969)self.validate_abstract_methods(Sequence, '__contains__', '__iter__', '__len__',[](#l2.970)'__getitem__')[](#l2.971)
- def test_ByteString(self):
for sample in [bytes, bytearray]:[](#l2.974)self.assertIsInstance(sample(), ByteString)[](#l2.975)self.assertTrue(issubclass(sample, ByteString))[](#l2.976)for sample in [str, list, tuple]:[](#l2.977)self.assertNotIsInstance(sample(), ByteString)[](#l2.978)self.assertFalse(issubclass(sample, ByteString))[](#l2.979)self.assertNotIsInstance(memoryview(b""), ByteString)[](#l2.980)self.assertFalse(issubclass(memoryview, ByteString))[](#l2.981)
- def test_MutableSequence(self):
for sample in [tuple, str, bytes]:[](#l2.984)self.assertNotIsInstance(sample(), MutableSequence)[](#l2.985)self.assertFalse(issubclass(sample, MutableSequence))[](#l2.986)for sample in [list, bytearray]:[](#l2.987)self.assertIsInstance(sample(), MutableSequence)[](#l2.988)self.assertTrue(issubclass(sample, MutableSequence))[](#l2.989)self.assertFalse(issubclass(str, MutableSequence))[](#l2.990)self.validate_abstract_methods(MutableSequence, '__contains__', '__iter__',[](#l2.991)'__len__', '__getitem__', '__setitem__', '__delitem__', 'insert')[](#l2.992)
- def test_MutableSequence_mixins(self):
# Test the mixins of MutableSequence by creating a miminal concrete[](#l2.995)# class inherited from it.[](#l2.996)class MutableSequenceSubclass(MutableSequence):[](#l2.997)def __init__(self):[](#l2.998)self.lst = [][](#l2.999)
def __setitem__(self, index, value):[](#l2.1001)self.lst[index] = value[](#l2.1002)
def __getitem__(self, index):[](#l2.1004)return self.lst[index][](#l2.1005)
def __len__(self):[](#l2.1007)return len(self.lst)[](#l2.1008)
def __delitem__(self, index):[](#l2.1010)del self.lst[index][](#l2.1011)
def insert(self, index, value):[](#l2.1013)self.lst.insert(index, value)[](#l2.1014)
mss = MutableSequenceSubclass()[](#l2.1016)mss.append(0)[](#l2.1017)mss.extend((1, 2, 3, 4))[](#l2.1018)self.assertEqual(len(mss), 5)[](#l2.1019)self.assertEqual(mss[3], 3)[](#l2.1020)mss.reverse()[](#l2.1021)self.assertEqual(mss[3], 1)[](#l2.1022)mss.pop()[](#l2.1023)self.assertEqual(len(mss), 4)[](#l2.1024)mss.remove(3)[](#l2.1025)self.assertEqual(len(mss), 3)[](#l2.1026)mss += (10, 20, 30)[](#l2.1027)self.assertEqual(len(mss), 6)[](#l2.1028)self.assertEqual(mss[-1], 30)[](#l2.1029)mss.clear()[](#l2.1030)self.assertEqual(len(mss), 0)[](#l2.1031)
- -################################################################################ -### Counter -################################################################################ - -class CounterSubclassWithSetItem(Counter):
Test a counter subclass that overrides setitem
- def init(self, *args, **kwds):
self.called = False[](#l2.1040)Counter.__init__(self, *args, **kwds)[](#l2.1041)- def setitem(self, key, value):
self.called = True[](#l2.1043)Counter.__setitem__(self, key, value)[](#l2.1044)
- -class CounterSubclassWithGet(Counter):
Test a counter subclass that overrides get()
- def init(self, *args, **kwds):
self.called = False[](#l2.1049)Counter.__init__(self, *args, **kwds)[](#l2.1050)- def get(self, key, default):
self.called = True[](#l2.1052)return Counter.get(self, key, default)[](#l2.1053)
- -class TestCounter(unittest.TestCase): -
- def test_basics(self):
c = Counter('abcaba')[](#l2.1058)self.assertEqual(c, Counter({'a':3 , 'b': 2, 'c': 1}))[](#l2.1059)self.assertEqual(c, Counter(a=3, b=2, c=1))[](#l2.1060)self.assertIsInstance(c, dict)[](#l2.1061)self.assertIsInstance(c, Mapping)[](#l2.1062)self.assertTrue(issubclass(Counter, dict))[](#l2.1063)self.assertTrue(issubclass(Counter, Mapping))[](#l2.1064)self.assertEqual(len(c), 3)[](#l2.1065)self.assertEqual(sum(c.values()), 6)[](#l2.1066)self.assertEqual(sorted(c.values()), [1, 2, 3])[](#l2.1067)self.assertEqual(sorted(c.keys()), ['a', 'b', 'c'])[](#l2.1068)self.assertEqual(sorted(c), ['a', 'b', 'c'])[](#l2.1069)self.assertEqual(sorted(c.items()),[](#l2.1070)[('a', 3), ('b', 2), ('c', 1)])[](#l2.1071)self.assertEqual(c['b'], 2)[](#l2.1072)self.assertEqual(c['z'], 0)[](#l2.1073)self.assertEqual(c.__contains__('c'), True)[](#l2.1074)self.assertEqual(c.__contains__('z'), False)[](#l2.1075)self.assertEqual(c.get('b', 10), 2)[](#l2.1076)self.assertEqual(c.get('z', 10), 10)[](#l2.1077)self.assertEqual(c, dict(a=3, b=2, c=1))[](#l2.1078)self.assertEqual(repr(c), "Counter({'a': 3, 'b': 2, 'c': 1})")[](#l2.1079)self.assertEqual(c.most_common(), [('a', 3), ('b', 2), ('c', 1)])[](#l2.1080)for i in range(5):[](#l2.1081)self.assertEqual(c.most_common(i),[](#l2.1082)[('a', 3), ('b', 2), ('c', 1)][:i])[](#l2.1083)self.assertEqual(''.join(sorted(c.elements())), 'aaabbc')[](#l2.1084)c['a'] += 1 # increment an existing value[](#l2.1085)c['b'] -= 2 # sub existing value to zero[](#l2.1086)del c['c'] # remove an entry[](#l2.1087)del c['c'] # make sure that del doesn't raise KeyError[](#l2.1088)c['d'] -= 2 # sub from a missing value[](#l2.1089)c['e'] = -5 # directly assign a missing value[](#l2.1090)c['f'] += 4 # add to a missing value[](#l2.1091)self.assertEqual(c, dict(a=4, b=0, d=-2, e=-5, f=4))[](#l2.1092)self.assertEqual(''.join(sorted(c.elements())), 'aaaaffff')[](#l2.1093)self.assertEqual(c.pop('f'), 4)[](#l2.1094)self.assertNotIn('f', c)[](#l2.1095)for i in range(3):[](#l2.1096)elem, cnt = c.popitem()[](#l2.1097)self.assertNotIn(elem, c)[](#l2.1098)c.clear()[](#l2.1099)self.assertEqual(c, {})[](#l2.1100)self.assertEqual(repr(c), 'Counter()')[](#l2.1101)self.assertRaises(NotImplementedError, Counter.fromkeys, 'abc')[](#l2.1102)self.assertRaises(TypeError, hash, c)[](#l2.1103)c.update(dict(a=5, b=3))[](#l2.1104)c.update(c=1)[](#l2.1105)c.update(Counter('a' * 50 + 'b' * 30))[](#l2.1106)c.update() # test case with no args[](#l2.1107)c.__init__('a' * 500 + 'b' * 300)[](#l2.1108)c.__init__('cdc')[](#l2.1109)c.__init__()[](#l2.1110)self.assertEqual(c, dict(a=555, b=333, c=3, d=1))[](#l2.1111)self.assertEqual(c.setdefault('d', 5), 1)[](#l2.1112)self.assertEqual(c['d'], 1)[](#l2.1113)self.assertEqual(c.setdefault('e', 5), 5)[](#l2.1114)self.assertEqual(c['e'], 5)[](#l2.1115)
- def test_init(self):
self.assertEqual(list(Counter(self=42).items()), [('self', 42)])[](#l2.1118)self.assertEqual(list(Counter(iterable=42).items()), [('iterable', 42)])[](#l2.1119)self.assertEqual(list(Counter(iterable=None).items()), [('iterable', None)])[](#l2.1120)self.assertRaises(TypeError, Counter, 42)[](#l2.1121)self.assertRaises(TypeError, Counter, (), ())[](#l2.1122)self.assertRaises(TypeError, Counter.__init__)[](#l2.1123)
- def test_update(self):
c = Counter()[](#l2.1126)c.update(self=42)[](#l2.1127)self.assertEqual(list(c.items()), [('self', 42)])[](#l2.1128)c = Counter()[](#l2.1129)c.update(iterable=42)[](#l2.1130)self.assertEqual(list(c.items()), [('iterable', 42)])[](#l2.1131)c = Counter()[](#l2.1132)c.update(iterable=None)[](#l2.1133)self.assertEqual(list(c.items()), [('iterable', None)])[](#l2.1134)self.assertRaises(TypeError, Counter().update, 42)[](#l2.1135)self.assertRaises(TypeError, Counter().update, {}, {})[](#l2.1136)self.assertRaises(TypeError, Counter.update)[](#l2.1137)
- def test_copying(self):
# Check that counters are copyable, deepcopyable, picklable, and[](#l2.1140)#have a repr/eval round-trip[](#l2.1141)words = Counter('which witch had which witches wrist watch'.split())[](#l2.1142)def check(dup):[](#l2.1143)msg = "\ncopy: %s\nwords: %s" % (dup, words)[](#l2.1144)self.assertIsNot(dup, words, msg)[](#l2.1145)self.assertEqual(dup, words)[](#l2.1146)check(words.copy())[](#l2.1147)check(copy.copy(words))[](#l2.1148)check(copy.deepcopy(words))[](#l2.1149)for proto in range(pickle.HIGHEST_PROTOCOL + 1):[](#l2.1150)with self.subTest(proto=proto):[](#l2.1151)check(pickle.loads(pickle.dumps(words, proto)))[](#l2.1152)check(eval(repr(words)))[](#l2.1153)update_test = Counter()[](#l2.1154)update_test.update(words)[](#l2.1155)check(update_test)[](#l2.1156)check(Counter(words))[](#l2.1157)
- def test_copy_subclass(self):
class MyCounter(Counter):[](#l2.1160)pass[](#l2.1161)c = MyCounter('slartibartfast')[](#l2.1162)d = c.copy()[](#l2.1163)self.assertEqual(d, c)[](#l2.1164)self.assertEqual(len(d), len(c))[](#l2.1165)self.assertEqual(type(d), type(c))[](#l2.1166)
- def test_conversions(self):
# Convert to: set, list, dict[](#l2.1169)s = 'she sells sea shells by the sea shore'[](#l2.1170)self.assertEqual(sorted(Counter(s).elements()), sorted(s))[](#l2.1171)self.assertEqual(sorted(Counter(s)), sorted(set(s)))[](#l2.1172)self.assertEqual(dict(Counter(s)), dict(Counter(s).items()))[](#l2.1173)self.assertEqual(set(Counter(s)), set(s))[](#l2.1174)
- def test_invariant_for_the_in_operator(self):
c = Counter(a=10, b=-2, c=0)[](#l2.1177)for elem in c:[](#l2.1178)self.assertTrue(elem in c)[](#l2.1179)self.assertIn(elem, c)[](#l2.1180)
- def test_multiset_operations(self):
# Verify that adding a zero counter will strip zeros and negatives[](#l2.1183)c = Counter(a=10, b=-2, c=0) + Counter()[](#l2.1184)self.assertEqual(dict(c), dict(a=10))[](#l2.1185)
elements = 'abcd'[](#l2.1187)for i in range(1000):[](#l2.1188)# test random pairs of multisets[](#l2.1189)p = Counter(dict((elem, randrange(-2,4)) for elem in elements))[](#l2.1190)p.update(e=1, f=-1, g=0)[](#l2.1191)q = Counter(dict((elem, randrange(-2,4)) for elem in elements))[](#l2.1192)q.update(h=1, i=-1, j=0)[](#l2.1193)for counterop, numberop in [[](#l2.1194)(Counter.__add__, lambda x, y: max(0, x+y)),[](#l2.1195)(Counter.__sub__, lambda x, y: max(0, x-y)),[](#l2.1196)(Counter.__or__, lambda x, y: max(0,x,y)),[](#l2.1197)(Counter.__and__, lambda x, y: max(0, min(x,y))),[](#l2.1198)]:[](#l2.1199)result = counterop(p, q)[](#l2.1200)for x in elements:[](#l2.1201)self.assertEqual(numberop(p[x], q[x]), result[x],[](#l2.1202)(counterop, x, p, q))[](#l2.1203)# verify that results exclude non-positive counts[](#l2.1204)self.assertTrue(x>0 for x in result.values())[](#l2.1205)
elements = 'abcdef'[](#l2.1207)for i in range(100):[](#l2.1208)# verify that random multisets with no repeats are exactly like sets[](#l2.1209)p = Counter(dict((elem, randrange(0, 2)) for elem in elements))[](#l2.1210)q = Counter(dict((elem, randrange(0, 2)) for elem in elements))[](#l2.1211)for counterop, setop in [[](#l2.1212)(Counter.__sub__, set.__sub__),[](#l2.1213)(Counter.__or__, set.__or__),[](#l2.1214)(Counter.__and__, set.__and__),[](#l2.1215)]:[](#l2.1216)counter_result = counterop(p, q)[](#l2.1217)set_result = setop(set(p.elements()), set(q.elements()))[](#l2.1218)self.assertEqual(counter_result, dict.fromkeys(set_result, 1))[](#l2.1219)
- def test_inplace_operations(self):
elements = 'abcd'[](#l2.1222)for i in range(1000):[](#l2.1223)# test random pairs of multisets[](#l2.1224)p = Counter(dict((elem, randrange(-2,4)) for elem in elements))[](#l2.1225)p.update(e=1, f=-1, g=0)[](#l2.1226)q = Counter(dict((elem, randrange(-2,4)) for elem in elements))[](#l2.1227)q.update(h=1, i=-1, j=0)[](#l2.1228)for inplace_op, regular_op in [[](#l2.1229)(Counter.__iadd__, Counter.__add__),[](#l2.1230)(Counter.__isub__, Counter.__sub__),[](#l2.1231)(Counter.__ior__, Counter.__or__),[](#l2.1232)(Counter.__iand__, Counter.__and__),[](#l2.1233)]:[](#l2.1234)c = p.copy()[](#l2.1235)c_id = id(c)[](#l2.1236)regular_result = regular_op(c, q)[](#l2.1237)inplace_result = inplace_op(c, q)[](#l2.1238)self.assertEqual(inplace_result, regular_result)[](#l2.1239)self.assertEqual(id(inplace_result), c_id)[](#l2.1240)
- def test_subtract(self):
c = Counter(a=-5, b=0, c=5, d=10, e=15,g=40)[](#l2.1243)c.subtract(a=1, b=2, c=-3, d=10, e=20, f=30, h=-50)[](#l2.1244)self.assertEqual(c, Counter(a=-6, b=-2, c=8, d=0, e=-5, f=-30, g=40, h=50))[](#l2.1245)c = Counter(a=-5, b=0, c=5, d=10, e=15,g=40)[](#l2.1246)c.subtract(Counter(a=1, b=2, c=-3, d=10, e=20, f=30, h=-50))[](#l2.1247)self.assertEqual(c, Counter(a=-6, b=-2, c=8, d=0, e=-5, f=-30, g=40, h=50))[](#l2.1248)c = Counter('aaabbcd')[](#l2.1249)c.subtract('aaaabbcce')[](#l2.1250)self.assertEqual(c, Counter(a=-1, b=0, c=-1, d=1, e=-1))[](#l2.1251)
c = Counter()[](#l2.1253)c.subtract(self=42)[](#l2.1254)self.assertEqual(list(c.items()), [('self', -42)])[](#l2.1255)c = Counter()[](#l2.1256)c.subtract(iterable=42)[](#l2.1257)self.assertEqual(list(c.items()), [('iterable', -42)])[](#l2.1258)self.assertRaises(TypeError, Counter().subtract, 42)[](#l2.1259)self.assertRaises(TypeError, Counter().subtract, {}, {})[](#l2.1260)self.assertRaises(TypeError, Counter.subtract)[](#l2.1261)
- def test_unary(self):
c = Counter(a=-5, b=0, c=5, d=10, e=15,g=40)[](#l2.1264)self.assertEqual(dict(+c), dict(c=5, d=10, e=15, g=40))[](#l2.1265)self.assertEqual(dict(-c), dict(a=5))[](#l2.1266)
- def test_repr_nonsortable(self):
c = Counter(a=2, b=None)[](#l2.1269)r = repr(c)[](#l2.1270)self.assertIn("'a': 2", r)[](#l2.1271)self.assertIn("'b': None", r)[](#l2.1272)
- def test_helper_function(self):
# two paths, one for real dicts and one for other mappings[](#l2.1275)elems = list('abracadabra')[](#l2.1276)
d = dict()[](#l2.1278)_count_elements(d, elems)[](#l2.1279)self.assertEqual(d, {'a': 5, 'r': 2, 'b': 2, 'c': 1, 'd': 1})[](#l2.1280)
m = OrderedDict()[](#l2.1282)_count_elements(m, elems)[](#l2.1283)self.assertEqual(m,[](#l2.1284)OrderedDict([('a', 5), ('b', 2), ('r', 2), ('c', 1), ('d', 1)]))[](#l2.1285)
# test fidelity to the pure python version[](#l2.1287)c = CounterSubclassWithSetItem('abracadabra')[](#l2.1288)self.assertTrue(c.called)[](#l2.1289)self.assertEqual(dict(c), {'a': 5, 'b': 2, 'c': 1, 'd': 1, 'r':2 })[](#l2.1290)c = CounterSubclassWithGet('abracadabra')[](#l2.1291)self.assertTrue(c.called)[](#l2.1292)self.assertEqual(dict(c), {'a': 5, 'b': 2, 'c': 1, 'd': 1, 'r':2 })[](#l2.1293)
- - -################################################################################ -### OrderedDict -################################################################################ class TestOrderedDict(unittest.TestCase): @@ -1573,20 +298,5 @@ class SubclassMappingTests(mapping_tests 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.1315)TestOrderedDict, GeneralMappingTests, SubclassMappingTests][](#l2.1316)- support.run_unittest(*test_classes)
- support.run_doctest(collections, verbose)
--- a/Misc/NEWS +++ b/Misc/NEWS @@ -694,6 +694,9 @@ IDLE Tests ----- +- Issue #25616: Tests for OrderedDict are extracted from test_collections