JSPM

Trie based search for autocompletes with Redis.

Double Array Trie written in Typescript

trie in javascript

A JavaScript package for implementing the Trie data structure, including essential methods for efficient data retrieval.

Check permissions using Shiro-like strings, put in a trie.

A cli tool to compile a trie JSON object from an array of JSON objects.

A CLI for Slingshot's Fellowship program.

js ds library

20% Cooler Boilerplate

Trie implementation based on a minimal automaton.

Run SQLite on the device and IndexedDB in the browser with exactly the same API with nanoSQL 2!

A prefix tree class

js ds library

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

compress and decode large dictionaries

Trie-routing for Koa

Dynamic word set with accelerated exact and fuzzy search based on trie data structure.

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

Trie-based URL Routing

A simple way to map a tuple to some value

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

a Functional Trie

Fast Trie structure implementation with matching feature

Autocomplete strategy with Redis

Native JavaScript trie implementation

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

JS DB.

JS implementation of persistent bit-partitioned vector trie a.k.a vector data structure in Clojure

1kB Trie Router

Collection of Data Structure implementations written in JavaScript

A module for performing a dictionary search

js ds library

A collection of data structures to use

A dead-simple trie data structure

Basis for efficient persistent data structures


radix-trie implementation for Inverse Index Document Search.

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 zero dependencies http router for `bun.serve` [Homepage](https://github.com/Triment/sweet.js/tree/npm) ## useage ### install ```bash npm install @triment/sweet.js@latest ``` Alternative by bun ```bash bun install @triment/sweet.js@latest ``` #### impor

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

Trie data structure implementation in javascript

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

trie implementation in javascript