simple trie implementation based on JS proxies
https://en.wikipedia.org/wiki/Trie
Unicode Trie data structure for fast character metadata lookup, ported from ICU
Trie Data Structure to support cspell.
neato compression of key-value data
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
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.
Check if a value is an object
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
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.
Crazy fast http radix based router
Check if a value is a plain object
utilities for primitive JavaScript types
Strongly typed trie data structure for path and URL-like strings.
Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
Safely get a dot-notated property within an object.
Utility functions to deal with references in objects
Simple JSON Addressing.
an identity object using ES6 proxies
Easily read/write JSON files.
string representations of objects in node and the browser
No description provided.
No description provided.