unordered_dense
Hash tables
A hash map and hash set implementation with optimized storage and deletion algorithms
A fast & densely stored hashmap and hashset based on robin-hood backward shift deletion
942 stars
20 watching
76 forks
Language: C++
last commit: about 2 months ago
Linked from 1 awesome list
c-plus-pluscppcpp17hashhash-tablesheader-only-libraryno-dependenciesstl-containersunordered-mapunordered-set
Related projects:
Repository | Description | Stars |
---|---|---|
tessil/sparse-map | A memory-efficient hash map and set implementation with flexible growth policies and support for heterogeneous lookups. | 334 |
greg7mdp/sparsepp | A high-performance hash map implementation for C++ with low memory usage and efficient resizing | 1,253 |
kassane/unordered | A collection of hash containers with different standards compliance levels and intended use cases. | 0 |
kshk123/hashmap | A concurrent thread-safe hash map implemented in C++. | 144 |
rigtorp/hashmap | A high-performance hash table implementation optimized for delete-heavy workloads | 200 |
skarupke/flat_hash_map | A high-performance implementation of a hash table data structure in C++ | 1,716 |
tessil/hopscotch-map | A fast hash map and hash set implementation using hopscotch hashing | 729 |
gregorycollins/hashtables | A set of implementations for mutable hash tables in Haskell. | 125 |
tessil/robin-map | A C++ implementation of fast hash maps and sets using robin hood hashing | 1,277 |
mljs/hash-table | An implementation of an open addressing hash table with double hashing in JavaScript | 1 |
sparsehash/sparsehash-c11 | An experimental C++ implementation of a hash map data structure optimized for sparse data | 287 |
orthecreedence/cl-hash-util | A utility library for working with Common Lisp hash tables | 29 |
samebchase/hash-set | An implementation of a data structure providing constant time lookup and insertion operations. | 17 |
mpdn/sqlite-digest | A set of functions to compute hashes in SQLite using OpenSSL | 19 |
jandrewrogers/metrohash | A set of fast and statistically robust hash functions designed for non-cryptographic use cases. | 361 |