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
968 stars
20 watching
77 forks
Language: C++
last commit: 3 months ago
Linked from 1 awesome list
c-plus-pluscppcpp17hashhash-tablesheader-only-libraryno-dependenciesstl-containersunordered-mapunordered-set
Related projects:
Repository | Description | Stars |
---|---|---|
| A memory-efficient hash map and set implementation with flexible growth policies and support for heterogeneous lookups. | 337 |
| A high-performance hash map implementation for C++ with low memory usage and efficient resizing | 1,257 |
| A collection of hash containers with different standards compliance levels and intended use cases. | 0 |
| A concurrent thread-safe hash map implemented in C++. | 145 |
| A high-performance hash table implementation optimized for delete-heavy workloads | 200 |
| A high-performance implementation of a hash table data structure in C++ | 1,721 |
| A fast hash map and hash set implementation using hopscotch hashing | 731 |
| A set of implementations for mutable hash tables in Haskell. | 127 |
| A C++ implementation of fast hash maps and sets using robin hood hashing | 1,294 |
| An implementation of an open addressing hash table with double hashing in JavaScript | 1 |
| An experimental C++ implementation of a hash map data structure optimized for sparse data | 287 |
| A utility library for working with Common Lisp hash tables | 29 |
| An implementation of the hash-set data structure | 17 |
| A set of functions to compute hashes in SQLite using OpenSSL | 18 |
| A set of fast and statistically robust hash functions designed for non-cryptographic use cases. | 360 |