Home
last modified time | relevance | path

Searched refs:_PyHASH_MODULUS (Results 1 - 8 of 8) sorted by relevance

/third_party/python/Modules/_decimal/tests/
H A Dbignum.py12 _PyHASH_MODULUS = sys.hash_info.modulus variable
17 # _PyHASH_10INV is the inverse of 10 modulo the prime _PyHASH_MODULUS
18 _PyHASH_10INV = pow(10, _PyHASH_MODULUS - 2, _PyHASH_MODULUS)
26 exp_hash = pow(10, exp, _PyHASH_MODULUS)
28 exp_hash = pow(_PyHASH_10INV, -exp, _PyHASH_MODULUS)
29 hash_ = coeff * exp_hash % _PyHASH_MODULUS
/third_party/python/Lib/test/
H A Dtest_numeric_tower.py13 # on the reduction of x modulo the prime _PyHASH_MODULUS.
14 _PyHASH_MODULUS = sys.hash_info.modulus variable
139 # or the denominator is a multiple of _PyHASH_MODULUS
140 self.assertEqual(hash(F(1, _PyHASH_MODULUS)), _PyHASH_INF)
141 self.assertEqual(hash(F(-1, 3*_PyHASH_MODULUS)), -_PyHASH_INF)
142 self.assertEqual(hash(F(7*_PyHASH_MODULUS, 1)), 0)
143 self.assertEqual(hash(F(-_PyHASH_MODULUS, 1)), 0)
/third_party/python/Python/
H A Dpyhash.c71 reduce(x * y) == reduce(x) * reduce(y) (modulo _PyHASH_MODULUS)
78 reduce(x * 2**e) == reduce(x) * reduce(2**e) % _PyHASH_MODULUS
80 reduce(x * 10**e) == reduce(x) * reduce(10**e) % _PyHASH_MODULUS
117 x = ((x << 28) & _PyHASH_MODULUS) | x >> (_PyHASH_BITS - 28); in _Py_HashDouble()
123 if (x >= _PyHASH_MODULUS) in _Py_HashDouble()
124 x -= _PyHASH_MODULUS; in _Py_HashDouble()
129 x = ((x << e) & _PyHASH_MODULUS) | x >> (_PyHASH_BITS - e); in _Py_HashDouble()
H A Dsysmodule.c1372 PyLong_FromSsize_t(_PyHASH_MODULUS)); in get_hash_info()
/third_party/python/Include/
H A Dpyhash.h30 #define _PyHASH_MODULUS (((size_t)1 << _PyHASH_BITS) - 1) macro
/third_party/python/Lib/
H A Dfractions.py17 # on the reduction of x modulo the prime _PyHASH_MODULUS.
18 _PyHASH_MODULUS = sys.hash_info.modulus variable
20 # _PyHASH_MODULUS.
654 dinv = pow(self._denominator, -1, _PyHASH_MODULUS)
662 # where N is self._numerator and P is _PyHASH_MODULUS. That's
H A D_pydecimal.py972 exp_hash = pow(10, self._exp, _PyHASH_MODULUS)
974 exp_hash = pow(_PyHASH_10INV, -self._exp, _PyHASH_MODULUS)
975 hash_ = int(self._int) * exp_hash % _PyHASH_MODULUS
6417 # on the reduction of x modulo _PyHASH_MODULUS
6418 _PyHASH_MODULUS = sys.hash_info.modulus variable
6423 # _PyHASH_10INV is the inverse of 10 modulo the prime _PyHASH_MODULUS
6424 _PyHASH_10INV = pow(10, _PyHASH_MODULUS - 2, _PyHASH_MODULUS)
/third_party/python/Objects/
H A Dlongobject.c3151 /* Here x is a quantity in the range [0, _PyHASH_MODULUS); we in long_hash()
3153 _PyHASH_MODULUS. in long_hash()
3155 The computation of x * 2**PyLong_SHIFT % _PyHASH_MODULUS in long_hash()
3163 _PyHASH_MODULUS gives the bottom _PyHASH_BITS - PyLong_SHIFT in long_hash()
3165 congruent to 1 modulo _PyHASH_MODULUS, y*2**_PyHASH_BITS is in long_hash()
3166 congruent to y modulo _PyHASH_MODULUS. So in long_hash()
3168 x * 2**PyLong_SHIFT = y + z (mod _PyHASH_MODULUS). in long_hash()
3173 after rotation, so 0 <= y+z < _PyHASH_MODULUS and y + z is in long_hash()
3175 _PyHASH_MODULUS. */ in long_hash()
3176 x = ((x << PyLong_SHIFT) & _PyHASH_MODULUS) | in long_hash()
[all...]

Completed in 20 milliseconds