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)
PruningRadixTrie - 1000x faster Radix trie for prefix search & auto-complete
Radix Trie (in Javascript)
Data structure for fast ranked autocomplete based on a given prefix, implemented in Go.
Efficient generic compact radix tree (trie) implementation in go
extra-collections (or extra for short) is a python3 package that provides a pythonic, intuitive, and easy implementation of the most common data structures used in software projects.
Fast generic radix trie implemented in Rust
A lightweight and fast router for PHP
PyPruningRadixTrie - Python version of super fast Radix trie for prefix search & auto-complete
Data structure compressed prefix tree
Go bindings for radix tree library for fast subnet (IPv4 and IPv6) lookups
An implementation of RadixTree data-structure, which is a great tool for indexing a large number of records with string keys.
A radix tree library implementation for Go
A versioned radix tree library implementation for Go
High Performance C# Subnetting
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."