trieTrie (a.k.a. prefix tree) C# implementation. Has constant-time string prefix lookup.
Stars: ✭ 84 (+366.67%)
csharp-trieA trie (prefix tree) data structure implementation in C#.
Stars: ✭ 30 (+66.67%)
prefixtreeA prefix tree (trie) implementation in go
Stars: ✭ 21 (+16.67%)
Coding Interview Gymleetcode.com , algoexpert.io solutions in python and swift
Stars: ✭ 451 (+2405.56%)
Nano SqlUniversal database layer for the client, server & mobile devices. It's like Lego for databases.
Stars: ✭ 717 (+3883.33%)
Opencc4j🇨🇳Open Chinese Convert is an opensource project for conversion between Traditional Chinese and Simplified Chinese.(java 中文繁简体转换)
Stars: ✭ 187 (+938.89%)
Sensitive敏感词查找,验证,过滤和替换 🤓 FindAll, Validate, Filter and Replace words.
Stars: ✭ 292 (+1522.22%)
Buckets SwiftSwift Collection Data Structures Library
Stars: ✭ 106 (+488.89%)
trie-prefix-treeCreate and modify trie prefix structures and extract word lists including prefixes, anagrams and sub-anagrams
Stars: ✭ 42 (+133.33%)
lucillaFast, efficient, in-memory Full Text Search for Kotlin
Stars: ✭ 102 (+466.67%)
Autosuggest TrieMinimalistic trie implementation for autosuggest and autocomplete components
Stars: ✭ 22 (+22.22%)
Trie4jPATRICIA, Double Array, LOUDS Trie implementations for Java
Stars: ✭ 139 (+672.22%)
PyahocorasickPython module (C extension and plain python) implementing Aho-Corasick algorithm
Stars: ✭ 593 (+3194.44%)
Data StructuresA collection of powerful data structures
Stars: ✭ 2,534 (+13977.78%)
GseGo efficient multilingual NLP and text segmentation; support english, chinese, japanese and other. Go 高性能多语言 NLP 和分词
Stars: ✭ 1,695 (+9316.67%)
MuxieMuxie is a modern, fast and light HTTP multiplexer for Go. Fully compatible with the http.Handler interface. Written for everyone.
Stars: ✭ 257 (+1327.78%)
go-ml-benchmarks⏱ Benchmarks of machine learning inference for Go
Stars: ✭ 27 (+50%)
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 (+700%)
TongramsA C++ library providing fast language model queries in compressed space.
Stars: ✭ 88 (+388.89%)
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 (+822.22%)
retrieEfficient Trie-based regex unions for blacklist/whitelist filtering and one-pass mapping-based string replacing
Stars: ✭ 35 (+94.44%)
AlgoDailyjust for fun
Stars: ✭ 118 (+555.56%)
Data-StructuresAlgorithmic Problems Solutions -- hash table code featured in geeksforgeeks
Stars: ✭ 44 (+144.44%)
TrieA Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.
Stars: ✭ 25 (+38.89%)
AlgorithmsA collection of common algorithms and data structures implemented in java, c++, and python.
Stars: ✭ 142 (+688.89%)
Kua⚡️ Lightning fast URL routing in Python (trie router)
Stars: ✭ 18 (+0%)
server-benchmarks🚀 Cross-platform transparent benchmarks for HTTP/2 Web Servers at 2020-2023
Stars: ✭ 78 (+333.33%)
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 (+3533.33%)
SlimSurprisingly space efficient trie in Golang(11 bits/key; 100 ns/get).
Stars: ✭ 1,705 (+9372.22%)
Hat TrieC++ implementation of a fast and memory efficient HAT-trie
Stars: ✭ 565 (+3038.89%)
xcdatFast compressed trie dictionary library
Stars: ✭ 51 (+183.33%)
CapsuleThe Capsule Hash Trie Collections Library
Stars: ✭ 350 (+1844.44%)
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 (+577.78%)
Baekjoon코딩테스트 대비 문제집(Baekjoon Online Judge)
Stars: ✭ 295 (+1538.89%)
PatriciaGarbage collector-sensitive patricia tree for IP/CIDR tagging
Stars: ✭ 194 (+977.78%)
Merkle Patricia TreeProject is in active development and has been moved to the EthereumJS VM monorepo.
Stars: ✭ 277 (+1438.89%)
DawgSharpDAWG String Dictionary in C#
Stars: ✭ 72 (+300%)
Static-SortA simple C++ header-only library for fastest sorting of small arrays. Generates sorting networks on compile time via templates.
Stars: ✭ 30 (+66.67%)
poplar-trieC++17 implementation of memory-efficient dynamic tries
Stars: ✭ 47 (+161.11%)
CompletelyJava autocomplete library.
Stars: ✭ 90 (+400%)
fixie-trieCompact tries for fixed-width keys
Stars: ✭ 23 (+27.78%)
LeetcodeHigh-quality LeetCode solutions
Stars: ✭ 178 (+888.89%)
aho-corasick-nodeA Node implementation of the Aho-Corasick string matching algorithm based on DoubleArray Trie.
Stars: ✭ 16 (-11.11%)
FlashGolang Keyword extraction/replacement Datastructure using Tries instead of regexes
Stars: ✭ 79 (+338.89%)
radixGolang radix tree implementation
Stars: ✭ 30 (+66.67%)
anybenchCPU Benchmarks Set
Stars: ✭ 54 (+200%)
triebeardRadix trees in Rcpp and R
Stars: ✭ 29 (+61.11%)
Efrtneato compression for key-value data
Stars: ✭ 58 (+222.22%)
Router⚡️ A lightning fast HTTP router
Stars: ✭ 158 (+777.78%)
ThmapConcurrent trie-hash map library
Stars: ✭ 51 (+183.33%)
AlgorithmsData Structures & Algorithms. Includes solutions for Cracking the Coding Interview 6th Edition
Stars: ✭ 89 (+394.44%)
Qp Trie RsAn idiomatic and fast QP-trie implementation in pure Rust.
Stars: ✭ 47 (+161.11%)
watHow fast are computers?
Stars: ✭ 26 (+44.44%)
goblinA golang http router based on trie tree.
Stars: ✭ 52 (+188.89%)
memo wiseThe wise choice for Ruby memoization
Stars: ✭ 486 (+2600%)