PatriciaGarbage 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 TreeAlgo-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.
Router⚡️ A lightning fast HTTP router
OpendsTemplate Library of Data Structures in C++17
AlgorithmsA collection of common algorithms and data structures implemented in java, c++, and python.
Trie4jPATRICIA, Double Array, LOUDS Trie implementations for Java
SlimSurprisingly 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.
GseGo efficient multilingual NLP and text segmentation; support english, chinese, japanese and other. Go 高性能多语言 NLP 和分词
TongramsA C++ library providing fast language model queries in compressed space.
FlashGolang Keyword extraction/replacement Datastructure using Tries instead of regexes
Efrtneato compression for key-value data
ThmapConcurrent trie-hash map library
Qp Trie RsAn idiomatic and fast QP-trie implementation in pure Rust.
Libgenericslibgenerics is a minimalistic and generic library for C basic data structures.
TrieA Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.
Autosuggest TrieMinimalistic trie implementation for autosuggest and autocomplete components
Kua⚡️ Lightning fast URL routing in Python (trie router)
Nano SqlUniversal 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.
PyahocorasickPython module (C extension and plain python) implementing Aho-Corasick algorithm
Hat TrieC++ implementation of a fast and memory efficient HAT-trie
CapsuleThe Capsule Hash Trie Collections Library
Baekjoon코딩테스트 대비 문제집(Baekjoon Online Judge)
Sensitive敏感词查找,验证,过滤和替换 🤓 FindAll, Validate, Filter and Replace words.
Merkle Patricia TreeProject is in active development and has been moved to the EthereumJS VM monorepo.
MuxieMuxie is a modern, fast and light HTTP multiplexer for Go. Fully compatible with the http.Handler interface. Written for everyone.
trie-prefix-treeCreate and modify trie prefix structures and extract word lists including prefixes, anagrams and sub-anagrams
poplar-trieC++17 implementation of memory-efficient dynamic tries
Data-Structures-and-AlgorithmsImplementation 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.
lucillaFast, efficient, in-memory Full Text Search for Kotlin
aho-corasick-nodeA Node implementation of the Aho-Corasick string matching algorithm based on DoubleArray Trie.
retrieEfficient Trie-based regex unions for blacklist/whitelist filtering and one-pass mapping-based string replacing
radixGolang radix tree implementation
Data-StructuresAlgorithmic Problems Solutions -- hash table code featured in geeksforgeeks
AlgorithmsData Structures & Algorithms. Includes solutions for Cracking the Coding Interview 6th Edition
prefixtreeA prefix tree (trie) implementation in go
Competitive ProgrammingContains solutions and codes to various online competitive programming challenges and some good problems. The links to the problem sets are specified at the beginning of each code.
HArrayFastest Trie structure (Linux & Windows)
treebitmapFast IP lookup table for IPv4/IPv6 prefixes
go-erasureErasure coding (Reed–Solomon coding) in Go
trie-muxA minimal and powerful trie based url path router (or mux) for Go.
unitdbFast specialized time-series database for IoT, real-time internet connected devices and AI analytics.
csharp-trieA trie (prefix tree) data structure implementation in C#.
Algorithms-JavaA collection of common algorithms and data structures implemented in Java.