Results for array-trie

A trie data structure for arrays

JavaScript implementation of Double-Array trie

A double array trie implementation

TypeScript implementation of Double-Array trie

Node.js Native Addon for Darts (Double-ARray Trie System)

Curated collection of data structures for the JavaScript/TypeScript.

A double array trie implementation

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

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

Fast and tiny fuzzy-search utility

Double Array Trie written in Typescript

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

Trie Data Structure to support cspell.

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.

Crazy fast http radix based router

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.

Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.

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.

Trie and radix tree implementation tailored towards exact matches.

TypeScript definitions for autosuggest-trie

Radix Trie in Javascript

Immutable hash maps implemented as hash array papped tries