Trie Packages

Flexible middleware for executing functions on matched urls

NanoSQL SQLite Plugin: exposes a well documented, easy to use API for SQLite. Uses IndexedDB/WebSQL when testing in the browser, then uses SQLite on the device with the exact same API. Includes typescript support, an ORM and undo/redo built in.

Immutable, structure sharing collections, including B-trees and S-trees (sequence trees)

A ternary search tree implementation in TypeScript.

a ~7kb, typed, zero-dependency trie library

Lightweight collections for JavaScript

A trie implementation for NodeJS

Simple Event Emitter for ES6 and TypeScript based on Prefix Tree

for js jieba lib

A library of data structures and algorithms

An abstract in-memory trie structure

A trie implementation in typescript with configurable string delimiters

An in-memory node.js autocomplete package based on the trie data structure, based off the autocomplete module

A JavaScript port of Data.Trie

Simple scrabble solver using a trie data structure in Node.

Create regular expression patterns based on a list of strings to be matched.

Simle prefix tree aka trie

A redis completer using Sebastian's trie algorithm: https://gist.github.com/574044

Makes an auxilary tree structure to get O(m) efficient autocomplete results, (where m is the length of a search string), without use of external dependencies.<br /> The repo is holds a list of 300k english letter already formatted as tree and available fo

magic-words is trie implementation with json and javascript!