A high performance, zero-copy URL router.
-
Updated
Aug 18, 2024 - Rust
A high performance, zero-copy URL router.
A Trie implementation in Go meant for auto-completion use cases. Supports Levenshtein distance search.
Trie (a.k.a. prefix tree) C# implementation. Has constant-time string prefix lookup.
Efficiently keep track of changes to genomes
This script generates and analyzes prefix tree adders.
A trie (prefix tree) data structure implementation in C#.
A prefix tree (trie) implementation in go
adaptive radix tree (a.k.a prefix tree or compact trie)
An efficient data structure for fast string similarity searches
Efficient generic compact radix tree (trie) implementation in go
Dynamic Score-Decomposed Tries which more efficiently solve the prefix autocomplete problem
Performance shootout of various trie implementations
This repository will contain codes of " Compiler Design (CSE3142) ".
Flash Trie: Beyond 100-Gb/s IP Route Lookup Using Hash-Based Prefix-Compressed Trie
Genetic programming for math equations with prefix expression trees.
Fast fuzzy string search
Generic prefix tree for golang
Missing Trie implementation for Go
Trie data structure implementation in Golang 🌳
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."