[Date Prev][Date Next][Thread Prev][Thread Next]
- Subject: Re: [ANN] LuaJIT-2.0.0-beta1
- From: "Juris Kalnins" <juris@...>
- Date: Tue, 03 Nov 2009 10:21:42 +0200
On Mon, 02 Nov 2009 15:25:16 +0200, Mike Pall <firstname.lastname@example.org> wrote:
Not with the hash per-se but with the selection of the characters
to hash. It badly hashed strings that contained URLs.
Thanks, this is useful information.
I was thinking how much it is possible to gain by searching for hash
that gives least number of lower bit collisions on the set of keys that
are actually used together in the application. (e.g. names of modules,
names of metamethods, ...)
Also, if I understand correctly, LJ 2 can much optimize table lookups if
the key lives at is 'primary' position?