hat-trie
A C++ header-only library implementing a fast and memory-efficient HAT-trie data structure for storing sets and maps of strings.
What is hat-trie?
hat-trie is a C++ library that implements the HAT-trie data structure, a cache-conscious trie optimized for storing and querying large sets or maps of strings. It solves the problem of high memory usage in traditional hash tables and tries by compressing common prefixes, offering fast exact and prefix searches with low memory overhead.
C++ developers working with large dictionaries, autocompletion systems, or applications requiring efficient string storage and retrieval, such as search engines, databases, or text processing tools.
Developers choose hat-trie for its superior memory efficiency and performance in string-heavy workloads, providing a header-only, configurable alternative to standard containers like std::unordered_map while supporting advanced features like prefix searches and serialization.
Overview
C++ implementation of a fast and memory efficient HAT-trie
Use Cases
Best For
- Storing large dictionaries or word lists with minimal memory usage
Related Projects
Found a gem we're missing?
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.
