Tessil’s hopscotch-map offers a fast C++ hash map and set using cache-friendly hopscotch hashing

The repository provides a C++ hopscotch hashing implementation for fast hash maps and sets, designed to outperform std::unordered_map in many cases while using less memory than google::dense_hash_map. It includes multiple variants with power-of-two or prime growth policies, plus bounded versions for workloads needing stronger worst-case guarantees.

The project reflects ongoing demand for specialized C++ containers that trade standard-library simplicity for better performance and memory efficiency. Its support for different growth policies highlights a broader trend toward workload-aware data structures that account for hash quality, cache behavior, and adversarial inputs.