Re: Hash key for vector of 3 ints
On Apr 9, 11:12 pm, onelesscar <mtlmei...@gmail.com> wrote:
I'm currently creating my hash key by stuffing the bits into an
unsigned long long.
key = static_cast<uint64>(x) | (static_cast<uint64>(y) << 20) |
(static_cast<uint64>(z) << 40);
But this limits the range in x,y,z.
I've made a few attempts in Visual Studio including making an
XOR of the vector ints. I don't think the XOR gives keys that
are unique enough.
I don't either. Especially, it will result in all permutations
of the same values having the same hash code.
You might want to read
http://kanze.james.neuf.fr/code/Docs/html/Hashcode.html. This
summarizes the results of some trials I did years back. (I've
since updated it with some additional hash code algorithms, but
the newer version isn't on line, and the results don't really
change either.) The article, like most articles concerning hash
codes, concerns hashing strings, but in fact, most of the
algorithms (including all of the good ones) will work for any
sequence whose elements can be converted into an unsigned int.
The basic conclusion is to use either FNV or a Mersenne prime
hash. (The Mersenne prime may be slightly faster on machines
with a slow multiply.)
You might also be interesting in the Hashing component of my
library (http://kanze.james.neuf.fr/code-en.html -- it's in the
Basic subsystem). It contains a few generic functions for
generating a FNV hash, and a generic HashAccumulator which can
be used to hash any sequence using std::accumulate. Although
they were designed to be used within the context of my library,
it shouldn't be too difficult to extract them and adapt them to
your needs.
--
James Kanze (GABI Software) email:james.kanze@gmail.com
Conseils en informatique orient=E9e objet/
Beratung in objektorientierter Datenverarbeitung
9 place S=E9mard, 78210 St.-Cyr-l'=C9cole, France, +33 (0)1 30 23 00 34