Closed huitseeker closed 8 years ago
THose hashes are used to build GUIDs for matrices which are being cached. So there is always a matrix operation behind them which should take a lot more time than the hash itself. But if you have some evidence that its slowing things down let us know. Minimizing the collision probability seems like the most important thing.
Grepping for hash instances in the project:
I've found a lot of hashes on 32-bit Ints. Have you considered replacing Murmur3 with the faster xxHash ? https://github.com/Cyan4973/xxHash (as for the one usage in its 64-bit version, note the existence of XXH64)