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.

Drop-in C++ STL for C — same push_back, insert, begin/end. Header-only.

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++ STL containers reimplemented in C

C++ template containers with optimized memory consumption

A collection of generic header only data structures written in C

A simple dictionary implementation in C

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

Wait Free collections in C++

Concurrent HashMap C++

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

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.

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

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

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

Documentation Of C++ Standard Template Library (STLs) Used In Competitive Programming

Hashing technique in C++ in terms of key-value pair.