A JavaScript implementation of a Trie
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
https://en.wikipedia.org/wiki/Trie
Unicode Trie data structure for fast character metadata lookup, ported from ICU
A trie structure for efficient word and phrase search
Fast Trie structure implementation with matching feature
Just a simple Trie structure built for javascript.
This is an implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
A trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.
Strongly typed trie data structure for path and URL-like strings.
Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
An abstract in-memory trie structure
A trie structure
Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
A simple Trie structure with wildcard support to match streams
Trie Data Structure to support cspell.
Curated collection of data structures for the JavaScript/TypeScript.
Turn a file glob into a trie structure
Fast and tiny fuzzy-search utility
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.
Crazy fast http radix based router
Dictionary storage in trie structure to allow fast search and efficient memory use
Production-ready TypeScript data structures: Heap, Deque, Trie, Graph, Red-Black Tree, TreeMap, TreeSet, and more. Zero dependencies, type-safe, with getRank/getByRank/rangeByRank support.
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.
Implemention of a trie data structure
Implemention of a trie data structure
Implemention of a trie data structure
Text::Ux - More Succinct Trie Data structure (binding for ux-trie)
The Rambling Trie Opal is an opal compatible version of rambling-trie gem.
Ruby 1.8/1.9 binding of Tx, a library for a compact 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.
Fast prefix matching using a trie-like structure
Fork of old Tx gem, a library for a compact trie data structure, compatible with Ruby 2.2/2.3.
Ruby binding for marisa-trie which is a static and space-efficient trie data structure.
A trie is an efficient string storage and search structure
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.