Top 67 trie open source projects

Patricia
Garbage collector-sensitive patricia tree for IP/CIDR tagging
Opencc4j
🇨🇳Open Chinese Convert is an opensource project for conversion between Traditional Chinese and Simplified Chinese.(java 中文繁简体转换)
Algo Tree
Algo-Tree is a collection of Algorithms and data structures which are fundamentals to efficient code and good software design. Creating and designing excellent algorithms is required for being an exemplary programmer. It contains solutions in various languages such as C++, Python and Java.
Opends
Template Library of Data Structures in C++17
Trie4j
PATRICIA, Double Array, LOUDS Trie implementations for Java
✭ 139
javatrie
Slim
Surprisingly space efficient trie in Golang(11 bits/key; 100 ns/get).
Trienet
.NET Implementations of Trie Data Structures for Substring Search, Auto-completion and Intelli-sense. Includes: patricia trie, suffix trie and a trie implementation using Ukkonen's algorithm.
Gse
Go efficient multilingual NLP and text segmentation; support english, chinese, japanese and other. Go 高性能多语言 NLP 和分词
Completely
Java autocomplete library.
Tongrams
A C++ library providing fast language model queries in compressed space.
Flash
Golang Keyword extraction/replacement Datastructure using Tries instead of regexes
Adaptive Radix Tree
A fast and space efficient Radix tree in Java
Efrt
neato compression for key-value data
Thmap
Concurrent trie-hash map library
Qp Trie Rs
An idiomatic and fast QP-trie implementation in pure Rust.
Libgenerics
libgenerics is a minimalistic and generic library for C basic data structures.
Trie
A Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.
Autosuggest Trie
Minimalistic trie implementation for autosuggest and autocomplete components
Kua
⚡️ Lightning fast URL routing in Python (trie router)
Nano Sql
Universal database layer for the client, server & mobile devices. It's like Lego for databases.
Bitcask
🔑A high performance Key/Value store written in Go with a predictable read/write performance and high throughput. Uses a Bitcask on-disk layout (LSM+WAL) similar to Riak.
Pyahocorasick
Python module (C extension and plain python) implementing Aho-Corasick algorithm
Hat Trie
C++ implementation of a fast and memory efficient HAT-trie
Capsule
The Capsule Hash Trie Collections Library
Baekjoon
코딩테스트 대비 문제집(Baekjoon Online Judge)
Sensitive
敏感词查找,验证,过滤和替换 🤓 FindAll, Validate, Filter and Replace words.
Merkle Patricia Tree
Project is in active development and has been moved to the EthereumJS VM monorepo.
Muxie
Muxie is a modern, fast and light HTTP multiplexer for Go. Fully compatible with the http.Handler interface. Written for everyone.
trie-prefix-tree
Create and modify trie prefix structures and extract word lists including prefixes, anagrams and sub-anagrams
poplar-trie
C++17 implementation of memory-efficient dynamic tries
Data-Structures-and-Algorithms
Implementation of various Data Structures and algorithms - Linked List, Stacks, Queues, Binary Search Tree, AVL tree,Red Black Trees, Trie, Graph Algorithms, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Segment Trees etc.
fixie-trie
Compact tries for fixed-width keys
lucilla
Fast, efficient, in-memory Full Text Search for Kotlin
aho-corasick-node
A Node implementation of the Aho-Corasick string matching algorithm based on DoubleArray Trie.
retrie
Efficient Trie-based regex unions for blacklist/whitelist filtering and one-pass mapping-based string replacing
radix
Golang radix tree implementation
triebeard
Radix trees in Rcpp and R
Data-Structures
Algorithmic Problems Solutions -- hash table code featured in geeksforgeeks
prefixtree
A prefix tree (trie) implementation in go
HArray
Fastest Trie structure (Linux & Windows)
treebitmap
Fast IP lookup table for IPv4/IPv6 prefixes
go-erasure
Erasure coding (Reed–Solomon coding) in Go
trie-mux
A minimal and powerful trie based url path router (or mux) for Go.
unitdb
Fast specialized time-series database for IoT, real-time internet connected devices and AI analytics.
csharp-trie
A trie (prefix tree) data structure implementation in C#.
1-60 of 67 trie projects