This is an implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
Generic data structures: sequences, associative collections, trees, graphs, indexes and probabilistic sketches.
Framework-agnostic PivotGrid engine with Web Worker, columnar storage, trie-based grouping, and headless controller
Readonly but memory-sufficient data structure for dictionaries
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
This is a trie module.
Implementation of verkle trees as used in Ethereum.
Comprehensive TypeScript SDK for detecting disposable email addresses with real-time synchronization, advanced DNS validation (MX, SPF, DMARC), intelligent caching, and high-performance email validation. Features 119K+ domains from 15+ sources with automa
A fast weighted auto-completion trie.
This is an implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper, adapted for Polkadot
Create a regular expression to match any of the phrases added to the trie (inspired by Dan Kogai's Regexp::Trie Perl module.)
Hash Array Mapped Trie
Standard and compressed (radix) tries for TypeScript, behind one interface: sets and maps of strings with prefix search.
Algorithms and data structures for your JavaScript and TypeScript projects 🧑💻
Usefull functions for solving programming tasks
Aho–Corasick string matching algorithm
Trie cloud context bridge for Cursor and Claude Code.
Customizable trie data structure built in JavaScript.
51degrees hash (aka trie) data for nodejs
Pure string:val storage, using structural sharing
Create and search a dictionary of words using a trie data structure
A fast weighted autocompleter
Type-safe client-side router: routes are declared as a flat registry of parent-linked definitions, compiled and validated up front, then matched by a segment trie with per-route param typing for buildUrl and match.
This is an implementation of the codec for Substrate Trie
Fast Trie for React Native
The TRIE data structure and search algorithm, on top of leveldb.
HTTP маршрутизатор для Node.js на основе префиксного дерева
A small, zero-dependency HTTP router for Node.js, built directly on `node:http`. Radix-trie routing, plain `(req, res)` handlers and no `next()`.
radix-trie implementation for Inverse Index Document Search.
A comprehensive collection of generic data structure implementations for TypeScript/JavaScript, published on npm.
Radix tree like router middleware for koa
## Usage