This is a simple fast implementation of an open addressing hash table for string keys.
Its memory layout follows the idea behind array-hash
.
For example, a benchmark result querying 1K Japanese words showed
simplearrayhash::HashMap::get = 25.869 us
std::collections::HashMap::get = 104.38 us
on my laptop PC. Visit the directory bench
to see the benchmark setting.