Trie

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

My take on an efficient implementation of a Trie in Javascript

A JavaScript implementation of a Trie

To create a working instance of uBlock Origin's static network filtering engine

JS Trie / DAWG classes

Trie-based map data structure with prefix search/query support

TypeScript definitions for autosuggest-trie

Keeps your data sorted in trie

simple trie implementation based on JS proxies

A trie-based autocompleter

Fast Trie structure implementation with matching feature

Just a simple Trie structure built for javascript.

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.

Dictionary storage in trie structure to allow fast search and efficient memory use

A Trie-based router

A fast weighted auto-completion trie.

Composable trie based router

A trie implementation for NodeJS

Trie loader for Webpack

Readonly but memory-sufficient data structure for dictionaries

Yet another user agent parser

Trie datastructure with customer delimiters

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

Update a global Trie from the command line. The possibilities are endless!

Native JavaScript trie implementation

This is a simple implementation of router by using Trie data structure at core. It has a basic param feature for example the following code are valid.

The purpose of this project is to create a JS library for prefix trees (aka tries).

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

Create a regular expression to match any of the phrases added to the trie (inspired by Dan Kogai's Regexp::Trie Perl module.)

Like Lego For Databases

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

A fast weighted autocompleter

A trie data structure for arrays

Trie data structures for JavaScript

Trie

Trie Data Structure to support cspell.

An implementation of an immutable map structure, based on a hash array mapped trie

An implementation of an immutable set structure, based on a hash array mapped trie

TypeScript implementation of the Aho-Corasick algorithm for efficient string matching

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

this is an implementation of trie.

A CLI for my trie project

This is a trie module.