HashMap
Hash table
A high-performance hash table implementation optimized for delete-heavy workloads
An open addressing linear probing hash table, tuned for delete heavy workloads
200 stars
15 watching
33 forks
Language: C++
last commit: over 1 year ago
Linked from 1 awesome list
backshift-deletionhashmaphashtablelinear-probingopen-addressing
Related projects:
Repository | Description | Stars |
---|---|---|
| A high-performance implementation of a hash table data structure in C++ | 1,721 |
| A high-performance hash map implementation for C++ with low memory usage and efficient resizing | 1,257 |
| A concurrent thread-safe hash map implemented in C++. | 145 |
| A memory-efficient hash map and set implementation with flexible growth policies and support for heterogeneous lookups. | 337 |
| A simple hash table implementation with optimization techniques to reduce full scan risk | 7 |
| An implementation of hash table algorithms for efficient data storage and retrieval | 254 |
| A fast hash map and hash set implementation using hopscotch hashing | 731 |
| A hash map and hash set implementation with optimized storage and deletion algorithms | 968 |
| 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 |
| A log-structured hash table for fast key/value data storage | 1,293 |
| A peer-to-peer distributed hash table implementation with support for discovery and hole punching | 95 |
| A set of implementations for mutable hash tables in Haskell. | 127 |
| An implementation of a hash table data structure for use with AutoHotkey scripts | 9 |
| A fast and immutable map implementation for F#. | 62 |