Minimalistic trie implementation for prefix searches
Fast and tiny fuzzy-search utility
https://en.wikipedia.org/wiki/Trie
Unicode Trie data structure for fast character metadata lookup, ported from ICU
Trie Data Structure to support cspell.
Count the longest repeating streak of a substring
Curated collection of data structures for the JavaScript/TypeScript.
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
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.
Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
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
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.
Trim a consecutively repeated substring: foo--bar---baz → foo-bar-baz
Unicode-aware substring
Count how often a character (or substring) is used in a string
TypeScript definitions for unicode-trie
Check permissions using Shiro-like strings, put in a trie.
Strip a substring from the start/end of a string
Radix trie module.
Provides fast access to unicode character properties
trie implementation in javascript
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.