Results for com.github.romix:java-concurrent-hash-trie-map

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.

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

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.

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.

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

Trie Data Structure to support cspell.

Useful TypeScript utilities.

Lightning fast hash functions for browsers and Node.js using hand-tuned WebAssembly binaries (MD4, MD5, SHA-1, SHA-2, SHA-3, Keccak, BLAKE2, BLAKE3, PBKDF2, Argon2, bcrypt, scrypt, Adler-32, CRC32, CRC32C, RIPEMD-160, HMAC, xxHash, SM3, Whirlpool)

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

Radix Trie in Javascript

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.

Bigmap for Keyv

Crazy fast http radix based router

Source code handling classes for webpack

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

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

Generate hashes from javascript objects in node and the browser.

Map over promises serially

Stable JS value hash.

Easy exclusive or shared access to resource