Thanks to visit codestin.com Credit goes to github.com
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 6b3481c commit 4e17e04Copy full SHA for 4e17e04
1 file changed
Lib/test/test_set.py
@@ -730,9 +730,6 @@ def test_hash_effectiveness(self):
730
addhashvalue(hash(frozenset([e for e, m in elemmasks if m&i])))
731
self.assertEqual(len(hashvalues), 2**n)
732
733
- def letter_range(n):
734
- return string.ascii_letters[:n]
735
-
736
def zf_range(n):
737
# https://en.wikipedia.org/wiki/Set-theoretic_definition_of_natural_numbers
738
nums = [frozenset()]
@@ -748,7 +745,7 @@ def powerset(s):
748
745
for n in range(18):
749
746
t = 2 ** n
750
747
mask = t - 1
751
- for nums in (range, letter_range, zf_range):
+ for nums in (range, zf_range):
752
u = len({h & mask for h in map(hash, powerset(nums(n)))})
753
self.assertGreater(4*u, t)
754
0 commit comments