Comments on: The Imperfect Hash (but what percentage is beef?) http://www.hackinghat.com/index.php/windows/net/the-imperfect-hash-but-what-percentage-is-beef Tue, 20 Jul 2010 09:51:44 +0000 http://wordpress.org/?v=2.9.2 hourly 1 By: Adam Hupp http://www.hackinghat.com/index.php/windows/net/the-imperfect-hash-but-what-percentage-is-beef/comment-page-1#comment-2065 Adam Hupp Tue, 04 Dec 2007 17:11:50 +0000 http://www.hackinghat.com/index.php/windows/net/the-imperfect-hash-but-what-percentage-is-beef#comment-2065 Stupid HTML. The above should be: Map<String,TreeMap<Double,Beefy>> Stupid HTML.

The above should be:

Map<String,TreeMap<Double,Beefy>>

]]> By: Adam Hupp http://www.hackinghat.com/index.php/windows/net/the-imperfect-hash-but-what-percentage-is-beef/comment-page-1#comment-2064 Adam Hupp Tue, 04 Dec 2007 17:10:56 +0000 http://www.hackinghat.com/index.php/windows/net/the-imperfect-hash-but-what-percentage-is-beef#comment-2064 I'm not sure what the Equals contract in C# looks like, but it probably requires that Equals is transitive, e.g. if a.Equals(b) and b.Equals(c) then a.Equals(c) This is not the case here. An alternative solution would be to use a two-level structure (in Java): Map> Lookup the first level by name, and then the second level by percentage. This is only a win if there are a large number of items with with the same name though. I’m not sure what the Equals contract in C# looks like, but it probably requires that Equals is transitive, e.g.

if a.Equals(b) and b.Equals(c)
then a.Equals(c)

This is not the case here.

An alternative solution would be to use a two-level structure (in Java):

Map>

Lookup the first level by name, and then the second level by percentage. This is only a win if there are a large number of items with with the same name though.

]]>