Trie Packages

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.

Trie Data Structure to support cspell.

Generate regular expressions that match a set of strings

Check permissions using Shiro-like strings, put in a trie.

JavaScript implementation of Double-Array trie

A trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.

Alternative Map and Set implementations with customizable equality semantics & supporting operations, plain object utilities

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.

Composable trie based router

Trie and radix tree implementation tailored towards exact matches.

Minimalistic trie implementation for prefix searches

Like Lego For Databases

Fork of HAMT that adds transient mutation and support for custom key types

Trie Data Structure reader for cspell

Minimal trie datastructure representation

Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams

Trie-based URL Routing

Create a regular expression to match any of the phrases added to the trie (inspired by Dan Kogai's Regexp::Trie Perl module.)

Customizable trie data structure built in JavaScript.