A trie dictionary storage model
https://en.wikipedia.org/wiki/Trie
Trie Data Structure to support cspell.
Unicode Trie data structure for fast character metadata lookup, ported from ICU
Unicode Trie
Radix trie module.
A tiny trie implementation
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
TypeScript definitions for unicode-trie
trie implementation in javascript
Radix Trie in Javascript
A trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.
Minimalistic trie implementation for prefix searches
Trie and radix tree implementation tailored towards exact matches.
JavaScript implementation of Double-Array trie
TypeScript definitions for autosuggest-trie
Strongly typed trie data structure for path and URL-like strings.
A memoization algorithm in which each function argument represents a new key, creating a trie of caches as defined by the array in your first argument.
Check permissions using Shiro-like strings, put in a trie.
Minimalistic trie implementation for autosuggest and autocomplete components.
Trie, prefix tree
The extremely fast compressed trie implementation.
A simple trie structure to perform prefix search on texts in O(n) time, where n - number of characters in searched word. > Trie is a basic Tree structure, also known as [prefix tree](https://en.wikipedia.org/wiki/Trie) Super simple, Super fast, super comp
Trie Data Structure reader for cspell
A highly general and customizable trie library
Fast implementation of a trie data structure
An idiomatic and fast QP-trie implementation in pure Rust, written with an emphasis on safety.
A generalized trie implementation for quick prefix searching.
Safe Rust wrapper for the marisa-trie C++ library
Memory-efficient trie data structures based on radix tree
Memory efficient trie (prefix tree) and map library based on LOUDS
A compact radix trie for command-line tab completion and longest-prefix matching.
Fast, memory-efficient Trie (prefix tree) implementation with autocomplete support - Rust implementation
A space-efficient router / radix-trie that supports wildcards.
A simple Trie implementation in Rust
Pure Rust port of marisa-trie: a static and space-efficient trie data structure
Ruby Trie based on libdatrie.
Implemention of a trie data structure
Optimized Regexp builder with Trie as a port of Perl's Regexp::Trie
The Rambling Trie is a Ruby implementation of the trie data structure, which includes compression abilities and is designed to be very fast to traverse.
Fast prefix matching using a trie-like structure
A simple trie storage gem
Ruby Trie based on libdatrie.
Memory-efficient cached trie and trie storage.
Implemention of a trie data structure
Trie-like, prefix-tree data structures. First, a prefix-tree based on Arrays, which differs from a traditional trie, which maps strings to values. Second, a more general prefix-tree data structure that works for any type of keys, provided those keys can be transformed to and from an array. Both of these data structures are implemented in terms of hashes.
distributed-trie is a trie library on key-value store.
a simple program for suggest or spellcheck keyword use trie tree
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.