A high performance, zero-copy URL router.
-
Updated
Apr 28, 2024 - Rust
A high performance, zero-copy URL router.
Trie (a.k.a. prefix tree) C# implementation. Has constant-time string prefix lookup.
adaptive radix tree (a.k.a prefix tree or compact trie)
A prefix tree (trie) implementation in go
A trie (prefix tree) data structure implementation in C#.
Genetic programming for math equations with prefix expression trees.
A Trie implementation in Go meant for auto-completion use cases. Supports Levenshtein distance search.
Trie implementation in pure Lua capable to build prefixes from iterable sequences
Efficient generic radix tree (trie) implementation in go
pretree is a package for storing and querying routing rules with prefix tree . obity/pretree in rust lang
This script generates and analyzes prefix tree adders.
Efficiently keep track of changes to genomes
Python trie implementation, for educational purposes
Usefull clases to be used all over Targoman projects and Other Qt/C++ based projects
Missing Trie implementation for Go
Fast fuzzy string search
Trie implementation for approximate string matching.
pretree is a package for storing and querying routing rules with prefix tree .
Add a description, image, and links to the prefix-tree topic page so that developers can more easily learn about it.
To associate your repository with the prefix-tree topic, visit your repo's landing page and select "manage topics."