Force Dictionary to use Identity versus Equality

[jehugaleahsa]

Hello:

Is there a way to force a Dictionary to determine equivilence by
memory location?

I have a generic class where I don't want to treat equal items as
identical items. Only when two references point to the same instance
do I want to treat them as the same dictionary key.

Any help?

Thanks,
Travis

[jehugaleahsa]

I created an IdentityCompare r like this:

public class IdentityCompare r : IEqualityCompar er<TDataRecord>
{
public bool Equals(TDataRec ord x, TDataRecord y)
{
return Object.Referenc eEquals(x, y);
}

public int GetHashCode(TDa taRecord obj)
{
return obj.GetHashCode ();
}
}

I pass this to the constructor of the Dictionary. Is there a way to
improve the GetHashCode, however?

[Ben Voigt [C++ MVP]]

je**********@gm ail.com wrote:

Hello:

Is there a way to force a Dictionary to determine equivilence by
memory location?

I have a generic class where I don't want to treat equal items as
identical items. Only when two references point to the same instance
do I want to treat them as the same dictionary key.

Any help?

Dictionary accepts an EqualityCompare r delegate in the constructor, use
object.Referenc eEquals as the EqualityCompare r.

>
Thanks,
Travis

[jehugaleahsa]

Thanks. Any ideas about improving the GetHashCode?

I'm assuming there isn't anything I can do about the GetHashCode. I
can't use memory addresses since they are volitile because of the
memory management.

Thanks again,
Travis

[Ben Voigt [C++ MVP]]

<je**********@g mail.comwrote in message
news:c5******** *************** ***********@25g 2000prz.googleg roups.com...

Thanks. Any ideas about improving the GetHashCode?

I'm assuming there isn't anything I can do about the GetHashCode. I
can't use memory addresses since they are volitile because of the
memory management.

Sorry, I don't know of any particular solution for that. But hash code
collisions should be pretty minimal unless the number of objects which are
equal-in-value-but-not-reference is a lot higher than you suggested.

>
Thanks again,
Travis

[Pavel Minaev]

On Aug 29, 12:00*am, "jehugalea...@g mail.com" <jehugalea...@g mail.com>
wrote:

Thanks. Any ideas about improving the GetHashCode?

I'm assuming there isn't anything I can do about the GetHashCode. I
can't use memory addresses since they are volitile because of the
memory management.

There isn't anything that can be done in pure C#. However, it is
possible in IL to make non-virtual method calls even for virtual
methods, explicitly specifying the type that should provide the
implementation that is called. In your case, what you need is to make
a non-virtual call to Object.GetHashC ode() on your objects - that
would be the default implementation that provides identity-based hash.
So, you take the C# code written along these lines:

using System;
using System.Collecti ons.Generic;

public class IdentityCompare r<T: IEqualityCompar er<T>
where T : class
{
public bool Equals(T x, T y)
{
return x == y;
}

public int GetHashCode(T x)
{
return x.GetHashCode() ;
}
}

Compile it, then ildasm it. In the resulting .il file, find this
instruction:

callvirt instance int32 [mscorlib]System.Object:: GetHashCode()

replace "callvirt" with "call", and use ilasm to recompile the
assembly. Now you've got your identity comparer with proper
GetHashCode().