An efficient trie implementation.
☆255Nov 25, 2020Updated 5 years ago
Alternatives and similar repositories for hat-trie
Users that are interested in hat-trie are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- A compact implementation of Dr. Askitis HatTrie☆80May 20, 2014Updated 11 years ago
- HAT-Trie for Python☆87Feb 8, 2016Updated 10 years ago
- The HAT-trie, written in C, as described in my PhD thesis.☆21Nov 17, 2016Updated 9 years ago
- C99 trie library☆101May 4, 2019Updated 6 years ago
- C++ implementation of a fast and memory efficient HAT-trie☆859Nov 11, 2025Updated 4 months ago
- An efficient trie implementation.☆16Sep 15, 2014Updated 11 years ago
- An implementation of Judy Arrays in 1250 Lines of C Code. (with sample CLI applications and Xcode project)☆17Jun 23, 2011Updated 14 years ago
- Adaptive Radix Trees implemented in C☆819Mar 21, 2022Updated 4 years ago
- Reduced on-disk Suffix Array☆22Oct 9, 2013Updated 12 years ago
- MARISA: Matching Algorithm with Recursively Implemented StorAge☆597Mar 17, 2026Updated last week
- Critbit trees in C☆333Dec 17, 2021Updated 4 years ago
- Automatically exported from code.google.com/p/tx-trie☆29Jun 23, 2015Updated 10 years ago
- An implementation of the Judy array, wrapped in a c++ template. Uses Karl Malbrain's implementation, http://code.google.com/p/judyarray/ …☆45Mar 3, 2015Updated 11 years ago
- Lua bindings for Wt☆13Oct 19, 2019Updated 6 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆45Nov 17, 2016Updated 9 years ago
- A collection of succinct data structures☆213Jan 3, 2024Updated 2 years ago
- A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit f…☆275Sep 14, 2021Updated 4 years ago
- A C library for creating and accessing dynamic arrays with near O(log-base-256) scalability into the peta-element range☆33Dec 14, 2010Updated 15 years ago
- Cedar implements an updatable double-array trie, which offers fast update/lookup for skewed queries in real-world data.☆24Mar 20, 2015Updated 11 years ago
- Bloom-filter based minimal perfect hash function library☆276Jul 16, 2025Updated 8 months ago
- A simple C library for compressing lists of integers using binary packing☆524Aug 18, 2023Updated 2 years ago
- A hash table implementation using Robin Hood Linear Probing☆52May 31, 2014Updated 11 years ago
- Compact Data Structures Library☆102Jun 20, 2022Updated 3 years ago
- A tiny Unix dynamic memory allocator library.☆62Oct 10, 2017Updated 8 years ago
- A port of Stream VByte to Go☆35Feb 22, 2022Updated 4 years ago
- Static Huffman coding☆10Apr 3, 2017Updated 8 years ago
- provides a Suricata Eve output for Kafka with Suricate Eve plugin☆15Nov 25, 2021Updated 4 years ago
- Portable Event Library☆18Apr 28, 2025Updated 10 months ago
- Suite of universal indexes for Highly Repetitive Document Collections☆24May 14, 2020Updated 5 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Feb 15, 2022Updated 4 years ago
- Hash Array Mapped Trie (C++ Templates)☆125Apr 24, 2023Updated 2 years ago
- A simple data serializer in C☆200Mar 6, 2014Updated 12 years ago
- Universe-sliced indexes in C++.☆18Jan 8, 2023Updated 3 years ago
- Low-Level Data Structure - efficient data structures, and fast data access in the 3.x/4.x/5.x/6.x kernel☆121Feb 22, 2023Updated 3 years ago
- WhiteDB memory database☆606Dec 2, 2022Updated 3 years ago
- qp tries and crit-bit tries☆124Jul 12, 2022Updated 3 years ago
- Succinct Data Structure Library 2.0☆2,299Jun 2, 2023Updated 2 years ago
- Feed-forward Bloom filters☆53Jun 7, 2011Updated 14 years ago
- Better code coverage tool for JavaScript.☆89May 21, 2020Updated 5 years ago