Search code, repositories, users, issues, pull requests...
This project's goal is to devise, implement, and evaluate techniques for generating optimized hash functions tailored for string keys whose format can be approximated by a regular expression inferred through profiling. These functions will be used to improve the performance of C++'s STL data structures, such as std::unordered_map, std::unordered_set, std::unordered_multimap and std::unordered_multiset, in addition to any other std::hash specialization for user-defined C++ types.
Rust is only necessary if you want to run the experiments. If you are only interested in the hash functions generation, only clang is necessary.
To synthesize hash functions from key examples, you only need to create a file containing a non-exhaustive but representative key set.
After running, ./scripts/make_hash_from_regex.sh "(([0-9]{3})\.){3}[0-9]{3}", you should get the following output with two function options:
