Trie

A trie data structure for arrays

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

A JavaScript implementation of a Trie

build amazing tries using file-system

Trie loader for Webpack

Trie-routing for Koa

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

Like Lego For Databases

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

rank text by best match of included words and phrases

## Usage

Fast Trie structure implementation with matching feature

TypeScript library providing a trie (prefix tree) datastructure.

a http router base on trie

My take on an efficient implementation of a Trie in Javascript

A simple trie index implementation that includes case sensitivity

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

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

Trie datastructure with customer delimiters

Minimal trie datastructure representation

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

This is an implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.

A Trie-based router

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

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

concrete data type implementations

A fast router middleware for ingress

Trie data structures for JavaScript

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

Yet another user agent parser

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

<meta charset="utf-8"/>

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

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

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

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

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.

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

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

A trie implementation for NodeJS

Just a simple Trie structure built for javascript.

This is a trie module.

simple trie implementation based on JS proxies