prefix-tree
There are 112 repositories under prefix-tree topic.
ibraheemdev/matchit
A high performance, zero-copy URL router.
kpol/trie
Trie (a.k.a. prefix tree) C# implementation. Has constant-time string prefix lookup.
shivamMg/trie
A Trie implementation in Go meant for auto-completion use cases. Supports Levenshtein distance search.
viant/ptrie
A prefix tree implementation in go
IamFlea/AdderCircuitGenerator
This script generates and analyzes prefix tree adders.
ginkgobioworks/edge
Efficiently keep track of changes to genomes
beevik/prefixtree
A prefix tree (trie) implementation in go
rmandvikar/csharp-trie
A trie (prefix tree) data structure implementation in C#.
gammazero/radixtree
adaptive radix tree (a.k.a prefix tree or compact trie)
Validark/DynSDT
Dynamic Score-Decomposed Tries which more efficiently solve the prefix autocomplete problem
poke1024/simtrie
An efficient data structure for fast string similarity searches
porfirion/trie
Efficient generic compact radix tree (trie) implementation in go
H-K-R/CSE3142-Compiler-Design-Lab
This repository will contain codes of " Compiler Design (CSE3142) ".
ocramz/trie-perf
Performance shootout of various trie implementations
1995parham/FlashTrie.go
Flash Trie: Beyond 100-Gb/s IP Route Lookup Using Hash-Based Prefix-Compressed Trie
primaryobjects/genetic-programming
Genetic programming for math equations with prefix expression trees.
hzeng-otterai/ffsearch
Fast fuzzy string search
s0rg/trie
Generic prefix tree for golang
krasun/trie
Missing Trie implementation for Go
kamilmielnik/trie
Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.
monirz/gotri
Trie data structure implementation in Golang 🌳
neeraj1397/Performance-Analysis-of-Parallel-Prefix-Adders-Using-Zynq-7000-APSoC
Performed a comparative study of Parallel Prefix Adders using Verilog HDL on Zynq-7000 APSoC (PL) from XIlinx. Circuits are simulated, synthesized and implemented using Vivado Design Suite.
subpath/weighted_trie
🦀 Rust crate that allows creating weighted prefix trees that can be used in autocomplete
jfjlaros/dict-trie
Trie implementation for approximate string matching.
recoilme/art
Adaptive Radix Tree done right
vemonet/ptrie
🎄 Generic trie data structure (prefix tree) in Rust, with functions to search for common prefixes and postfixes
AleksandrHovhannisyan/Python-Trie-Implementation
Python trie implementation, for educational purposes
Targoman/TargomanCommon
Usefull clases to be used all over Targoman projects and Other Qt/C++ based projects
alussana/TrieSUS
Find the Smallest Unique Subset (SUS), fast
jvillegasd/IntelligentTextEditor
A simple text editor with an intelligent autocomplete.
MetaCorp/trie
Blazing fast, <1kb search for Javascript
rbotafogo/Critbit
Critbit tree for JRuby
aminography/RadixTree
An implementation of RadixTree data-structure, which is a great tool for indexing a large number of records with string keys.
jayalbo/ESDS
ES6 Data Structures
PerrySong/crypto-search
This is a npm package that converts user input to crypto-compare API search parameter.
sidvishnoi/compact-prefix-tree
A serializable compact prefix tree (also known as Radix tree or Patricia tree or space-optimized trie) implementation in JavaScript.