Fred Drake | 13634cf | 2000-06-29 19:17:04 +0000 | [diff] [blame] | 1 | # test the invariant that |
| 2 | # iff a==b then hash(a)==hash(b) |
| 3 | # |
Nick Coghlan | d1abd25 | 2008-07-15 15:46:38 +0000 | [diff] [blame] | 4 | # Also test that hash implementations are inherited as expected |
Fred Drake | 13634cf | 2000-06-29 19:17:04 +0000 | [diff] [blame] | 5 | |
Georg Brandl | 2daf6ae | 2012-02-20 19:54:16 +0100 | [diff] [blame] | 6 | import datetime |
| 7 | import os |
Georg Brandl | 09a7c72 | 2012-02-20 21:31:46 +0100 | [diff] [blame] | 8 | import sys |
Fred Drake | 97656a1 | 2001-05-18 21:45:35 +0000 | [diff] [blame] | 9 | import unittest |
Benjamin Peterson | ee8712c | 2008-05-20 21:35:26 +0000 | [diff] [blame] | 10 | from test import support |
Georg Brandl | 2daf6ae | 2012-02-20 19:54:16 +0100 | [diff] [blame] | 11 | from test.script_helper import assert_python_ok |
Nick Coghlan | d1abd25 | 2008-07-15 15:46:38 +0000 | [diff] [blame] | 12 | from collections import Hashable |
Fred Drake | 13634cf | 2000-06-29 19:17:04 +0000 | [diff] [blame] | 13 | |
Georg Brandl | 09a7c72 | 2012-02-20 21:31:46 +0100 | [diff] [blame] | 14 | IS_64BIT = sys.maxsize > 2**32 |
Georg Brandl | 2daf6ae | 2012-02-20 19:54:16 +0100 | [diff] [blame] | 15 | |
Fred Drake | 13634cf | 2000-06-29 19:17:04 +0000 | [diff] [blame] | 16 | |
Fred Drake | 97656a1 | 2001-05-18 21:45:35 +0000 | [diff] [blame] | 17 | class HashEqualityTestCase(unittest.TestCase): |
| 18 | |
| 19 | def same_hash(self, *objlist): |
Fred Drake | acb117e | 2001-05-18 21:50:02 +0000 | [diff] [blame] | 20 | # Hash each object given and fail if |
| 21 | # the hash values are not all the same. |
Guido van Rossum | c1f779c | 2007-07-03 08:25:58 +0000 | [diff] [blame] | 22 | hashed = list(map(hash, objlist)) |
Fred Drake | 97656a1 | 2001-05-18 21:45:35 +0000 | [diff] [blame] | 23 | for h in hashed[1:]: |
| 24 | if h != hashed[0]: |
Walter Dörwald | 70a6b49 | 2004-02-12 17:35:32 +0000 | [diff] [blame] | 25 | self.fail("hashed values differ: %r" % (objlist,)) |
Fred Drake | 97656a1 | 2001-05-18 21:45:35 +0000 | [diff] [blame] | 26 | |
| 27 | def test_numeric_literals(self): |
Guido van Rossum | e2a383d | 2007-01-15 16:59:06 +0000 | [diff] [blame] | 28 | self.same_hash(1, 1, 1.0, 1.0+0.0j) |
Thomas Wouters | ce272b6 | 2007-09-19 21:19:28 +0000 | [diff] [blame] | 29 | self.same_hash(0, 0.0, 0.0+0.0j) |
| 30 | self.same_hash(-1, -1.0, -1.0+0.0j) |
| 31 | self.same_hash(-2, -2.0, -2.0+0.0j) |
Fred Drake | 97656a1 | 2001-05-18 21:45:35 +0000 | [diff] [blame] | 32 | |
| 33 | def test_coerced_integers(self): |
Guido van Rossum | e2a383d | 2007-01-15 16:59:06 +0000 | [diff] [blame] | 34 | self.same_hash(int(1), int(1), float(1), complex(1), |
Fred Drake | 97656a1 | 2001-05-18 21:45:35 +0000 | [diff] [blame] | 35 | int('1'), float('1.0')) |
Thomas Wouters | ce272b6 | 2007-09-19 21:19:28 +0000 | [diff] [blame] | 36 | self.same_hash(int(-2**31), float(-2**31)) |
| 37 | self.same_hash(int(1-2**31), float(1-2**31)) |
| 38 | self.same_hash(int(2**31-1), float(2**31-1)) |
| 39 | # for 64-bit platforms |
| 40 | self.same_hash(int(2**31), float(2**31)) |
| 41 | self.same_hash(int(-2**63), float(-2**63)) |
Guilherme Polo | 887b3f2 | 2009-02-07 00:45:10 +0000 | [diff] [blame] | 42 | self.same_hash(int(2**63), float(2**63)) |
Fred Drake | 97656a1 | 2001-05-18 21:45:35 +0000 | [diff] [blame] | 43 | |
| 44 | def test_coerced_floats(self): |
Guido van Rossum | e2a383d | 2007-01-15 16:59:06 +0000 | [diff] [blame] | 45 | self.same_hash(int(1.23e300), float(1.23e300)) |
Fred Drake | 97656a1 | 2001-05-18 21:45:35 +0000 | [diff] [blame] | 46 | self.same_hash(float(0.5), complex(0.5, 0.0)) |
Fred Drake | 13634cf | 2000-06-29 19:17:04 +0000 | [diff] [blame] | 47 | |
| 48 | |
Nick Coghlan | d1abd25 | 2008-07-15 15:46:38 +0000 | [diff] [blame] | 49 | _default_hash = object.__hash__ |
| 50 | class DefaultHash(object): pass |
| 51 | |
| 52 | _FIXED_HASH_VALUE = 42 |
| 53 | class FixedHash(object): |
| 54 | def __hash__(self): |
| 55 | return _FIXED_HASH_VALUE |
| 56 | |
| 57 | class OnlyEquality(object): |
| 58 | def __eq__(self, other): |
| 59 | return self is other |
| 60 | |
| 61 | class OnlyInequality(object): |
| 62 | def __ne__(self, other): |
| 63 | return self is not other |
| 64 | |
Nick Coghlan | d1abd25 | 2008-07-15 15:46:38 +0000 | [diff] [blame] | 65 | class InheritedHashWithEquality(FixedHash, OnlyEquality): pass |
| 66 | class InheritedHashWithInequality(FixedHash, OnlyInequality): pass |
Nick Coghlan | d1abd25 | 2008-07-15 15:46:38 +0000 | [diff] [blame] | 67 | |
| 68 | class NoHash(object): |
| 69 | __hash__ = None |
| 70 | |
| 71 | class HashInheritanceTestCase(unittest.TestCase): |
| 72 | default_expected = [object(), |
| 73 | DefaultHash(), |
| 74 | OnlyInequality(), |
| 75 | ] |
| 76 | fixed_expected = [FixedHash(), |
| 77 | InheritedHashWithEquality(), |
| 78 | InheritedHashWithInequality(), |
Nick Coghlan | d1abd25 | 2008-07-15 15:46:38 +0000 | [diff] [blame] | 79 | ] |
| 80 | error_expected = [NoHash(), |
| 81 | OnlyEquality(), |
Nick Coghlan | d1abd25 | 2008-07-15 15:46:38 +0000 | [diff] [blame] | 82 | ] |
| 83 | |
| 84 | def test_default_hash(self): |
| 85 | for obj in self.default_expected: |
| 86 | self.assertEqual(hash(obj), _default_hash(obj)) |
| 87 | |
| 88 | def test_fixed_hash(self): |
| 89 | for obj in self.fixed_expected: |
| 90 | self.assertEqual(hash(obj), _FIXED_HASH_VALUE) |
| 91 | |
| 92 | def test_error_hash(self): |
| 93 | for obj in self.error_expected: |
| 94 | self.assertRaises(TypeError, hash, obj) |
| 95 | |
| 96 | def test_hashable(self): |
| 97 | objects = (self.default_expected + |
| 98 | self.fixed_expected) |
| 99 | for obj in objects: |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 100 | self.assertIsInstance(obj, Hashable) |
Nick Coghlan | d1abd25 | 2008-07-15 15:46:38 +0000 | [diff] [blame] | 101 | |
| 102 | def test_not_hashable(self): |
| 103 | for obj in self.error_expected: |
Ezio Melotti | e961593 | 2010-01-24 19:26:24 +0000 | [diff] [blame] | 104 | self.assertNotIsInstance(obj, Hashable) |
Nick Coghlan | d1abd25 | 2008-07-15 15:46:38 +0000 | [diff] [blame] | 105 | |
| 106 | |
Nick Coghlan | f1f2f68 | 2008-12-30 07:29:12 +0000 | [diff] [blame] | 107 | # Issue #4701: Check that some builtin types are correctly hashable |
| 108 | class DefaultIterSeq(object): |
| 109 | seq = range(10) |
| 110 | def __len__(self): |
| 111 | return len(self.seq) |
| 112 | def __getitem__(self, index): |
| 113 | return self.seq[index] |
| 114 | |
| 115 | class HashBuiltinsTestCase(unittest.TestCase): |
Mark Dickinson | 3664568 | 2011-10-23 19:53:01 +0100 | [diff] [blame] | 116 | hashes_to_check = [enumerate(range(10)), |
Nick Coghlan | f1f2f68 | 2008-12-30 07:29:12 +0000 | [diff] [blame] | 117 | iter(DefaultIterSeq()), |
| 118 | iter(lambda: 0, 0), |
| 119 | ] |
| 120 | |
| 121 | def test_hashes(self): |
| 122 | _default_hash = object.__hash__ |
| 123 | for obj in self.hashes_to_check: |
| 124 | self.assertEqual(hash(obj), _default_hash(obj)) |
| 125 | |
Georg Brandl | 2daf6ae | 2012-02-20 19:54:16 +0100 | [diff] [blame] | 126 | class HashRandomizationTests(unittest.TestCase): |
| 127 | |
| 128 | # Each subclass should define a field "repr_", containing the repr() of |
| 129 | # an object to be tested |
| 130 | |
| 131 | def get_hash_command(self, repr_): |
| 132 | return 'print(hash(%s))' % repr_ |
| 133 | |
| 134 | def get_hash(self, repr_, seed=None): |
| 135 | env = os.environ.copy() |
| 136 | env['__cleanenv'] = True # signal to assert_python not to do a copy |
| 137 | # of os.environ on its own |
| 138 | if seed is not None: |
| 139 | env['PYTHONHASHSEED'] = str(seed) |
| 140 | else: |
| 141 | env.pop('PYTHONHASHSEED', None) |
| 142 | out = assert_python_ok( |
| 143 | '-c', self.get_hash_command(repr_), |
| 144 | **env) |
| 145 | stdout = out[1].strip() |
| 146 | return int(stdout) |
| 147 | |
| 148 | def test_randomized_hash(self): |
| 149 | # two runs should return different hashes |
| 150 | run1 = self.get_hash(self.repr_, seed='random') |
| 151 | run2 = self.get_hash(self.repr_, seed='random') |
| 152 | self.assertNotEqual(run1, run2) |
| 153 | |
| 154 | class StringlikeHashRandomizationTests(HashRandomizationTests): |
| 155 | def test_null_hash(self): |
| 156 | # PYTHONHASHSEED=0 disables the randomized hash |
| 157 | if IS_64BIT: |
| 158 | known_hash_of_obj = 1453079729188098211 |
| 159 | else: |
| 160 | known_hash_of_obj = -1600925533 |
| 161 | |
Benjamin Peterson | c9f54cf | 2012-02-21 16:08:05 -0500 | [diff] [blame] | 162 | # Randomization is enabled by default: |
| 163 | self.assertNotEqual(self.get_hash(self.repr_), known_hash_of_obj) |
Georg Brandl | 2daf6ae | 2012-02-20 19:54:16 +0100 | [diff] [blame] | 164 | |
| 165 | # It can also be disabled by setting the seed to 0: |
| 166 | self.assertEqual(self.get_hash(self.repr_, seed=0), known_hash_of_obj) |
| 167 | |
| 168 | def test_fixed_hash(self): |
| 169 | # test a fixed seed for the randomized hash |
| 170 | # Note that all types share the same values: |
| 171 | if IS_64BIT: |
Antoine Pitrou | 679be99 | 2012-02-22 03:33:56 +0100 | [diff] [blame] | 172 | if sys.byteorder == 'little': |
| 173 | h = -4410911502303878509 |
| 174 | else: |
| 175 | h = -3570150969479994130 |
Georg Brandl | 2daf6ae | 2012-02-20 19:54:16 +0100 | [diff] [blame] | 176 | else: |
Antoine Pitrou | 679be99 | 2012-02-22 03:33:56 +0100 | [diff] [blame] | 177 | if sys.byteorder == 'little': |
| 178 | h = -206076799 |
| 179 | else: |
| 180 | h = -1024014457 |
Georg Brandl | 2daf6ae | 2012-02-20 19:54:16 +0100 | [diff] [blame] | 181 | self.assertEqual(self.get_hash(self.repr_, seed=42), h) |
| 182 | |
| 183 | class StrHashRandomizationTests(StringlikeHashRandomizationTests): |
| 184 | repr_ = repr('abc') |
| 185 | |
| 186 | def test_empty_string(self): |
| 187 | self.assertEqual(hash(""), 0) |
| 188 | |
| 189 | class BytesHashRandomizationTests(StringlikeHashRandomizationTests): |
| 190 | repr_ = repr(b'abc') |
| 191 | |
| 192 | def test_empty_string(self): |
| 193 | self.assertEqual(hash(b""), 0) |
| 194 | |
Antoine Pitrou | 07c6588 | 2012-02-21 19:14:26 +0100 | [diff] [blame] | 195 | class MemoryviewHashRandomizationTests(StringlikeHashRandomizationTests): |
| 196 | repr_ = "memoryview(b'abc')" |
| 197 | |
| 198 | def test_empty_string(self): |
| 199 | self.assertEqual(hash(memoryview(b"")), 0) |
| 200 | |
Georg Brandl | 2daf6ae | 2012-02-20 19:54:16 +0100 | [diff] [blame] | 201 | class DatetimeTests(HashRandomizationTests): |
| 202 | def get_hash_command(self, repr_): |
| 203 | return 'import datetime; print(hash(%s))' % repr_ |
| 204 | |
| 205 | class DatetimeDateTests(DatetimeTests): |
| 206 | repr_ = repr(datetime.date(1066, 10, 14)) |
| 207 | |
| 208 | class DatetimeDatetimeTests(DatetimeTests): |
| 209 | repr_ = repr(datetime.datetime(1, 2, 3, 4, 5, 6, 7)) |
| 210 | |
| 211 | class DatetimeTimeTests(DatetimeTests): |
| 212 | repr_ = repr(datetime.time(0)) |
| 213 | |
| 214 | |
Fred Drake | 2e2be37 | 2001-09-20 21:33:42 +0000 | [diff] [blame] | 215 | def test_main(): |
Nick Coghlan | d1abd25 | 2008-07-15 15:46:38 +0000 | [diff] [blame] | 216 | support.run_unittest(HashEqualityTestCase, |
Georg Brandl | 2daf6ae | 2012-02-20 19:54:16 +0100 | [diff] [blame] | 217 | HashInheritanceTestCase, |
| 218 | HashBuiltinsTestCase, |
| 219 | StrHashRandomizationTests, |
| 220 | BytesHashRandomizationTests, |
Antoine Pitrou | bc499d2 | 2012-02-21 19:18:10 +0100 | [diff] [blame] | 221 | MemoryviewHashRandomizationTests, |
Georg Brandl | 2daf6ae | 2012-02-20 19:54:16 +0100 | [diff] [blame] | 222 | DatetimeDateTests, |
| 223 | DatetimeDatetimeTests, |
| 224 | DatetimeTimeTests) |
Fred Drake | 2e2be37 | 2001-09-20 21:33:42 +0000 | [diff] [blame] | 225 | |
| 226 | |
| 227 | if __name__ == "__main__": |
| 228 | test_main() |