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.

A prefix tree implementation in go

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

Dynamic Score-Decomposed Tries which more efficiently solve the prefix autocomplete problem

Efficient generic compact radix tree (trie) implementation in go

This repository will contain codes of " Compiler Design (CSE3142) ".

Performance shootout of various trie implementations

Genetic programming for math equations with prefix expression trees.

Flash Trie: Beyond 100-Gb/s IP Route Lookup Using Hash-Based Prefix-Compressed Trie

Fast fuzzy string search

Generic prefix tree for golang

Missing Trie implementation for Go

Trie data structure implementation in Golang 🌳