Trie

https://en.wikipedia.org/wiki/Trie

Unicode Trie data structure for fast character metadata lookup, ported from ICU

Curated collection of data structures for the JavaScript/TypeScript.

Unicode Trie

This is an implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.

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

Trie Data Structure to support cspell.

This is an implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.

A tiny trie implementation

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.

compressed-trie data-structure

A simple trie structure to perform search on texts in O(n) time, where n - number of characters in searched word.

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.

Generate regular expressions that match a set of strings

Minimalistic trie implementation for prefix searches

Trie and radix tree implementation tailored towards exact matches.

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

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.

Alternative Map and Set implementations with customizable equality semantics & supporting operations

TypeScript definitions for unicode-trie

TypeScript implementation of the Aho-Corasick algorithm for efficient string matching

Composable trie based router

An efficient immutable ordered sequence of elements akin to a Vector

Like Lego For Databases

A Trie-based router

An in-memory autocomplete package based on the trie data structure

Trie Data Structure reader for cspell

Trie-based URL Routing

trie implementation in javascript

Proving things in the Ethereum Patricia Trie (tree)

Minimalistic trie implementation for autosuggest and autocomplete components.

Radix Trie in Javascript

A minimal and powerful trie based url path router for Node.js.

A fast weighted autocompleter

Trie-routing for Koa

Apache Shiro permission style using Trie data structure

production-ready data structures implementation in javascript & typescript.

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

Compute the Longest Common Prefix from some strings

A trie data structure for arrays

A module for performing a dictionary search

Fast prefix operations for strings of digits

JS Trie / DAWG classes

An in-memory node.js autocomplete package based on the trie data structure, based off the autocomplete module

TypeScript definitions for trie-prefix-tree

Trie

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

Hash Array Mapped Trie