Results for trie-d

Minimal trie datastructure representation

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

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

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

Trie Data Structure to support cspell.

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.

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.

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

Fast and tiny fuzzy-search utility

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

Crazy fast http radix based router

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.

JavaScript implementation of Double-Array trie

Trie and radix tree implementation tailored towards exact matches.

Minimalistic trie implementation for autosuggest and autocomplete components.

Radix trie module.

Provides fast access to unicode character properties

TypeScript definitions for unicode-trie

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

Radix Trie in Javascript

A simple trie structure to perform prefix search on texts in O(n) time, where n - number of characters in searched word. > Trie is a basic Tree structure, also known as [prefix tree](https://en.wikipedia.org/wiki/Trie) Super simple, Super fast, super comp

trie implementation in javascript