simple trie implementation based on JS proxies
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
Library to implement tries in javascript and typescript
Performs fast search and replace on a text based on a set of rules.
This project implements ElasticSearch features using the Trie data structure, providing efficient and fast searching capabilities on large datasets. The Trie data structure is leveraged for optimal search performance, and the project is built with React.j
A simple trie index implementation that includes case sensitivity
A JavaScript implementation of a Trie
A JavaScript port of Data.Trie
This is a trie module.
An in-memory node.js autocomplete package based on the trie data structure, based off the autocomplete module
ES Map/Set-compatible implementations with customizable equality semantics & supporting operations
A TS implementation of the [Trie](https://en.wikipedia.org/wiki/Trie) data structure, including fuzzy (approximate) string matching.
Composable trie based router
The purpose of this project is to create a JS library for prefix trees (aka tries).
A JavaScript package for implementing the Trie data structure, including essential methods for efficient data retrieval.
production-ready data structures implementation in javascript & typescript.
Like Lego For Databases
A fast weighted auto-completion trie.
TypeScript implementation of the Aho-Corasick algorithm for efficient string matching
This is an implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper, adapted for Polkadot
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
My take on an efficient implementation of a Trie in Javascript
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
Verkle Trie Crytography WASM/TypeScript Bindings
Trie implementation for node and js projects
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
This is an implementation of the codec for Substrate Trie
>> Easiest package to build and manipulate prefix trie structures