triebeardRadix trees in Rcpp and R
Stars: ✭ 29 (-79.14%)
go-erasureErasure coding (Reed–Solomon coding) in Go
Stars: ✭ 44 (-68.35%)
CapsuleThe Capsule Hash Trie Collections Library
Stars: ✭ 350 (+151.8%)
aho-corasick-nodeA Node implementation of the Aho-Corasick string matching algorithm based on DoubleArray Trie.
Stars: ✭ 16 (-88.49%)
trieMy take on an efficient implementation of a Trie in Javascript
Stars: ✭ 72 (-48.2%)
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.
Stars: ✭ 654 (+370.5%)
prefixtreeA prefix tree (trie) implementation in go
Stars: ✭ 21 (-84.89%)
Efrtneato compression for key-value data
Stars: ✭ 58 (-58.27%)
Algorithms-JavaA collection of common algorithms and data structures implemented in Java.
Stars: ✭ 141 (+1.44%)
Merkle Patricia TreeProject is in active development and has been moved to the EthereumJS VM monorepo.
Stars: ✭ 277 (+99.28%)
fixie-trieCompact tries for fixed-width keys
Stars: ✭ 23 (-83.45%)
Data StructuresA collection of powerful data structures
Stars: ✭ 2,534 (+1723.02%)
Kua⚡️ Lightning fast URL routing in Python (trie router)
Stars: ✭ 18 (-87.05%)
radixGolang radix tree implementation
Stars: ✭ 30 (-78.42%)
FlashGolang Keyword extraction/replacement Datastructure using Tries instead of regexes
Stars: ✭ 79 (-43.17%)
Hat TrieC++ implementation of a fast and memory efficient HAT-trie
Stars: ✭ 565 (+306.47%)
HArrayFastest Trie structure (Linux & Windows)
Stars: ✭ 89 (-35.97%)
unitdbFast specialized time-series database for IoT, real-time internet connected devices and AI analytics.
Stars: ✭ 97 (-30.22%)
Baekjoon코딩테스트 대비 문제집(Baekjoon Online Judge)
Stars: ✭ 295 (+112.23%)
Qp Trie RsAn idiomatic and fast QP-trie implementation in pure Rust.
Stars: ✭ 47 (-66.19%)
goblinA golang http router based on trie tree.
Stars: ✭ 52 (-62.59%)
DawgSharpDAWG String Dictionary in C#
Stars: ✭ 72 (-48.2%)
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.
Stars: ✭ 144 (+3.6%)
PatriciaGarbage collector-sensitive patricia tree for IP/CIDR tagging
Stars: ✭ 194 (+39.57%)
Autosuggest TrieMinimalistic trie implementation for autosuggest and autocomplete components
Stars: ✭ 22 (-84.17%)
lucillaFast, efficient, in-memory Full Text Search for Kotlin
Stars: ✭ 102 (-26.62%)
TongramsA C++ library providing fast language model queries in compressed space.
Stars: ✭ 88 (-36.69%)
retrieEfficient Trie-based regex unions for blacklist/whitelist filtering and one-pass mapping-based string replacing
Stars: ✭ 35 (-74.82%)
Nano SqlUniversal database layer for the client, server & mobile devices. It's like Lego for databases.
Stars: ✭ 717 (+415.83%)
GseGo efficient multilingual NLP and text segmentation; support english, chinese, japanese and other. Go 高性能多语言 NLP 和分词
Stars: ✭ 1,695 (+1119.42%)
Data-StructuresAlgorithmic Problems Solutions -- hash table code featured in geeksforgeeks
Stars: ✭ 44 (-68.35%)
PyahocorasickPython module (C extension and plain python) implementing Aho-Corasick algorithm
Stars: ✭ 593 (+326.62%)
AlgorithmsData Structures & Algorithms. Includes solutions for Cracking the Coding Interview 6th Edition
Stars: ✭ 89 (-35.97%)
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.
Stars: ✭ 65 (-53.24%)
Coding Interview Gymleetcode.com , algoexpert.io solutions in python and swift
Stars: ✭ 451 (+224.46%)
treebitmapFast IP lookup table for IPv4/IPv6 prefixes
Stars: ✭ 81 (-41.73%)
trie-muxA minimal and powerful trie based url path router (or mux) for Go.
Stars: ✭ 25 (-82.01%)
csharp-trieA trie (prefix tree) data structure implementation in C#.
Stars: ✭ 30 (-78.42%)
ThmapConcurrent trie-hash map library
Stars: ✭ 51 (-63.31%)
lexpyPython package for lexicon; Trie and DAWG implementation.
Stars: ✭ 47 (-66.19%)
Sensitive敏感词查找,验证,过滤和替换 🤓 FindAll, Validate, Filter and Replace words.
Stars: ✭ 292 (+110.07%)
trieTrie (a.k.a. prefix tree) C# implementation. Has constant-time string prefix lookup.
Stars: ✭ 84 (-39.57%)
Buckets SwiftSwift Collection Data Structures Library
Stars: ✭ 106 (-23.74%)
trie-perfPerformance shootout of various trie implementations
Stars: ✭ 18 (-87.05%)
MuxieMuxie is a modern, fast and light HTTP multiplexer for Go. Fully compatible with the http.Handler interface. Written for everyone.
Stars: ✭ 257 (+84.89%)
xcdatFast compressed trie dictionary library
Stars: ✭ 51 (-63.31%)
Libgenericslibgenerics is a minimalistic and generic library for C basic data structures.
Stars: ✭ 42 (-69.78%)
trie-prefix-treeCreate and modify trie prefix structures and extract word lists including prefixes, anagrams and sub-anagrams
Stars: ✭ 42 (-69.78%)
SlimSurprisingly space efficient trie in Golang(11 bits/key; 100 ns/get).
Stars: ✭ 1,705 (+1126.62%)
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.
Stars: ✭ 122 (-12.23%)
CompletelyJava autocomplete library.
Stars: ✭ 90 (-35.25%)
TrieA Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.
Stars: ✭ 25 (-82.01%)
poplar-trieC++17 implementation of memory-efficient dynamic tries
Stars: ✭ 47 (-66.19%)