reed-solomon-erasure[Looking for new owners/maintainers, see #88] Rust implementation of Reed-Solomon erasure coding
Stars: ✭ 135 (+206.82%)
ParParHigh performance PAR2 create client for NodeJS
Stars: ✭ 110 (+150%)
blockyarchiveBlocky archive - multithreaded archiver offering bit rot protection and sector level recoverability
Stars: ✭ 88 (+100%)
TrieA Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.
Stars: ✭ 25 (-43.18%)
Efrtneato compression for key-value data
Stars: ✭ 58 (+31.82%)
LeetcodeHigh-quality LeetCode solutions
Stars: ✭ 178 (+304.55%)
trieMy take on an efficient implementation of a Trie in Javascript
Stars: ✭ 72 (+63.64%)
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 (+1386.36%)
AlgorithmsA collection of common algorithms and data structures implemented in java, c++, and python.
Stars: ✭ 142 (+222.73%)
CapsuleThe Capsule Hash Trie Collections Library
Stars: ✭ 350 (+695.45%)
Merkle Patricia TreeProject is in active development and has been moved to the EthereumJS VM monorepo.
Stars: ✭ 277 (+529.55%)
FlashGolang Keyword extraction/replacement Datastructure using Tries instead of regexes
Stars: ✭ 79 (+79.55%)
PatriciaGarbage collector-sensitive patricia tree for IP/CIDR tagging
Stars: ✭ 194 (+340.91%)
Qp Trie RsAn idiomatic and fast QP-trie implementation in pure Rust.
Stars: ✭ 47 (+6.82%)
Libgenericslibgenerics is a minimalistic and generic library for C basic data structures.
Stars: ✭ 42 (-4.55%)
Kua⚡️ Lightning fast URL routing in Python (trie router)
Stars: ✭ 18 (-59.09%)
Router⚡️ A lightning fast HTTP router
Stars: ✭ 158 (+259.09%)
Hat TrieC++ implementation of a fast and memory efficient HAT-trie
Stars: ✭ 565 (+1184.09%)
csharp-trieA trie (prefix tree) data structure implementation in C#.
Stars: ✭ 30 (-31.82%)
Baekjoon코딩테스트 대비 문제집(Baekjoon Online Judge)
Stars: ✭ 295 (+570.45%)
SlimSurprisingly space efficient trie in Golang(11 bits/key; 100 ns/get).
Stars: ✭ 1,705 (+3775%)
trie-perfPerformance shootout of various trie implementations
Stars: ✭ 18 (-59.09%)
DawgSharpDAWG String Dictionary in C#
Stars: ✭ 72 (+63.64%)
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 (+177.27%)
poplar-trieC++17 implementation of memory-efficient dynamic tries
Stars: ✭ 47 (+6.82%)
fixie-trieCompact tries for fixed-width keys
Stars: ✭ 23 (-47.73%)
TongramsA C++ library providing fast language model queries in compressed space.
Stars: ✭ 88 (+100%)
Data StructuresA collection of powerful data structures
Stars: ✭ 2,534 (+5659.09%)
ThmapConcurrent trie-hash map library
Stars: ✭ 51 (+15.91%)
Opencc4j🇨🇳Open Chinese Convert is an opensource project for conversion between Traditional Chinese and Simplified Chinese.(java 中文繁简体转换)
Stars: ✭ 187 (+325%)
unitdbFast specialized time-series database for IoT, real-time internet connected devices and AI analytics.
Stars: ✭ 97 (+120.45%)
aho-corasick-nodeA Node implementation of the Aho-Corasick string matching algorithm based on DoubleArray Trie.
Stars: ✭ 16 (-63.64%)
Autosuggest TrieMinimalistic trie implementation for autosuggest and autocomplete components
Stars: ✭ 22 (-50%)
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.
Stars: ✭ 166 (+277.27%)
Nano SqlUniversal database layer for the client, server & mobile devices. It's like Lego for databases.
Stars: ✭ 717 (+1529.55%)
trieTrie (a.k.a. prefix tree) C# implementation. Has constant-time string prefix lookup.
Stars: ✭ 84 (+90.91%)
PyahocorasickPython module (C extension and plain python) implementing Aho-Corasick algorithm
Stars: ✭ 593 (+1247.73%)
OpendsTemplate Library of Data Structures in C++17
Stars: ✭ 151 (+243.18%)
Trie4jPATRICIA, Double Array, LOUDS Trie implementations for Java
Stars: ✭ 139 (+215.91%)
Sensitive敏感词查找,验证,过滤和替换 🤓 FindAll, Validate, Filter and Replace words.
Stars: ✭ 292 (+563.64%)
retrieEfficient Trie-based regex unions for blacklist/whitelist filtering and one-pass mapping-based string replacing
Stars: ✭ 35 (-20.45%)
MuxieMuxie is a modern, fast and light HTTP multiplexer for Go. Fully compatible with the http.Handler interface. Written for everyone.
Stars: ✭ 257 (+484.09%)
trie-prefix-treeCreate and modify trie prefix structures and extract word lists including prefixes, anagrams and sub-anagrams
Stars: ✭ 42 (-4.55%)
Algorithms-JavaA collection of common algorithms and data structures implemented in Java.
Stars: ✭ 141 (+220.45%)
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 (+227.27%)
GseGo efficient multilingual NLP and text segmentation; support english, chinese, japanese and other. Go 高性能多语言 NLP 和分词
Stars: ✭ 1,695 (+3752.27%)
lucillaFast, efficient, in-memory Full Text Search for Kotlin
Stars: ✭ 102 (+131.82%)
goblinA golang http router based on trie tree.
Stars: ✭ 52 (+18.18%)
Buckets SwiftSwift Collection Data Structures Library
Stars: ✭ 106 (+140.91%)
galoisA performant NumPy extension for Galois fields and their applications
Stars: ✭ 106 (+140.91%)
trie-muxA minimal and powerful trie based url path router (or mux) for Go.
Stars: ✭ 25 (-43.18%)
lexpyPython package for lexicon; Trie and DAWG implementation.
Stars: ✭ 47 (+6.82%)
xcdatFast compressed trie dictionary library
Stars: ✭ 51 (+15.91%)
CompletelyJava autocomplete library.
Stars: ✭ 90 (+104.55%)