Question about the implementation of GetHashCode

Question

http://msdn.microsoft.com/en-us/library/system.object.gethashcode(VS.80).aspx says:

For best performance, the hash function should generate a random distribution for all input.

Does this have any performance impact or is it okay to use a function (like return this.Id) that doesn't give a "random distribution" but doesn't cause more conflicts?

Answer 1

this.Id . , , . , - "mod x", x - -, ( ).

(1, 2, 3, 4...), . , , , .

Answer 2

return this.Id ( Id ) - , . - Id 27 , ?

, GetHashCode Equals .

Answer 3

, ... , , - " " int ( .net, , , ), .

: , - 1 10. - , 100, 10 . , , .

Answer 4

, . hashtables, ( ). , , , , -, hash_code%buckets .

Answer 5

this.Id.GetHashCode();

, , , Id.