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.

Generate regular expressions that match a set of strings

JavaScript implementation of Double-Array trie

A tiny trie implementation

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.

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

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

Trie and radix tree implementation tailored towards exact matches.

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

Minimalistic trie implementation for prefix searches

TypeScript definitions for unicode-trie

Composable trie based router

trie implementation in javascript

production-ready data structures implementation in javascript & typescript.

Trie Data Structure reader for cspell

Minimal trie datastructure representation

Like Lego For Databases

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

An efficient immutable ordered sequence of elements akin to a Vector

Trie-based URL Routing

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

A Trie-based router

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

Compute the Longest Common Prefix from some strings

Minimalistic trie implementation for autosuggest and autocomplete components.

A fast weighted autocompleter

John Resig's trie implementation, prettified and packaged for npm

Collection of Data Structure implementations written in JavaScript

A trie data structure for arrays

Radix Trie in Javascript

Data structure and graph processing library written in modern JavaScript

Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.

A fast weighted auto-completion trie.

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

Fast prefix operations for strings of digits

Trie-routing for Koa

A compact trie for mapping keys to values

Proving things in the Ethereum Patricia Trie (tree)

The derived algorithm from Radix trie with up-and-down relationship.