C# Overriding the GetHashCode method

Question

In this example, the poster has overridden the get hash code method. I understand that this has been done in order to provide a better hash value for the returned object, to reduce the number of collisions, and therefore reduce the number of occasions it will be necessary to call Equals().

What i would like to know, is how this algorithm been calculated:

return 17 + 31 * CurrentState.GetHashCode() + 31 * Command.GetHashCode();

Is there a particular reason that the numbers in question were chosen? Could i have simply picked my own numbers to put into it?

Just for info, the MS C# compiler (for anon-types) uses a seed of -1134271262, and a multiplier of -1521134295. Just sayin' — Marc Gravell
– Marc Gravell, Commented May 31, 2011 at 10:48
@MarcGravell: I see the same -1521134295 multiplier in ILDASM but the seed appears to be a composite seed (it's a random int32 multiplied by the same multiplier). So the seed's not only NOT prime (contrary to popular belief), it's also random based on the anon-type member names/type/count. Weird. Any ideas why? — DeepSpace101
– DeepSpace101, Commented Jun 25, 2014 at 18:38

Oleg · Accepted Answer · 2011-05-31 10:43:51Z

4

Generally you should choose primes. This helps you to avoid getting the same hash-value for different input parameters.

answered May 31, 2011 at 10:43

Oleg

7983 silver badges7 bronze badges

Sign up to request clarification or add additional context in comments.

Comments

Community · Accepted Answer · 2017-05-23 11:52:38Z

2

Prime numbers are usually used in hashcode computation to minimize the collisions. If you search for hashcode and prime numbers on this iste, you will find some detailed explanations on this (note that it is note language specific):

edited May 23, 2017 at 11:52

CommunityBot

11 silver badge

answered May 31, 2011 at 10:44

Laurent Etiemble

28.1k5 gold badges59 silver badges81 bronze badges

Comments

Einar · Accepted Answer · 2011-05-31 10:45:48Z

1

You typically want to use prime numbers (as is done above) because it reduces the chance of collisions (two instances yielding same result). For more info, see: http://computinglife.wordpress.com/2008/11/20/why-do-hash-functions-use-prime-numbers/

answered May 31, 2011 at 10:45

Einar

3122 silver badges10 bronze badges

Collectives™ on Stack Overflow

C# Overriding the GetHashCode method

3 Answers 3

Comments

Comments

Comments

Your Answer

Linked

Hot Network Questions

Collectives™ on Stack Overflow

3 Answers 3

Comments

Comments

Comments

Your Answer

Sign up or log in

Post as a guest

Linked

Related