Search results
294 packages found
Implementation of verkle trees as used in Ethereum.
Simple, modifiable item-title search index based on radix tries.
A trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.
A lightweight trie implementation.
Minimalistic trie implementation for prefix searches
Observable Path Trie Store
- observable
- reactive
- rxjs
- trie
- tree
- store
- state
- observable tree
- observable state
- observable store
- reactive tree
- reactive state
- reactive store
Hachiko aims to be the easiest, fastest and most practical of all data structure libraries for FP in JS
Search Really Really Fast
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.
Quick fork of unicode-trie for modernity
simple trie implementation based on JS proxies
>> Easiest package to build and manipulate prefix trie structures
word-break util using trie-search dictionary