Fast & memory efficient hashtable based on robin hood hashing for C++11/14/17/20
-
Updated
May 1, 2023 - C++
Fast & memory efficient hashtable based on robin hood hashing for C++11/14/17/20
A fast, memory efficient hash map for C++
A fast & densely stored hashmap and hashset based on robin-hood backward shift deletion
Leverage the power of modern C++ to build robust and scalable applications
(Legacy) Extremely fast unordered map and set library for C++20
An analysis of Serparate Chaining and Quadratic Probing Algorithms in C++.
Performance Comparison of Two Hashing Algorithms with Integer Keys
Count canonical kmers with Malte Skarupke's bytell_hash_map hash table
Computer exercises of Data Structures course; Fall 2021
discrete_map: A STL-compliant, fully customisable hash map with decoupled keys and values
Using a graph to find the best recommendation based on your purchases.
Count canonical kmers with Google sparse_hash_map
Here are the results of my attempts to implement popular data structures from scratch.
A Students Enrollment system using a Finite Set data structure represented as a Hash Table.
Library search system that allows users to search, add, and remove books efficiently using appropriate data structures and algorithms.
Codes from lectures and labs from class Gagnaskipan (Data Structures), Reykjavik University 2017-1
Count canonical kmers with Emil Ernerfeldt's emilib::HashMap
Digital Address Book using Hash Table
Add a description, image, and links to the hash-tables topic page so that developers can more easily learn about it.
To associate your repository with the hash-tables topic, visit your repo's landing page and select "manage topics."