A performant, parallel, probabilistic, random acyclic-graph, low-latency, perfect hash generation library.
-
Updated
Jun 9, 2025 - C
A performant, parallel, probabilistic, random acyclic-graph, low-latency, perfect hash generation library.
Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup
Fast Scalable Minimal Perfect Hash for Large Keysets
Tiny perfect hash library for dotnet
Random Graph Perfect Hashing with optional Lua bindings
This is my second project about File Organization. It's all about Perfect Hashing Cichelli’s Algorithm.
English to Bangla dictionary implemented with Perfect Hashing. Algo Course Assignment.
A high-performance Rust crate for deinflecting Japanese words using perfect hash tables
Special purpose java collections
The implementation of perfect hashing based parallel failureless Aho-Corasick algorithm on Graphic Processing Units
Implementation of a perfect hashing data structure. We say a hash function is perfect for S if all lookups involve O(1) work.
Home of an ecosystem of connected apps. The proving ground for the minimal perfect hash function (MPHF), the kireji web framework and the Gamified Universal IDE (GUIDE).
Perfect hash function generator
Different algorithms and data structures implementations.
Modern C++20 header-only library for algebraic hash function composition with elegant DSL
C and C++ library for fast, caseless (case-insensitive) comparison of Unicode utf-8 strings
Impelementation for some Perfect hashing algorithms
File archive library for bundling and protecting resources using compile-time code generation
Implementation of a perfect hashing data structure using different space complexity solutions.
Add a description, image, and links to the perfect-hashing topic page so that developers can more easily learn about it.
To associate your repository with the perfect-hashing topic, visit your repo's landing page and select "manage topics."