From: Tay Ray Chuan Date: Tue, 24 Sep 2013 11:16:10 GMT Subject: Re: [PATCH v2 0/5] New hash table implementation Message-ID: In-Reply-To: <52416058.90008@gmail.com> Hi Karsten, On Tue, Sep 24, 2013 at 5:50 PM, Karsten Blees wrote: > > | add | get 100% hits | get 10% hits > | hash | hashmap | hash | hashmap | hash | hashmap > --------+--------+---------+-------+---------+---------+-------- > FNV | 14.815 | 2.345 | 3.059 | 1.642 | 4.085 | 0.976 > FNV x2 | 14.409 | 2.706 | 2.888 | 1.959 | 3.905 | 1.393 > i | 7.432 | 1.593 | 1.364 | 1.142 | 413.023 | 0.589 > i x2 | 9.169 | 1.866 | 1.427 | 1.163 | 0.757 | 0.670 > i/10 | 1.800 | 1.555 | 5.365 | 6.465 | 32.918 | 1.052 > i/10 x2 | 1.892 | 1.555 | 5.386 | 6.474 | 1.123 | 1.206 > > Tests can be reproduced with 'time echo "perfhash[map] 1000" | ./test-hashmap', see test-hashmap.c for definition of method flags. I'm not sure if I'm reading the numbers right, but they look impressive! If it's not too much trouble, could you put together an API document, along the lines of Documentation/technical/api-hash.txt? I could give a stab at replacing patience and histogram diff's hash implementation with yours. -- Cheers, Ray Chuan