Search results
89 packages found
A trie data structure for arrays
An in-memory node.js autocomplete package based on the trie data structure, based off the autocomplete module
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.
A simple trie implementation, well tested tho.
JS implementation of persistent bit-partitioned vector trie a.k.a vector data structure in Clojure
Simple scrabble solver using a trie data structure in Node.
Javascript directed acyclic word graph (DAWG)
Fork of HAMT that adds transient mutation and support for custom key types
Simple Trie data structure implementation in Javascript
Trie data structure implementation in javascript
Basis for efficient persistent data structures
TS/JS Map-like data structure backed by trie
A trie structure for efficient word and phrase search
A simple implementation of Trie data structure in JS.
Collection of Data Structure implementations written in JavaScript
Customizable trie data structure built in JavaScript.
JavaScript data structures written in CoffeeScript.
Trie data structures for JavaScript
autocomplete-trie-search is an NPM package that provides fast and efficient autocomplete suggestions for text input fields using the trie data structure. With autocomplete-trie-search, you can easily integrate autocomplete functionality into your web or m
A collection of data structures to use