Templated type-safe hashmap implementation in C using open addressing and linear probing for collision resolution.

Fast and memory-efficient immutable collections and helper data structures

An open addressing linear probing hash table, tuned for delete heavy workloads

Faster.Map — A blazing-fast, memory-efficient HashMap library for .NET. Featuring SIMD-optimized DenseMap, lock-free CMap, and high-performance BlitzMap implementations designed for extreme speed, scalability, and low memory overhead. Ideal for real-time systems, caching engines, and high-density data workloads.

A collection of std-like containers written in C++11. Features fast unordered flat map/set, configurable double-ended vector and sparse deque.

A lightweight single-header open-addressing hashtable implementation in ANSI C

Comparison of Hashing Algorithms - Double Hashing, Robin Hood Hashing Cuckoo Hashing with Java's inbuilt HashMap/ HastSet over million of add(), contains() and remove() operations.

Data structures and algorithms implementation in pure C#!

Yet another efficient hashmap implementation for Golang based on the hopscotch open addressing scheme.

Implementing Hash-Table Lexicon using open-addressing and quadratic probing.

C Program For Open Address Collision

LinearMap is a minimalistic, high-performance hash map built around open addressing with linear probing. Instead of relying on buckets, used by std::unordered_map, it uses a fully contiguous memory layout to squeeze out every bit of performance modern CPUs can offer.

This repository contains all the data structures and their application in Java.

The project on comparison of different hashing approaches

Simple alternative to hcreate_r, hsearch_r, hdestroy_r GNU extensions

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

A fast Robin Hood hash table library in C

Hash Table implementation using Open addressing & Linear probing.

Container with linear probing resolver collision using LCFS-hashing.

Hash lib in C