Results for hash-trie

Hash Trie

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

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

This is an 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.

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

Pure string:val storage, using structural sharing

Trie Data Structure to support cspell.

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

Curated collection of data structures for the JavaScript/TypeScript.

Immutable hash maps implemented as hash array papped tries

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.

Crazy fast http radix based router

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

Generate hashes from javascript objects in node and the browser.

json friendly, hash trie based, kv store

Stable JS value hash.

Implementation of JSON Web Signatures

A MurmurHash2 implementation

JWA implementation (supports all JWS algorithms)

abstract base class for hash-streams

An incremental implementation of MurmurHash3