Why is ‘397’ used for ReSharper GetHashCode override?

by

Probably because 397 is a prime of sufficient size to cause the result variable to overflow and mix the bits of the hash somewhat, providing a better distribution of hash codes. There’s nothing particularly special about 397 that distinguishes it from other primes of the same magnitude.

More Related Contents:

  1. Is it possible to decrypt MD5 hashes?
  2. Are mutable hashmap keys a dangerous practice?
  3. How does password salt help against a rainbow table attack?
  4. Salting Your Password: Best Practices? [closed]
  5. Is it safe to ignore the possibility of SHA collisions in practice?
  6. Probability of SHA1 collisions
  7. Are there any SHA-256 javascript implementations that are generally considered trustworthy? [closed]
  8. Is there an MD5 Fixed Point where md5(x) == x?
  9. yii CPasswordHelper: hashPassword and verifyPassword
  10. How come MD5 hash values are not reversible?
  11. Is calculating an MD5 hash less CPU intensive than SHA family functions?
  12. When is CRC more appropriate to use than MD5/SHA1?
  13. How long to brute force a salted SHA-512 hash? (salt provided)
  14. Can two different strings generate the same MD5 hash code?
  15. How are hash functions like MD5 unique?
  16. Is MD5 still good enough to uniquely identify files?
  17. Why are XOR often used in java hashCode() but another bitwise operators are used rarely?
  18. How can it be impossible to “decrypt” an MD5 hash? [duplicate]
  19. Is it possible to decrypt MD5 hashes?
  20. How to “EXPIRE” the “HSET” child key in redis?
  21. Why are 5381 and 33 so important in the djb2 algorithm?
  22. node.js hash string?
  23. Best practice for hashing passwords – SHA256 or SHA512?
  24. Why do -1 and -2 both hash to -2 in CPython? [duplicate]
  25. Scroll with anchor without # in URL
  26. How do I generate a SALT in Java for Salted-Hash?
  27. How to assign hash[‘a’][‘b’]= ‘c’ if hash[‘a’] doesn’t exist?
  28. error for hash function of pair of ints
  29. VBA hash string
  30. R fast single item lookup from list vs data.table vs hash

Leave a Comment