Trie

Performs fast search and replace on a text based on a set of rules.

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.

build amazing tries using file-system

simple trie implementation based on JS proxies

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

Minimal trie datastructure representation

word-break util using trie-search dictionary

A fast weighted auto-completion trie.

Like Lego For Databases

A CLI for my trie project

a http router base on trie

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

this is an implementation of trie.

Trie datastructure with customer delimiters

The trie from node-autocompleter in a form that can be used in browser

Trie-routing for Koa

Native JavaScript trie implementation

A library for quick insert and retrieval of JavaScript objects, keyed by prefix strings.

Just a simple Trie structure built for javascript.

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

Trie

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

A Trie-based router

JS Trie / DAWG classes

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

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

Generates trie roots from key-value pairs

An implementation of an immutable list structure, based on a bit-partitioned vector trie

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

Trie-based URL Routing

rank text by best match of included words and phrases

## Usage

A Command Line Interface made with Node which can interact with a Trie hosted globally live on a Google Cloud server

Yet another user agent parser

<meta charset="utf-8"/>

Trie implemented dictionary

Library to implement tries in javascript and typescript

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

A TS implementation of the [Trie](https://en.wikipedia.org/wiki/Trie) data structure, including fuzzy (approximate) string matching.

This is a trie module.

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

A trie implementation for NodeJS

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

Readonly but memory-sufficient data structure for dictionaries

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

Trie loader for Webpack

A simple Trie data structure for optimized for lowercased latin alphanumeric strings. Optimization was done based on the following assumption:

A simple trie index implementation that includes case sensitivity