Fast generic radix trie implemented in Rust
-
Updated
Mar 6, 2023 - Rust
Fast generic radix trie implemented in Rust
PruningRadixTrie - 1000x faster Radix trie for prefix search & auto-complete
fast, modular client-side router
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.
adaptive radix tree (a.k.a prefix tree or compact trie)
Go bindings for radix tree library for fast subnet (IPv4 and IPv6) lookups
Efficient generic radix tree (trie) implementation in go
Radix Trie (in Javascript)
A lightweight and fast router for PHP
Fork of the project http://code.google.com/p/radixtree
PyPruningRadixTrie - Python version of super fast Radix trie for prefix search & auto-complete
A radix tree library implementation for Go
Data structure for fast ranked autocomplete based on a given prefix, implemented in Go.
A versioned radix tree library implementation for Go
Implementation of Radix-Tree in C++.
An implementation of RadixTree data-structure, which is a great tool for indexing a large number of records with string keys.
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."