diff options
| author | Raymond Hettinger <python@rcn.com> | 2016-11-22 00:59:04 (GMT) |
|---|---|---|
| committer | Raymond Hettinger <python@rcn.com> | 2016-11-22 00:59:04 (GMT) |
| commit | 4e17e042376ee5c64fad538bba19d786bbdf391c (patch) | |
| tree | 33eda382b4413748a3003057469a45c8796a485a /Lib | |
| parent | 6b3481c4edf9bdb42f78eeb2680150626db3087a (diff) | |
| download | cpython-4e17e042376ee5c64fad538bba19d786bbdf391c.zip cpython-4e17e042376ee5c64fad538bba19d786bbdf391c.tar.gz cpython-4e17e042376ee5c64fad538bba19d786bbdf391c.tar.bz2 | |
Issue #26163: Disable periodically failing test which was overly demanding of the frozenset hash function effectiveness
Diffstat (limited to 'Lib')
| -rw-r--r-- | Lib/test/test_set.py | 5 |
1 files changed, 1 insertions, 4 deletions
diff --git a/Lib/test/test_set.py b/Lib/test/test_set.py index afa6e7f..0202981 100644 --- a/Lib/test/test_set.py +++ b/Lib/test/test_set.py @@ -730,9 +730,6 @@ class TestFrozenSet(TestJointOps, unittest.TestCase): addhashvalue(hash(frozenset([e for e, m in elemmasks if m&i]))) self.assertEqual(len(hashvalues), 2**n) - def letter_range(n): - return string.ascii_letters[:n] - def zf_range(n): # https://en.wikipedia.org/wiki/Set-theoretic_definition_of_natural_numbers nums = [frozenset()] @@ -748,7 +745,7 @@ class TestFrozenSet(TestJointOps, unittest.TestCase): for n in range(18): t = 2 ** n mask = t - 1 - for nums in (range, letter_range, zf_range): + for nums in (range, zf_range): u = len({h & mask for h in map(hash, powerset(nums(n)))}) self.assertGreater(4*u, t) |