JSPM

20% Cooler Boilerplate

A prefix tree class

Trie based search for autocompletes with Redis. (support vietnamese)

compress and decode large dictionaries

a Functional Trie

Fast Trie structure implementation with matching feature

A collection of data structures to use

radix-trie implementation for Inverse Index Document Search.

1kB Trie Router

Trie loader for Webpack

Autocomplete strategy with Redis

Collection of Data Structure implementations written in JavaScript

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

Native JavaScript trie implementation

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

A module for performing a dictionary search

A dead-simple trie data structure

A flexible implementation of a trie (prefix tree) to let you efficiently find partial and complete matches of stored values. A trie is a tree-like data structure, also referred to as a prefix tree, that enables optimized searching for specific keys from a

Basis for efficient persistent data structures


My implementation of a Trie, just cause

autocomplete-trie-search is an NPM package that provides fast and efficient autocomplete suggestions for text input fields using the trie data structure. With autocomplete-trie-search, you can easily integrate autocomplete functionality into your web or m

Readonly but memory-sufficient data structure for dictionaries

A trie implementation

trie implementation in javascript

Fast Trie structure implementation with matching feature

A trie implementation for NodeJS

Trie implemented dictionary

A simple implementation of Trie data structure in JS.

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

Library to implement tries in javascript and typescript

Trie-based URL Routing

Library of building blocks for TypeScript

Cedar trie

Trie-based autocomplete/search library for Node.js, Angular, and React

An easy to easy TypeScript implementation of the Trie data structure for

Composable trie based router

A trie implementation for NodeJS

High-Octane route store/retriever

A minimal and powerful trie based url path router for Node.js.

trie implementation in javascript