Search results
298 packages found
A lightweight trie implementation.
Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.
Minimalistic trie implementation for prefix searches
A ternary search tree for Node.js
Observable Path Trie Store
- observable
- reactive
- rxjs
- trie
- tree
- store
- state
- observable tree
- observable state
- observable store
- reactive tree
- reactive state
- reactive store
Implementation of verkle trees as used in Ethereum.
Hachiko aims to be the easiest, fastest and most practical of all data structure libraries for FP in JS
Search Really Really Fast
Quick fork of unicode-trie for modernity
This package provides a powerful Radix data storage and retrieval library for TypeScript. It allows you to efficiently store and manage structured data using a Radix tree data structure.
A trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.
>> Easiest package to build and manipulate prefix trie structures
simple trie implementation based on JS proxies
Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
Unicode line-breaking algorithm from UAX #14