Search results
299 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
Implementation of verkle trees as used in Ethereum.
High-performance JIT router for Node.js
Hachiko aims to be the easiest, fastest and most practical of all data structure libraries for FP in JS
A trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.
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
Unicode line-breaking algorithm from UAX #14