A fast, memory efficient hash map for C++

C++ implementation of a fast hash map and hash set using robin hood hashing

C++ hash map and hash set which preserve the order of insertion

C++ implementation of a fast hash map and hash set using hopscotch hashing

Ordered dictionary data structure implementation in Swift

C++ implementation of a memory efficient hash map and hash set

Study group for algorithms in Ruby, hosted at App Academy

Data Structures and Algorithms in Java

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.

Very fast, high-quality hash function, discrete-incremental and streamed hashing-capable (non-cryptographic, inline C/C++) 26GB/s + PRNG

Count kmers with a more efficient (faster) hash table

Hash Array Mapped Trie (HAMT) implemented in Go (1.18+ generics)

Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup

A simple cross-platform speed & memory-efficiency benchmark for the most common hash-table implementations in the C++ world

Compile-time single-header hash-map written in C++ 17

Hash-Table implementation using Python. (Chaining, Open Addressing & Resizing)

A benchmark for hash tables and hash functions in C++, evaluate on different data as comprehensively as possible

C++ template containers with optimized memory consumption