JSPM

Basic Data Structures in TypeScript

A Node.js library for filtering sensitive words using a prefix tree (Trie).

simple trie implementation based on JS proxies

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

Data structures and algorithms written in JavaScript with TypeScript types

Trie based search for autocompletes with Redis.

Simle prefix tree aka trie

Simple Event Emitter for ES6 and TypeScript based on Prefix Tree

Trie tree implementation with keywords density calcuation functionality

a JavaScript P(lain) O(ld) D(ictionary) with element access by prefixes, implemented with a trie

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

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

Solve Boggle boards by finding every English word in them.

Trie datastructure with customer delimiters

React Hooks for using a Trie data structure

Lightweight collections for JavaScript

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

A simple Trie structure with wildcard support to match streams

A tiny TypeScript trie implementation

radix-trie implementation for Inverse Index Document Search.

TS/JS Map-like data structure backed by trie

extend trie functionality for node-trie

Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.

A map-like Trie class

Keeps your data sorted in trie

Divide et impera. Organize declarative routes in an imperative way for trie, radix or prefix routers


Trie data structure built to process link paths

A lightweight trie implementation.

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

The derived algorithm from Radix trie with up-and-down relationship.

A high-performance, tree-based router for JavaScript and TypeScript, featuring a powerful plugin system for extreme extensibility

Search Really Really Fast

A redis completer using Sebastian's trie algorithm: https://gist.github.com/574044

npm module to check if a word exists in a language

Generate regular expressions that match a set of strings

Simple Trie data structure implementation in Javascript

Radix trie implementation with partial lookups and extensible paths.

A key-value store utilising the filesystem.

A Trie data structure for strings

A utility for autocompleting words using in memory trie data structure

Create regular expression patterns based on a list of strings to be matched.

A CLI that interacts with a trie hosted online

Preliminary implementation of trie that should be used in autosuggestions feature

A redis completer using Sebastian's trie algorithm: https://gist.github.com/574044

A Node http router that implements a Radix tree (trie).

A prefix tree class

A utility for autocompleting words using in memory trie data structure

Simple pathname router that makes zero assumptions about the server

trie data stricture with wildcards

Advanced keyword-based search plugin

A trie structure for efficient word and phrase search

A trie structure

A redis completer using Sebastian's trie algorithm: https://gist.github.com/574044

js ds library

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

This is an implementation of the modified merkle patricia tree as speficed in Ethereum's yellow paper, adpated for Polkadot.

splits URLs into useful hierarchical pieces.

Blazing fast, <1kb search library

A list of common data structures implemented in Javascript

Blazing fast, <1kb search library

replace keywords base trie

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

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.

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!

js ds library

js ds library

20% Cooler Boilerplate

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

Native JavaScript trie implementation

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

Fast Trie structure implementation with matching feature

Autocomplete strategy with Redis

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

A dead-simple trie data structure

A collection of data structures to use

Trie loader for Webpack

js ds library

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


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

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

trie implementation in javascript