On 3/8/06, Nicolas Cannasse <[EMAIL PROTECTED]> wrote: > The current hash function offer some additional warantee. It should > never collide for identifiers of 4 chars or less. Compared to FNV it > uses + instead of ^, and a lower prime number (223). It's a hash > function already used successfuly in the OCaml language.
OK, I didn't know that hash had such a property. I guess in that it is similar to "Bernstein's hash" (which instead uses 33) and guarantees that a similar property holds for 6 letter lowercase english words (or 5 letters with mixed case). The only "problem" if found with it since, is that it's ignoring everything after a "\0", though this is probably because it is to be used in C code, and not a big issue for identifiers. I was thinking of using the interned strings to represent Scheme's symbols, thus my interess. Thanks!
-- Neko : One VM to run them all (http://nekovm.org)
