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