http://webkit.org/blog/8/hashtables-part-2/ All about WebKit development Thu, 28 Aug 2008 00:26:58 +0000 http://wordpress.org/?v=2.6.1 http://webkit.org/blog/8/hashtables-part-2/#comment-41 iSee Wed, 27 Jul 2005 10:58:05 +0000 http://webkit.opendarwin.org/blog/?p=8#comment-41 And in addition to what I replied last time, if you are not sure you will get low collision rates with your hash tables, consider judy arrays (if their LGPL licence is acceptable to you) or another efficient implementation of tries (Check Wikipedia if you don't know what this is). They yield the same best case complexity without the risk of degrading really bad with collisions and deletes. And in addition to what I replied last time, if you are not sure you will get low collision rates with your hash tables, consider judy arrays (if their LGPL licence is acceptable to you) or another efficient implementation of tries (Check Wikipedia if you don’t know what this is). They yield the same best case complexity without the risk of degrading really bad with collisions and deletes.

]]>