Showing 1-20 of 55,635 packages
A trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.
autocomplete-trie-search is an NPM package that provides fast and efficient autocomplete suggestions for text input fields using the trie data structure. With autocomplete-trie-search, you can easily integrate autocomplete functionality into your web or m
Unicode Trie data structure for fast character metadata lookup, ported from ICU
Fast and tiny fuzzy-search utility
https://en.wikipedia.org/wiki/Trie
A trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.
Provides a trie-search and hash array data structures w/ Svelte support.
Trie Data Structure to support cspell.
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
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
A trie search algorithm in Typscript.
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.
Minimalistic trie implementation for prefix searches
JavaScript implementation of Double-Array trie
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.
Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
Strongly typed trie data structure for path and URL-like strings.
Trie and radix tree implementation tailored towards exact matches.