A family of header-only, very fast and memory-friendly hashmap and btree containers.

A fast & densely stored hashmap and hashset based on robin-hood backward shift deletion

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

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

Reimplementations of containers from the C++ Standard Library in C

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

C++ template containers with optimized memory consumption

A simple dictionary implementation in C

Wait Free collections in C++

Fast C++ flat (open addressing) hash set, map

Concurrent HashMap C++

A robust C++ solution for validating parentheses in strings. This project features a well-tested algorithm that handles different types of parentheses, including (), {}, and []. It is designed to cover a wide range of scenarios, from simple to complex nested structures, ensuring the correct ordering and pairing of parentheses.

A collection of slot maps and hash maps optimized for unsigned keys.

Hashing Data Structure.

C implementations of basic C++-like container types

A plain C implementation of vector and hashtable

Simple implementation of Hash Table in C++. It's mainly intended to show how hash tables are implemented by libraries like STL.

Collection of STL and algorithms code snippets with tutorials for quick reference and learning.

Implement an Unordered Map in C++ using Hash Functions. Without any inbuilt function of C++.