All Projects → csharp-trie → Similar Projects or Alternatives

66 Open source projects that are alternatives of or similar to csharp-trie

trie
Trie (a.k.a. prefix tree) C# implementation. Has constant-time string prefix lookup.
Stars: ✭ 84 (+180%)
Mutual labels:  trie, prefix-tree
trie-perf
Performance shootout of various trie implementations
Stars: ✭ 18 (-40%)
Mutual labels:  trie, prefix-tree
prefixtree
A prefix tree (trie) implementation in go
Stars: ✭ 21 (-30%)
Mutual labels:  trie, prefix-tree
Coding Interview Gym
leetcode.com , algoexpert.io solutions in python and swift
Stars: ✭ 451 (+1403.33%)
Mutual labels:  trie
Nano Sql
Universal database layer for the client, server & mobile devices. It's like Lego for databases.
Stars: ✭ 717 (+2290%)
Mutual labels:  trie
Java Ds Algorithms
Data Structures and Algorithms in Java
Stars: ✭ 125 (+316.67%)
Mutual labels:  trie
Opencc4j
🇨🇳Open Chinese Convert is an opensource project for conversion between Traditional Chinese and Simplified Chinese.(java 中文繁简体转换)
Stars: ✭ 187 (+523.33%)
Mutual labels:  trie
Sensitive
敏感词查找,验证,过滤和替换 🤓 FindAll, Validate, Filter and Replace words.
Stars: ✭ 292 (+873.33%)
Mutual labels:  trie
Buckets Swift
Swift Collection Data Structures Library
Stars: ✭ 106 (+253.33%)
Mutual labels:  trie
trie-prefix-tree
Create and modify trie prefix structures and extract word lists including prefixes, anagrams and sub-anagrams
Stars: ✭ 42 (+40%)
Mutual labels:  trie
lucilla
Fast, efficient, in-memory Full Text Search for Kotlin
Stars: ✭ 102 (+240%)
Mutual labels:  trie
Autosuggest Trie
Minimalistic trie implementation for autosuggest and autocomplete components
Stars: ✭ 22 (-26.67%)
Mutual labels:  trie
Trie4j
PATRICIA, Double Array, LOUDS Trie implementations for Java
Stars: ✭ 139 (+363.33%)
Mutual labels:  trie
Pyahocorasick
Python module (C extension and plain python) implementing Aho-Corasick algorithm
Stars: ✭ 593 (+1876.67%)
Mutual labels:  trie
Data Structures
A collection of powerful data structures
Stars: ✭ 2,534 (+8346.67%)
Mutual labels:  trie
Data Structures
Go datastructures.
Stars: ✭ 336 (+1020%)
Mutual labels:  trie
Gse
Go efficient multilingual NLP and text segmentation; support english, chinese, japanese and other. Go 高性能多语言 NLP 和分词
Stars: ✭ 1,695 (+5550%)
Mutual labels:  trie
Muxie
Muxie is a modern, fast and light HTTP multiplexer for Go. Fully compatible with the http.Handler interface. Written for everyone.
Stars: ✭ 257 (+756.67%)
Mutual labels:  trie
trie
My take on an efficient implementation of a Trie in Javascript
Stars: ✭ 72 (+140%)
Mutual labels:  trie
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.
Stars: ✭ 144 (+380%)
Mutual labels:  trie
Tongrams
A C++ library providing fast language model queries in compressed space.
Stars: ✭ 88 (+193.33%)
Mutual labels:  trie
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.
Stars: ✭ 166 (+453.33%)
Mutual labels:  trie
retrie
Efficient Trie-based regex unions for blacklist/whitelist filtering and one-pass mapping-based string replacing
Stars: ✭ 35 (+16.67%)
Mutual labels:  trie
Adaptive Radix Tree
A fast and space efficient Radix tree in Java
Stars: ✭ 76 (+153.33%)
Mutual labels:  trie
AlgoDaily
just for fun
Stars: ✭ 118 (+293.33%)
Mutual labels:  trie
Data-Structures
Algorithmic Problems Solutions -- hash table code featured in geeksforgeeks
Stars: ✭ 44 (+46.67%)
Mutual labels:  trie
Trie
A Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.
Stars: ✭ 25 (-16.67%)
Mutual labels:  trie
Algorithms
A collection of common algorithms and data structures implemented in java, c++, and python.
Stars: ✭ 142 (+373.33%)
Mutual labels:  trie
Kua
⚡️ Lightning fast URL routing in Python (trie router)
Stars: ✭ 18 (-40%)
Mutual labels:  trie
xcdat
Fast compressed trie dictionary library
Stars: ✭ 51 (+70%)
Mutual labels:  trie
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 (+2080%)
Mutual labels:  trie
Slim
Surprisingly space efficient trie in Golang(11 bits/key; 100 ns/get).
Stars: ✭ 1,705 (+5583.33%)
Mutual labels:  trie
Hat Trie
C++ implementation of a fast and memory efficient HAT-trie
Stars: ✭ 565 (+1783.33%)
Mutual labels:  trie
Thmap
Concurrent trie-hash map library
Stars: ✭ 51 (+70%)
Mutual labels:  trie
Algorithms
Data Structures & Algorithms. Includes solutions for Cracking the Coding Interview 6th Edition
Stars: ✭ 89 (+196.67%)
Mutual labels:  trie
Capsule
The Capsule Hash Trie Collections Library
Stars: ✭ 350 (+1066.67%)
Mutual labels:  trie
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 (+306.67%)
Mutual labels:  trie
Baekjoon
코딩테스트 대비 문제집(Baekjoon Online Judge)
Stars: ✭ 295 (+883.33%)
Mutual labels:  trie
Patricia
Garbage collector-sensitive patricia tree for IP/CIDR tagging
Stars: ✭ 194 (+546.67%)
Mutual labels:  trie
Merkle Patricia Tree
Project is in active development and has been moved to the EthereumJS VM monorepo.
Stars: ✭ 277 (+823.33%)
Mutual labels:  trie
Data Structures
Data-Structures using C++.
Stars: ✭ 121 (+303.33%)
Mutual labels:  trie
DawgSharp
DAWG String Dictionary in C#
Stars: ✭ 72 (+140%)
Mutual labels:  trie
lexpy
Python package for lexicon; Trie and DAWG implementation.
Stars: ✭ 47 (+56.67%)
Mutual labels:  trie
poplar-trie
C++17 implementation of memory-efficient dynamic tries
Stars: ✭ 47 (+56.67%)
Mutual labels:  trie
Completely
Java autocomplete library.
Stars: ✭ 90 (+200%)
Mutual labels:  trie
fixie-trie
Compact tries for fixed-width keys
Stars: ✭ 23 (-23.33%)
Mutual labels:  trie
Leetcode
High-quality LeetCode solutions
Stars: ✭ 178 (+493.33%)
Mutual labels:  trie
aho-corasick-node
A Node implementation of the Aho-Corasick string matching algorithm based on DoubleArray Trie.
Stars: ✭ 16 (-46.67%)
Mutual labels:  trie
Flash
Golang Keyword extraction/replacement Datastructure using Tries instead of regexes
Stars: ✭ 79 (+163.33%)
Mutual labels:  trie
radix
Golang radix tree implementation
Stars: ✭ 30 (+0%)
Mutual labels:  trie
triebeard
Radix trees in Rcpp and R
Stars: ✭ 29 (-3.33%)
Mutual labels:  trie
Efrt
neato compression for key-value data
Stars: ✭ 58 (+93.33%)
Mutual labels:  trie
DEPRECATED-data-structures
A collection of powerful data structures
Stars: ✭ 2,648 (+8726.67%)
Mutual labels:  trie
Router
⚡️ A lightning fast HTTP router
Stars: ✭ 158 (+426.67%)
Mutual labels:  trie
Qp Trie Rs
An idiomatic and fast QP-trie implementation in pure Rust.
Stars: ✭ 47 (+56.67%)
Mutual labels:  trie
Algorithms-Java
A collection of common algorithms and data structures implemented in Java.
Stars: ✭ 141 (+370%)
Mutual labels:  trie
rust sequence trie
Ergonomic trie data structure
Stars: ✭ 22 (-26.67%)
Mutual labels:  trie
goblin
A golang http router based on trie tree.
Stars: ✭ 52 (+73.33%)
Mutual labels:  trie
Opends
Template Library of Data Structures in C++17
Stars: ✭ 151 (+403.33%)
Mutual labels:  trie
Libgenerics
libgenerics is a minimalistic and generic library for C basic data structures.
Stars: ✭ 42 (+40%)
Mutual labels:  trie
1-60 of 66 similar projects