C++ implementation of a fast hash map and hash set using robin hood hashing
-
Updated
May 11, 2024 - C++
C++ implementation of a fast hash map and hash set using robin hood hashing
C++ hash map and hash set which preserve the order of insertion
C++ implementation of a fast hash map and hash set using hopscotch hashing
C++ implementation of a memory efficient hash map and hash set
C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
Scalable Hashing on Persistent Memory
gBolt--very fast implementation for gSpan algorithm in data mining
Solution to problems in "Cracking the Coding Interview" in C++.
Data Structures and Algorithms in C++
Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup
Examples of intrusive container templates in C++.
A simple cross-platform speed & memory-efficiency benchmark for the most common hash-table implementations in the C++ world
A solution to Fault Tolerant Key-Value Store assignment for cloud computing concepts part 2 (Coursera)
This is a project I completed in my Algorithms and Data Structures class. It is an implementation of Google's PageRank algorithm. It allows a user to search for a term on the clemson.edu domain and see every webpage that the word appears on along with that page's Google PageRank score (which shows how important the webpage is). The webpages.txt …
Compile-time single-header hash-map written in C++ 17
C++ template containers with optimized memory consumption
Different algorithms and data structures implementations.
(Legacy) Extremely fast unordered map and set library for C++20
A concurrent hash map implementation in C++
Optimization of Hash table
Add a description, image, and links to the hash-table topic page so that developers can more easily learn about it.
To associate your repository with the hash-table topic, visit your repo's landing page and select "manage topics."