31-Jul-2013 19:04, Dmitry Olshansky пишет:
31-Jul-2013 13:17, Walter Bright пишет:
On 7/31/2013 1:49 AM, Dmitry Olshansky wrote:
so all strings
that are the same are combined. Therefore, all unique strings "hash" to
unique values.

Now that sets things straight ... if they ain't hashes then it isn't a
hash table in the general sense :)

At least that means that contrary to my naive guess calcHash has no
effect whatsoever on the distribution of keys in this AA. The "real hash
function" could be rather biased.

Ouch... to boot it's always aligned by word size, so
key % sizeof(size_t) == 0
rendering lower 2-3 bits useless, that would make straight slice lower bits approach rather weak :)

 I've got to dig a bit deeper into the
code then.

Dmitry Olshansky

Reply via email to