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
C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
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
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
A concurrent hash map implementation in C++
A thread-safe hash map implementation in C++ with support for concurrent read and write operations.
Exercises from Data Structures course in Software Engineering Program from Universidad Complutense de Madrid
A collection of slot maps and hash maps optimized for unsigned keys.
COP3530 Project 2
Simple alternative to hcreate_r, hsearch_r, hdestroy_r GNU extensions
A comprehensive C++ library for efficient data management using hash tables. Features customizable hashing, collision resolution.
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."