A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from http://svn.python.org/projects/python/branches/ctypes-branch/Lib/test/test_hash.py below:

# test the invariant that # iff a==b then hash(a)==hash(b) # import unittest from test import test_support class HashEqualityTestCase(unittest.TestCase): def same_hash(self, *objlist): # Hash each object given and fail if # the hash values are not all the same. hashed = map(hash, objlist) for h in hashed[1:]: if h != hashed[0]: self.fail("hashed values differ: %r" % (objlist,)) def test_numeric_literals(self): self.same_hash(1, 1L, 1.0, 1.0+0.0j) self.same_hash(0, 0L, 0.0, 0.0+0.0j) self.same_hash(-1, -1L, -1.0, -1.0+0.0j) self.same_hash(-2, -2L, -2.0, -2.0+0.0j) def test_coerced_integers(self): self.same_hash(int(1), long(1), float(1), complex(1), int('1'), float('1.0')) self.same_hash(int(-2**31), long(-2**31), float(-2**31)) self.same_hash(int(1-2**31), long(1-2**31), float(1-2**31)) self.same_hash(int(2**31-1), long(2**31-1), float(2**31-1)) # for 64-bit platforms self.same_hash(int(2**31), long(2**31), float(2**31)) self.same_hash(int(-2**63), long(-2**63), float(-2**63)) self.same_hash(int(1-2**63), long(1-2**63)) self.same_hash(int(2**63-1), long(2**63-1)) def test_coerced_floats(self): self.same_hash(long(1.23e300), float(1.23e300)) self.same_hash(float(0.5), complex(0.5, 0.0)) def test_main(): test_support.run_unittest(HashEqualityTestCase) if __name__ == "__main__": test_main()

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4