Trie Packages

trie data structure

A 'micro' Trie implementation in Js for learning data structure design.

Apache Shiro permission style using Trie data structure

Hash Array Mapped Trie

Compute the Longest Common Prefix from some strings

A map implementation that supports multiple keys

Data structure and graph processing library written in modern JavaScript

A trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.

Run SQLite on the device and IndexedDB in the browser with exactly the same API with nanoSQL 2!

Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams

Server router

Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.

Simple redis-backed library for managing and querying an autocomplete dictionary.

A compact trie for mapping keys to values

NoSQL Everywhere

Proofable Node SDK

A router for Quinn

JS Trie / DAWG classes

npm module to check if a word exists in a language

TypeScript library providing a trie (prefix tree) datastructure.