Skip to main content

Return to Answer

replaced http://stackoverflow.com/ with https://stackoverflow.com/
Source Link
URL Rewriter Bot
URL Rewriter Bot

If you want the hash to be valid for the set (i.e. order doesn't matter) then XORing the hashcode of each GUID is a good choice.

If you've actually got a sequence of GUIDs and the order matters then I'd suggest using the same approach I wrote about in another answerin another answer - repeatedly add/multiply.

(Note that XORing the hashcodes probably won't get you the same answer as XORing the GUIDs themselves and then hashing the result. It may be, but that depends on the implementation of GUID.GetHashCode(). I'd hash each value and XOR the results together - aside from anything else, that's trivial to implement.)

If you want the hash to be valid for the set (i.e. order doesn't matter) then XORing the hashcode of each GUID is a good choice.

If you've actually got a sequence of GUIDs and the order matters then I'd suggest using the same approach I wrote about in another answer - repeatedly add/multiply.

(Note that XORing the hashcodes probably won't get you the same answer as XORing the GUIDs themselves and then hashing the result. It may be, but that depends on the implementation of GUID.GetHashCode(). I'd hash each value and XOR the results together - aside from anything else, that's trivial to implement.)

If you want the hash to be valid for the set (i.e. order doesn't matter) then XORing the hashcode of each GUID is a good choice.

If you've actually got a sequence of GUIDs and the order matters then I'd suggest using the same approach I wrote about in another answer - repeatedly add/multiply.

(Note that XORing the hashcodes probably won't get you the same answer as XORing the GUIDs themselves and then hashing the result. It may be, but that depends on the implementation of GUID.GetHashCode(). I'd hash each value and XOR the results together - aside from anything else, that's trivial to implement.)

Source Link
Jon Skeet
Jon Skeet
  • 1.5m
  • 893
  • 9.3k
  • 9.3k

If you want the hash to be valid for the set (i.e. order doesn't matter) then XORing the hashcode of each GUID is a good choice.

If you've actually got a sequence of GUIDs and the order matters then I'd suggest using the same approach I wrote about in another answer - repeatedly add/multiply.

(Note that XORing the hashcodes probably won't get you the same answer as XORing the GUIDs themselves and then hashing the result. It may be, but that depends on the implementation of GUID.GetHashCode(). I'd hash each value and XOR the results together - aside from anything else, that's trivial to implement.)