Combine two hashes in an order-independent way. This operation should be associative and compute the same hash for a collection of elements independent of traversal order. Note that it is better to combine hashes symmetrically with addition rather than XOR, since (x^x) == 0 but (x+x) != 0.
| 121 | // independent of traversal order. Note that it is better to combine hashes |
| 122 | // symmetrically with addition rather than XOR, since (x^x) == 0 but (x+x) != 0. |
| 123 | inline uint64 Hash64CombineUnordered(uint64 a, uint64 b) { return a + b; } |
| 124 | |
| 125 | // Hash functor suitable for use with power-of-two sized hashtables. Use |
| 126 | // instead of std::hash<T>. |
no outgoing calls
no test coverage detected