C++ implementation of a fast hash map and hash set using robin hood hashing
A fast, memory efficient hash map for C++
翻译 - 用于C ++的快速，内存高效的哈希映射
C++ implementation of a fast hash map and hash set using hopscotch hashing
C++ hash map and hash set which preserve the order of insertion
C++ implementation of a memory efficient hash map and hash set
Very fast, high-quality hash function, discrete-incremental and streamed hashing-capable (non-cryptographic, inline C/C++) 26GB/s + PRNG
Ordered dictionary data structure implementation in Swift
C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
This library provides various containers. Each container has utility functions to manipulate the data it holds. This is an abstraction as to not have to manually manage and reallocate memory.
#算法刷题#Study group for algorithms in Ruby, hosted at App Academy
Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup
Count kmers with a more efficient (faster) hash table
Fast, data-oriented, stdlib-style hash table
A benchmark for hash tables and hash functions in C++, evaluate on different data as comprehensively as possible
Compile-time single-header hash-map written in C++ 17
Low-latency hash map using minimal perfect hash functions and compact encoding.
C++ template containers with optimized memory consumption
(Legacy) Extremely fast unordered map and set library for C++20