from http://burtleburtle.net/bob/hash/integer.html fast and efficient for power of two table sizes where we always consider the last bits. ---------------------------------------------------------------
| 176 | // consider the last bits. |
| 177 | // --------------------------------------------------------------- |
| 178 | inline size_t spp_mix_32(uint32_t a) |
| 179 | { |
| 180 | a = a ^ (a >> 4); |
| 181 | a = (a ^ 0xdeadbeef) + (a << 5); |
| 182 | a = a ^ (a >> 11); |
| 183 | return static_cast<size_t>(a); |
| 184 | } |
| 185 | |
| 186 | // More thorough scrambling as described in |
| 187 | // https://gist.github.com/badboy/6267743 |
no outgoing calls
no test coverage detected