Results for set-trie

Curated collection of data structures for the JavaScript/TypeScript.

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

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

Fast and tiny fuzzy-search utility

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

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

Trie Data Structure to support cspell.

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.

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.

Crazy fast http radix based router

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

Trie and radix tree implementation tailored towards exact matches.

Radix trie module.

Provides fast access to unicode character properties

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

TypeScript definitions for unicode-trie

Lightweight Path Trie for TypeScript and JavaScript

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

A collection of useful data structures. Array, linked list, stack, queue, deque, hash map, hash set, tree, heap, binary search tree, graph, bloom filter, disjoint set, trie, and LRU cache.

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