Super simple prefix-trie implementation for fast autocomplete.
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
Prefix Trie Implementation
>> Easiest package to build and manipulate prefix trie structures
typescript implementation of the prefix trie data structure
A simple npm package that allows you to build and manipulate a prefix trie
A serializable compact prefix trie
Prefix trie for autocomplete
prefix trie auto complete
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
prefix trie
Prefix trie
JS library of prefix Trie class
Crazy fast http radix based router
Prefix Trie for Autocomplete
Strongly typed trie data structure for path and URL-like strings.
https://en.wikipedia.org/wiki/Trie
Unicode Trie data structure for fast character metadata lookup, ported from ICU
Trie Data Structure to support cspell.
js library of prefix trie
Curated collection of data structures for the JavaScript/TypeScript.
This is an implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
A trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.
Fast and tiny fuzzy-search utility
Prefix trie (tree) datastructure (both a set and a map) that provides exact and longest-prefix matches.
Prefix-trie HTTP request router with path parameter capture
Cognitora shared library: config, errors, hashing, prefix-trie
A compressed radix trie implementation supporting matching rules
Refreshingly simple zero copy primitives by Müsli.
IPv4 and IPv6 network fast lookup trie.
A network control-plane simulator
Sans-I/O ZMTP codec, message types, and routing logic. Backend-agnostic core for omq-tokio / omq-compio.
fast, efficient, unicode aware HAT trie with prefix / suffix support.
fast, efficient, unicode aware HAT trie with prefix / suffix support.
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
this is prefix trie
Gem for storing strings in prefix tree (Trie)
A simple prefix trie gem
A simple prefix trie gem
A simple prefix trie gem
Fast Unicode character lookups by name, alias, or emoji. Features Trie-based searches, fuzzy matching, prefix search, and comprehensive CLI tools.
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.