Trie

Yet another user agent parser

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

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

JS Trie / DAWG classes

A fast weighted auto-completion trie.

Like Lego For Databases

This project implements ElasticSearch features using the Trie data structure, providing efficient and fast searching capabilities on large datasets. The Trie data structure is leveraged for optimal search performance, and the project is built with React.j

simple trie implementation based on JS proxies

Keeps your data sorted in trie

A trie implementation for NodeJS

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

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

Fast Trie structure implementation with matching feature

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

Readonly but memory-sufficient data structure for dictionaries

<meta charset="utf-8"/>

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

Native JavaScript trie implementation

A trie-based autocompleter

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.

Trie-routing for Koa

A Trie-based router

Hash Array Mapped Trie

A pattern matching search trie for Node.js. Allows fast (logarithmic time) searching against large sets (10,000+) of simple pattern matching expressions.

Trie-based ES6 Map clone: keys=iterables, values=anything

Composable trie based router

Trie implemented dictionary

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

A JavaScript port of Data.Trie

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

this is an implementation of trie.

Just a simple Trie structure built for javascript.

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

Library to implement tries in javascript and typescript

A Command Line Interface (CLI) to display, add, delete, search, and autocomplete words in a global trie.

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

Trie loader for Webpack

My take on an efficient implementation of a Trie in Javascript

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

Trie-based URL Routing

trie implementation in javascript

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

Binary Merkle Tree operations on data

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

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

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