C++ implementation of a fast hash map and hash set using robin hood hashing
-
Updated
Sep 22, 2024 - C++
C++ implementation of a fast hash map and hash set using robin hood hashing
A fast, memory efficient hash map for 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
C++ template containers with optimized memory consumption
(Legacy) Extremely fast unordered map and set library for C++20
A simple cross-platform speed & memory-efficiency benchmark for the most common hash-table implementations in the C++ world
Add a description, image, and links to the hash-map topic page so that developers can more easily learn about it.
To associate your repository with the hash-map topic, visit your repo's landing page and select "manage topics."