PruningRadixTrie - 1000x faster Radix trie for prefix search & auto-complete
A generic patricia trie (also called radix tree) implemented in Go (Golang)
Garbage collector-sensitive patricia tree for IP/CIDR tagging
A memory-efficient patricia tree implementation written in Rust
A library of binary tree data structures (bstree, dstree, trie, crit-bit, PATRICIA) implemented in C
Instant auto suggestion and completion
An example showing how to read Merkle Patricia Trie for Ethereum block or contract
Patricia Tree data structure in OCaml for maps and sets, supports generic (GADT) keys
A model-based QuickCheck test of ptrees (Patricia trees)
Store CIDR IP addresses (both v4 and v6) in a trie for easy lookup.
Multi Key Radix PATRICIA Fast Search - OO C++ - a C++ header file only class
A serializable compact prefix tree (also known as Radix tree or Patricia tree or space-optimized trie) implementation in JavaScript.
A java implementation of patricia-merkle-trie data structure
Implementation of a Patricia/radix tree data structure, storing a dictionary.
Contains sample codes of algorithms and technologies used for blockchain in the go language
