ES Map/Set-compatible implementations with customizable equality semantics & supporting operations
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
production-ready data structures implementation in javascript & typescript.
Trie-based ES6-like Map data structures with prefix search/query support
A trie data structure for arrays
Composable trie based router
TypeScript library providing a trie (prefix tree) datastructure.
A node module with a simple trie data structure, support for insert and search functions
A Command Line Interface made with Node which can interact with a Trie hosted globally live on a Google Cloud server
Like Lego For Databases
John Resig's trie implementation, prettified and packaged for npm
Fast Trie structure implementation with matching feature
An in-memory node.js autocomplete package based on the trie data structure, based off the autocomplete module
Just a simple Trie structure built for javascript.
simple trie implementation based on JS proxies
Trie implemented dictionary
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
The purpose of this project is to create a JS library for prefix trees (aka tries).
Yet another user agent parser
Trie-based autocomplete/search library for Node.js, Angular, and React
An efficient immutable ordered sequence of elements akin to a Vector
A simple trie index implementation that includes case sensitivity
A TS implementation of the [Trie](https://en.wikipedia.org/wiki/Trie) data structure, including fuzzy (approximate) string matching.
A JavaScript implementation of a Trie
My take on an efficient implementation of a Trie in Javascript
Compact Public Suffix List (PSL) as a native TypeScript package: embedded ~108KB binary trie, synchronous zero-dependency lookups, ESM + CommonJS. Checked daily against publicsuffix.org.
TypeScript implementation of the Aho-Corasick algorithm for efficient string matching
Zero-dependency TypeScript Trie (prefix tree): insert, search, delete, autocomplete, prefix scan, longest-prefix match. Also includes a RadixTrie (compressed) variant.
Update a global Trie from the command line. The possibilities are endless!
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
A JavaScript port of Data.Trie
Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.