New hash

Andrei Alexandrescu SeeWebsiteForEmail at erdani.org
Sat Mar 24 06:49:13 PDT 2012


On 3/23/12 10:47 PM, Andrej Mitrovic wrote:
> On 3/24/12, Andrej Mitrovic<andrej.mitrovich at gmail.com>  wrote:
>> snip
>
> I've managed to test the hashes on a small-sized closed-source project
> (9K lines) which used hashes a lot. I've found no issues so far (no
> memory corruption or anything). Performance did drop a bit from
> 812msecs to 898msecs. I can't extensively test this yet because I
> can't serialize the hashes (a serialization library doesn't want to
> work with the new hashes but I'll fix that) and so I need a 30second
> run that first fills the hashes before doing work on them. But it does
> seem to be a tiny bit slower.

I wonder what the matter is. What hashing function does the new hash 
use? Let me reiterate the suggestion that different hash algorithms are 
used depending on the string length.


Andrei


More information about the Digitalmars-d mailing list