Results for v-trie

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

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.

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

Fast and tiny fuzzy-search utility

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

Curated collection of data structures for the JavaScript/TypeScript.

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.

Crazy fast http radix based router

Strongly typed trie data structure for path and URL-like strings.

Radix trie module.

Radix Trie in Javascript

JavaScript implementation of Double-Array trie

Minimalistic trie implementation for prefix searches

TypeScript definitions for unicode-trie

Provides fast access to unicode character properties

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

An Ethereum statemanager implementation

neato compression of key-value data

trie implementation in javascript

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