adaptive radix tree (a.k.a prefix tree or compact trie)
-
Updated
Sep 11, 2024 - Go
adaptive radix tree (a.k.a prefix tree or compact trie)
Efficient generic compact radix tree (trie) implementation in go
Data structure for fast ranked autocomplete based on a given prefix, implemented in Go.
A versioned radix tree library implementation for Go
A radix tree library implementation for Go
A text autocompleter with golang
A radix (or possibly Patricia) trie
Add a description, image, and links to the radix-trie topic page so that developers can more easily learn about it.
To associate your repository with the radix-trie topic, visit your repo's landing page and select "manage topics."