+++ /dev/null
-import unittest\r
-from test import test_support\r
-from weakref import proxy, ref, WeakSet\r
-import operator\r
-import copy\r
-import string\r
-import os\r
-from random import randrange, shuffle\r
-import sys\r
-import warnings\r
-import collections\r
-import gc\r
-import contextlib\r
-\r
-\r
-class Foo:\r
- pass\r
-\r
-class SomeClass(object):\r
- def __init__(self, value):\r
- self.value = value\r
- def __eq__(self, other):\r
- if type(other) != type(self):\r
- return False\r
- return other.value == self.value\r
-\r
- def __ne__(self, other):\r
- return not self.__eq__(other)\r
-\r
- def __hash__(self):\r
- return hash((SomeClass, self.value))\r
-\r
-class TestWeakSet(unittest.TestCase):\r
-\r
- def setUp(self):\r
- # need to keep references to them\r
- self.items = [SomeClass(c) for c in ('a', 'b', 'c')]\r
- self.items2 = [SomeClass(c) for c in ('x', 'y', 'z')]\r
- self.letters = [SomeClass(c) for c in string.ascii_letters]\r
- self.s = WeakSet(self.items)\r
- self.d = dict.fromkeys(self.items)\r
- self.obj = SomeClass('F')\r
- self.fs = WeakSet([self.obj])\r
-\r
- def test_methods(self):\r
- weaksetmethods = dir(WeakSet)\r
- for method in dir(set):\r
- if method == 'test_c_api' or method.startswith('_'):\r
- continue\r
- self.assertIn(method, weaksetmethods,\r
- "WeakSet missing method " + method)\r
-\r
- def test_new_or_init(self):\r
- self.assertRaises(TypeError, WeakSet, [], 2)\r
-\r
- def test_len(self):\r
- self.assertEqual(len(self.s), len(self.d))\r
- self.assertEqual(len(self.fs), 1)\r
- del self.obj\r
- self.assertEqual(len(self.fs), 0)\r
-\r
- def test_contains(self):\r
- for c in self.letters:\r
- self.assertEqual(c in self.s, c in self.d)\r
- # 1 is not weakref'able, but that TypeError is caught by __contains__\r
- self.assertNotIn(1, self.s)\r
- self.assertIn(self.obj, self.fs)\r
- del self.obj\r
- self.assertNotIn(SomeClass('F'), self.fs)\r
-\r
- def test_union(self):\r
- u = self.s.union(self.items2)\r
- for c in self.letters:\r
- self.assertEqual(c in u, c in self.d or c in self.items2)\r
- self.assertEqual(self.s, WeakSet(self.items))\r
- self.assertEqual(type(u), WeakSet)\r
- self.assertRaises(TypeError, self.s.union, [[]])\r
- for C in set, frozenset, dict.fromkeys, list, tuple:\r
- x = WeakSet(self.items + self.items2)\r
- c = C(self.items2)\r
- self.assertEqual(self.s.union(c), x)\r
-\r
- def test_or(self):\r
- i = self.s.union(self.items2)\r
- self.assertEqual(self.s | set(self.items2), i)\r
- self.assertEqual(self.s | frozenset(self.items2), i)\r
-\r
- def test_intersection(self):\r
- i = self.s.intersection(self.items2)\r
- for c in self.letters:\r
- self.assertEqual(c in i, c in self.d and c in self.items2)\r
- self.assertEqual(self.s, WeakSet(self.items))\r
- self.assertEqual(type(i), WeakSet)\r
- for C in set, frozenset, dict.fromkeys, list, tuple:\r
- x = WeakSet([])\r
- self.assertEqual(self.s.intersection(C(self.items2)), x)\r
-\r
- def test_isdisjoint(self):\r
- self.assertTrue(self.s.isdisjoint(WeakSet(self.items2)))\r
- self.assertTrue(not self.s.isdisjoint(WeakSet(self.letters)))\r
-\r
- def test_and(self):\r
- i = self.s.intersection(self.items2)\r
- self.assertEqual(self.s & set(self.items2), i)\r
- self.assertEqual(self.s & frozenset(self.items2), i)\r
-\r
- def test_difference(self):\r
- i = self.s.difference(self.items2)\r
- for c in self.letters:\r
- self.assertEqual(c in i, c in self.d and c not in self.items2)\r
- self.assertEqual(self.s, WeakSet(self.items))\r
- self.assertEqual(type(i), WeakSet)\r
- self.assertRaises(TypeError, self.s.difference, [[]])\r
-\r
- def test_sub(self):\r
- i = self.s.difference(self.items2)\r
- self.assertEqual(self.s - set(self.items2), i)\r
- self.assertEqual(self.s - frozenset(self.items2), i)\r
-\r
- def test_symmetric_difference(self):\r
- i = self.s.symmetric_difference(self.items2)\r
- for c in self.letters:\r
- self.assertEqual(c in i, (c in self.d) ^ (c in self.items2))\r
- self.assertEqual(self.s, WeakSet(self.items))\r
- self.assertEqual(type(i), WeakSet)\r
- self.assertRaises(TypeError, self.s.symmetric_difference, [[]])\r
-\r
- def test_xor(self):\r
- i = self.s.symmetric_difference(self.items2)\r
- self.assertEqual(self.s ^ set(self.items2), i)\r
- self.assertEqual(self.s ^ frozenset(self.items2), i)\r
-\r
- def test_sub_and_super(self):\r
- pl, ql, rl = map(lambda s: [SomeClass(c) for c in s], ['ab', 'abcde', 'def'])\r
- p, q, r = map(WeakSet, (pl, ql, rl))\r
- self.assertTrue(p < q)\r
- self.assertTrue(p <= q)\r
- self.assertTrue(q <= q)\r
- self.assertTrue(q > p)\r
- self.assertTrue(q >= p)\r
- self.assertFalse(q < r)\r
- self.assertFalse(q <= r)\r
- self.assertFalse(q > r)\r
- self.assertFalse(q >= r)\r
- self.assertTrue(set('a').issubset('abc'))\r
- self.assertTrue(set('abc').issuperset('a'))\r
- self.assertFalse(set('a').issubset('cbs'))\r
- self.assertFalse(set('cbs').issuperset('a'))\r
-\r
- def test_gc(self):\r
- # Create a nest of cycles to exercise overall ref count check\r
- s = WeakSet(Foo() for i in range(1000))\r
- for elem in s:\r
- elem.cycle = s\r
- elem.sub = elem\r
- elem.set = WeakSet([elem])\r
-\r
- def test_subclass_with_custom_hash(self):\r
- # Bug #1257731\r
- class H(WeakSet):\r
- def __hash__(self):\r
- return int(id(self) & 0x7fffffff)\r
- s=H()\r
- f=set()\r
- f.add(s)\r
- self.assertIn(s, f)\r
- f.remove(s)\r
- f.add(s)\r
- f.discard(s)\r
-\r
- def test_init(self):\r
- s = WeakSet()\r
- s.__init__(self.items)\r
- self.assertEqual(s, self.s)\r
- s.__init__(self.items2)\r
- self.assertEqual(s, WeakSet(self.items2))\r
- self.assertRaises(TypeError, s.__init__, s, 2);\r
- self.assertRaises(TypeError, s.__init__, 1);\r
-\r
- def test_constructor_identity(self):\r
- s = WeakSet(self.items)\r
- t = WeakSet(s)\r
- self.assertNotEqual(id(s), id(t))\r
-\r
- def test_hash(self):\r
- self.assertRaises(TypeError, hash, self.s)\r
-\r
- def test_clear(self):\r
- self.s.clear()\r
- self.assertEqual(self.s, WeakSet([]))\r
- self.assertEqual(len(self.s), 0)\r
-\r
- def test_copy(self):\r
- dup = self.s.copy()\r
- self.assertEqual(self.s, dup)\r
- self.assertNotEqual(id(self.s), id(dup))\r
-\r
- def test_add(self):\r
- x = SomeClass('Q')\r
- self.s.add(x)\r
- self.assertIn(x, self.s)\r
- dup = self.s.copy()\r
- self.s.add(x)\r
- self.assertEqual(self.s, dup)\r
- self.assertRaises(TypeError, self.s.add, [])\r
- self.fs.add(Foo())\r
- self.assertTrue(len(self.fs) == 1)\r
- self.fs.add(self.obj)\r
- self.assertTrue(len(self.fs) == 1)\r
-\r
- def test_remove(self):\r
- x = SomeClass('a')\r
- self.s.remove(x)\r
- self.assertNotIn(x, self.s)\r
- self.assertRaises(KeyError, self.s.remove, x)\r
- self.assertRaises(TypeError, self.s.remove, [])\r
-\r
- def test_discard(self):\r
- a, q = SomeClass('a'), SomeClass('Q')\r
- self.s.discard(a)\r
- self.assertNotIn(a, self.s)\r
- self.s.discard(q)\r
- self.assertRaises(TypeError, self.s.discard, [])\r
-\r
- def test_pop(self):\r
- for i in range(len(self.s)):\r
- elem = self.s.pop()\r
- self.assertNotIn(elem, self.s)\r
- self.assertRaises(KeyError, self.s.pop)\r
-\r
- def test_update(self):\r
- retval = self.s.update(self.items2)\r
- self.assertEqual(retval, None)\r
- for c in (self.items + self.items2):\r
- self.assertIn(c, self.s)\r
- self.assertRaises(TypeError, self.s.update, [[]])\r
-\r
- def test_update_set(self):\r
- self.s.update(set(self.items2))\r
- for c in (self.items + self.items2):\r
- self.assertIn(c, self.s)\r
-\r
- def test_ior(self):\r
- self.s |= set(self.items2)\r
- for c in (self.items + self.items2):\r
- self.assertIn(c, self.s)\r
-\r
- def test_intersection_update(self):\r
- retval = self.s.intersection_update(self.items2)\r
- self.assertEqual(retval, None)\r
- for c in (self.items + self.items2):\r
- if c in self.items2 and c in self.items:\r
- self.assertIn(c, self.s)\r
- else:\r
- self.assertNotIn(c, self.s)\r
- self.assertRaises(TypeError, self.s.intersection_update, [[]])\r
-\r
- def test_iand(self):\r
- self.s &= set(self.items2)\r
- for c in (self.items + self.items2):\r
- if c in self.items2 and c in self.items:\r
- self.assertIn(c, self.s)\r
- else:\r
- self.assertNotIn(c, self.s)\r
-\r
- def test_difference_update(self):\r
- retval = self.s.difference_update(self.items2)\r
- self.assertEqual(retval, None)\r
- for c in (self.items + self.items2):\r
- if c in self.items and c not in self.items2:\r
- self.assertIn(c, self.s)\r
- else:\r
- self.assertNotIn(c, self.s)\r
- self.assertRaises(TypeError, self.s.difference_update, [[]])\r
- self.assertRaises(TypeError, self.s.symmetric_difference_update, [[]])\r
-\r
- def test_isub(self):\r
- self.s -= set(self.items2)\r
- for c in (self.items + self.items2):\r
- if c in self.items and c not in self.items2:\r
- self.assertIn(c, self.s)\r
- else:\r
- self.assertNotIn(c, self.s)\r
-\r
- def test_symmetric_difference_update(self):\r
- retval = self.s.symmetric_difference_update(self.items2)\r
- self.assertEqual(retval, None)\r
- for c in (self.items + self.items2):\r
- if (c in self.items) ^ (c in self.items2):\r
- self.assertIn(c, self.s)\r
- else:\r
- self.assertNotIn(c, self.s)\r
- self.assertRaises(TypeError, self.s.symmetric_difference_update, [[]])\r
-\r
- def test_ixor(self):\r
- self.s ^= set(self.items2)\r
- for c in (self.items + self.items2):\r
- if (c in self.items) ^ (c in self.items2):\r
- self.assertIn(c, self.s)\r
- else:\r
- self.assertNotIn(c, self.s)\r
-\r
- def test_inplace_on_self(self):\r
- t = self.s.copy()\r
- t |= t\r
- self.assertEqual(t, self.s)\r
- t &= t\r
- self.assertEqual(t, self.s)\r
- t -= t\r
- self.assertEqual(t, WeakSet())\r
- t = self.s.copy()\r
- t ^= t\r
- self.assertEqual(t, WeakSet())\r
-\r
- def test_eq(self):\r
- # issue 5964\r
- self.assertTrue(self.s == self.s)\r
- self.assertTrue(self.s == WeakSet(self.items))\r
- self.assertFalse(self.s == set(self.items))\r
- self.assertFalse(self.s == list(self.items))\r
- self.assertFalse(self.s == tuple(self.items))\r
- self.assertFalse(self.s == 1)\r
-\r
- def test_weak_destroy_while_iterating(self):\r
- # Issue #7105: iterators shouldn't crash when a key is implicitly removed\r
- # Create new items to be sure no-one else holds a reference\r
- items = [SomeClass(c) for c in ('a', 'b', 'c')]\r
- s = WeakSet(items)\r
- it = iter(s)\r
- next(it) # Trigger internal iteration\r
- # Destroy an item\r
- del items[-1]\r
- gc.collect() # just in case\r
- # We have removed either the first consumed items, or another one\r
- self.assertIn(len(list(it)), [len(items), len(items) - 1])\r
- del it\r
- # The removal has been committed\r
- self.assertEqual(len(s), len(items))\r
-\r
- def test_weak_destroy_and_mutate_while_iterating(self):\r
- # Issue #7105: iterators shouldn't crash when a key is implicitly removed\r
- items = [SomeClass(c) for c in string.ascii_letters]\r
- s = WeakSet(items)\r
- @contextlib.contextmanager\r
- def testcontext():\r
- try:\r
- it = iter(s)\r
- next(it)\r
- # Schedule an item for removal and recreate it\r
- u = SomeClass(str(items.pop()))\r
- gc.collect() # just in case\r
- yield u\r
- finally:\r
- it = None # should commit all removals\r
-\r
- with testcontext() as u:\r
- self.assertNotIn(u, s)\r
- with testcontext() as u:\r
- self.assertRaises(KeyError, s.remove, u)\r
- self.assertNotIn(u, s)\r
- with testcontext() as u:\r
- s.add(u)\r
- self.assertIn(u, s)\r
- t = s.copy()\r
- with testcontext() as u:\r
- s.update(t)\r
- self.assertEqual(len(s), len(t))\r
- with testcontext() as u:\r
- s.clear()\r
- self.assertEqual(len(s), 0)\r
-\r
-\r
-def test_main(verbose=None):\r
- test_support.run_unittest(TestWeakSet)\r
-\r
-if __name__ == "__main__":\r
- test_main(verbose=True)\r
projects / mirror_edk2.git / blobdiff