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 benchmark for hash tables and hash functions in C++, evaluate on different data as comprehensively as possible

C++ template containers with optimized memory consumption

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

A simple dictionary implementation in C

Wait Free collections in 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.

Concurrent HashMap C++

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

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

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

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

A plain C implementation of vector and hashtable

Hashing Data Structure.

Implemented AVL tree as well as ordered and unordered hashmaps from scratch

Complete STL(Standard Template Library) With Example And Source Code

The program implements a simple lock manager.

This repository provides a custom implementation of an unordered map in C++, demonstrating the working and importance of a hash function. The implementation does not rely on any external libraries and offers support for various data types.