Patricia Tree data structure in OCaml for maps and sets, supports generic (GADT) keys
-
Updated
Jun 12, 2024 - OCaml
Patricia Tree data structure in OCaml for maps and sets, supports generic (GADT) keys
Garbage collector-sensitive patricia tree for IP/CIDR tagging
A memory-efficient patricia tree implementation written in Rust
Instant auto suggestion and completion
PruningRadixTrie - 1000x faster Radix trie for prefix search & auto-complete
Persistent set of integers, implemented using PATRICIA tree data structure
Efficient generic radix tree (trie) implementation in go
Advanced Algorithms and Data Structures FER labs
Implementation of Radix Tree assuming use in HTTP Router.
Store CIDR IP addresses (both v4 and v6) in a trie for easy lookup.
A java implementation of patricia-merkle-trie data structure
A generic patricia trie (also called radix tree) implemented in Go (Golang)
Patricia trie on C++
A library of binary tree data structures (bstree, dstree, trie, crit-bit, PATRICIA) implemented in C
Practical Works Algorithm and Data Structures II
Various merkle trees
Add a description, image, and links to the patricia-tree topic page so that developers can more easily learn about it.
To associate your repository with the patricia-tree topic, visit your repo's landing page and select "manage topics."