Fortsätt till huvudinnehåll

Override the Object.GetHashCode method, why you should bother

When you design a class you sometimes want to override the Equals method in order to use some internal fields to determine if two instances of the class are equal.

For example let's assume that you have implemented a class Money that has two fields, one named _amount of type decimal and another one called _currency of type string. You decide that two objects of type Money are equal if and only if the amount and currency fields have the same values.

The implementation of Equals looks like this:

public override bool Equals(object obj)
{
  if (obj is Money other)
  {
    return _currency.Equals(other._currency, StringComparison.Ordinal)
        && _amount.Equals(other._amount);
  }
  return false;
}

You then notice that you get a warning during compilation,Warning CS0659 'Money' overrides Object.Equals(object o) but does not override Object.GetHashCode(). So what is this all about?

If you look into it a bit you will find that there is a rule saying that if two objects are equal, they must have the same hash code, and since you have just overridden the method that determines if two objects are equal, it is your responsibility to ensure that they also get the same hash. But why do two identical objects need to have the same hash?

The hash code is used when you build HashSets and Dictionaries. If you don't override the GetHashCode method the default method will be used, this will only compare the object's memory address and even though you consider them to be equal they will be treated as different in the HashSet or Dictionary. This breaks the use of HashSets and Dictionaries with your objects and you do not want that.

However, since the rule says that objects that are identical should have the same hash, but not that objects that are not identical cannot have the same hash, a quick fix is to implement a GetHashCode method that always returns the same integer value. This actually is a valid implementation. But, this also means that you will get hash collisions for instance of your class. If used as key-values in a Dictionary this will make addition and look-up to the dictionary much much slower.

The best thing you can do is to use the same data that you use to check if the two instances of the class are equal to also calculate the hash code. For the Money class the GetHashCode method can look like this:

public override int GetHashCode()
{
  var hashCode = _currency.GetHashCode() + _amount.GetHashCode();
  return hashCode;
}

It is worth putting some effort your hash code method!

Kommentarer

Populära inlägg i den här bloggen

C# Enum as bit field

Bit field enum Whenever you wish to express combinations of properties of an object, bit fields are a good way to accomplish this. As a simple example, consider a file in the file system. It can be Readable , Writable , Hidden or a combination these. The different attributes can be defined as an enum : [Flags] public enum FileAttribute {   None      = 0b0000;   Readable  = 0b0001;   Writeable = 0b0010;   Hidden    = 0b0100; } To indicate that this enum is expected to be used as a bit field I have defined it with the FlagsAttribute . It is important to understand that the FlagsAttribute does nothing more than making some changes to how the ToString method of the enum works, making it possible to print out all flags. It does not introduce any validation or special treatment of the enum in any other way. I have defined the values of the different fields of the enum using binary representation, this should make it even more clear that this is a bit field and which bi

Codility tasks - Part I

I was recently faced with two codility tasks when applying for a job as an Embedded Software Engineer. For those of you who arn't familiar with Codility you can check out their website here:  www.codility.com Task one - Dominator The first task was called Dominator. The goal was to, given a std::vector of integers, find an integer that occurs in more than half of the positions in the vector. If no dominator was found -1 should be returned. My approach was to loop through the vector from the first to the last element, using a std::map to count the number of occurences of each integer. If the count ever reached above half the size of the vector I stopped and returned that integer and if I reached the end without finding a dominator I returned -1. So was that a good approach? Well, the reviewer at the company rated the solution as 'pretty ok'. His preferred solution was store the first integer in the array and set a counter to 1. Then loop through the remaining i