search for: get_null_cod

.../ operator size_t() const { return value; } > > /// \brief Get a hash_code object which corresponds to a null code. > /// > /// The null code must never be the result of any 'hash_value' calls and can > /// be used to detect an unset hash_code. > static hash_code get_null_code() { return 0; } > > /// \brief Get a hash_code object which corresponds to an invalid code. > /// > /// The invalid code must never be the result of any 'hash_value' calls. This > /// can be used to flag invalid hash_codes or mark entries in a hash table. > stat...

Thanks for the feedback thus far! I've updated the header file, and enclosed a complete patch against LLVM. This passes all the regtests, and I'll be doing more thorough testing of LLVM itself with the patch. I've included some basic unit tests, but could probably do more here... Not sure it's worth delaying the initial submission though, as the best testing is to use a hash

Hello folks, TL;DR: This is my proposed hashing interface based on a proposed standard hashing interface. It also is implemented with a much faster and higher quality algorithm than the current one. This is an *early draft* of the code, looking for initial feedback. There has been recent interest in improving the quality and consistency of LLVM's approach to hashing. In particular, getting