I am aware of the fact that I always have to override Equals(object)
and GetHashCode()
when implementing IEquatable<T>.Equals(T)
.
However, I don't understand, why in some situations the Equals(object)
wins over the generic Equals(T)
.
For example why is the following happening? If I declare IEquatable<T>
for an interface and implement a concrete type X
for it, the general Equals(object)
is called by a Hashset<X>
when comparing items of those type against each other. In all other situations where at least one of the sides is cast to the Interface, the correct Equals(T)
is called.
Here's a code sample to demonstrate:
public interface IPerson : IEquatable<IPerson> { }
//Simple example implementation of Equals (returns always true)
class Person : IPerson
{
public bool Equals(IPerson other)
{
return true;
}
public override bool Equals(object obj)
{
return true;
}
public override int GetHashCode()
{
return 0;
}
}
private static void doEqualityCompares()
{
var t1 = new Person();
var hst = new HashSet<Person>();
var hsi = new HashSet<IPerson>();
hst.Add(t1);
hsi.Add(t1);
//Direct comparison
t1.Equals(t1); //IEquatable<T>.Equals(T)
hst.Contains(t1); //Equals(object) --> why? both sides inherit of IPerson...
hst.Contains((IPerson)t1); //IEquatable<T>.Equals(T)
hsi.Contains(t1); //IEquatable<T>.Equals(T)
hsi.Contains((IPerson)t1); //IEquatable<T>.Equals(T)
}
Comparison methodHashSet uses equal() and hashcode() methods to compare the elements, while TreeSet we can implements compareTo() method of Comparator interface so we have compare() and compareTo() method ,TreeSet does not use equal() and hashcode() method.
The equals() method of java. util. HashSet class is used verify the equality of an Object with a HashSet and compare them. The list returns true only if both HashSet contains same elements, irrespective of order.
The equals method for class Object implements the most discriminating possible equivalence relation on objects; that is, for any non-null reference values x and y, this method returns true if and only if x and y refer to the same object (x == y has the value true).
equals() Method. In Java, the String equals() method compares the two given strings based on the data/content of the string. If all the contents of both the strings are the same, it returns true. If all characters are not matched, then it returns false.
HashSet<T>
calls EqualityComparer<T>.Default
to get the default equality comparer when no comparer is provided.
EqualityComparer<T>.Default
determines if T
implementsIEquatable<T>
. If it does, it uses that, if not, it uses object.Equals
and object.GetHashCode
.
Your Person
object implements IEquatable<IPerson>
not IEquatable<Person>
.
When you have a HashSet<Person>
it ends up checking if Person
is an IEquatable<Person>
, which its not, so it uses the object
methods.
When you have a HashSet<IPerson>
it checks if IPerson
is an IEquatable<IPerson>
, which it is, so it uses those methods.
As for the remaining case, why does the line:
hst.Contains((IPerson)t1);
call the IEquatable
Equals
method even though its called on the HashSet<Person>
. Here you're calling Contains
on a HashSet<Person>
and passing in an IPerson
. HashSet<Person>.Contains
requires the parameter to be a Person
; an IPerson
is not a valid argument. However, a HashSet<Person>
is also an IEnumerable<Person>
, and since IEnumerable<T>
is covariant, that means it can be treated as an IEnumerable<IPerson>
, which has a Contains
extension method (through LINQ) which accepts an IPerson
as a parameter.
IEnumerable.Contains
also uses EqualityComparer<T>.Default
to get its equality comparer when none is provided. In the case of this method call we're actually calling Contains
on an IEnumerable<IPerson>
, which means EqualityComparer<IPerson>.Default
is checking to see if IPerson
is an IEquatable<IPerson>
, which it is, so that Equals
method is called.
Although IComparable<in T>
is contravariant with respect to T
, such that any type which implements IComparable<Person>
would automatically be considered an implementation of IComparable<IPerson>
, the type IEquatable<T>
is intended for use with sealed types, especially structures. The requirement that Object.GetHashCode()
be consistent with both IEquatable<T>.Equals(T)
and Object.Equals(Object)
generally implies that the latter two methods should behave identically, which in turn implies that one of them should chain to the other. While there is a large performance difference between passing a struct directly to an IEquatable<T>
implementation of the proper type, compared with constructing a instance of the structure's boxed-heap-object type and having an Equals(Object)
implementation copy the structure data out of that, no such performance different exists with reference types. If IEquatable<T>.Equals(T)
and Equals(Object)
are going to be equivalent and T
is an inheritable reference type, there's no meaningful difference between:
bool Equals(MyType obj)
{
MyType other = obj as MyType;
if (other==null || other.GetType() != typeof(this))
return false;
... test whether other matches this
}
bool Equals(MyType other)
{
if (other==null || other.GetType() != typeof(this))
return false;
... test whether other matches this
}
The latter could save one typecast, but that's unlikely to make a sufficient performance difference to justify having two methods.
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With