https://en.wikipedia.org/wiki/Trie
Unicode Trie data structure for fast character metadata lookup, ported from ICU
Trie Data Structure to support cspell.
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
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
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
A Typescript implementation of the v1 and v2 DIF Presentation Exchange specification
Presentation Exchange v1 and v2 typescript models
A Typescript implementation of the v1 and v2 DIF Presentation Exchange specification
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.
Extension for Peer Discovery (PEX)
check rules for signavio-i18n
Radix trie module.
Provides fast access to unicode character properties
TypeScript definitions for unicode-trie
Check permissions using Shiro-like strings, put in a trie.
A node.js-style module system for GLSL!
Radix Trie in Javascript