JSPM

Like Lego For Databases

Radix Trie - Compressed trie data structure.

Data structures, data types, and algorithms with superpowers! 💪

an imperative implementation

Hash Trie

Trie datastructure for the SOWPODS dictionary

A radix tree map-like structure for /route/:like/keys and values

A wrapper of MARISA library.

A JavaScript port of Data.Trie

A trie with holes for parameters

My take on an efficient implementation of a Trie in Javascript

Simle prefix tree aka trie

a ~7kb, typed, zero-dependency trie library

TypeScript library providing a trie (prefix tree) datastructure.

Node.js Native Addon for Darts (Double-ARray Trie System)

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

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

typescript implementation of the prefix trie data structure

Javascript directed acyclic word graph (DAWG)

PAT tree construction for Chinese documents, keyword extraction and text segmentation

Hachiko aims to be the easiest, fastest and most practical of all data structure libraries for FP in JS

Simple, zero dependency, type-safe implementation of a trie data structure.

An asynchronous autocomplete data store built on top of a trie.

The TRIE data structure and search algorithm, on top of leveldb.

Pure string:val storage, using structural sharing

Array Mapped Trie (Persistent Vector) implementation using IPLD.

A Javascript library for using classic Data Structures

A trie search algorithm in Typscript.

Simple, zero dependency, type-safe implementation of a radix tree data structure.

Minimal trie datastructure representation

Basic Data Structures in TypeScript

```shell script npm install @teamawesome/multi-dict ``` # Usage The aim of multi-dict is to behave just like a set of nested maps, but with an easy to use api. It supports all the regular methods of `Map`, including the iterators. ```js import Dict

Lightweight collections for JavaScript

js ds library

Word search algorithms

A double array trie implementation

A simplified Wasm binding to ternary-tree crate

Curated collection of data structures for the JavaScript language.

npm module to check if a word exists in a language


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

a http router base on trie

build amazing tries using file-system

Build and search a minimalist dictionary trie

A utility for autocompleting words using in memory trie data structure

A utility for autocompleting words using in memory trie data structure

Trie based search for autocompletes with Redis.

Simple redis-backed library for managing and querying an autocomplete dictionary.

Simple scrabble solver using a trie data structure in Node.

A tiny TypeScript trie implementation

Trie tree implementation with keywords density calcuation functionality

Simple, modifiable item-title search index based on radix tries.

Blazing fast, <1kb search library

Solve Boggle boards by finding every English word in them.

Blazing fast, <1kb search library

A fast in-memory dictionary for autocomplete as you type features based on a trie data structure.

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

Radix trie implementation with partial lookups and extensible paths.

Trie datastructure with customer delimiters

trie data stricture with wildcards

Aho–Corasick string matching algorithm

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

Create and search a dictionary of words using a trie data structure

Proofable Node SDK

TS/JS Map-like data structure backed by trie

>> Easiest package to build and manipulate prefix trie structures

This package can be used to implement a Search-As-You-Type funtionality and uses a Trie data structure


Keeps your data sorted in trie

simple trie implementation based on JS proxies

js ds library

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

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

Search Really Really Fast

burst trie impl in js

radix-trie implementation for Inverse Index Document Search.

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

extend trie functionality for node-trie

compress and decode large dictionaries

Double Array Trie written in Typescript

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

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.

Composable trie based router

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

A list of common data structures implemented in Javascript

React Hooks for using a Trie data structure

Advanced keyword-based search plugin

A trie implementation

js ds library

A 'micro' Trie implementation in Js for learning data structure design.

A ternary search tree implementation in TypeScript.

Server router for Micro

Data structures and algorithms written in JavaScript with TypeScript types

A trie structure

Trie loader for Webpack

A lightweight trie implementation.

A Trie data structure for strings

replace keywords base trie

Trie based search for autocompletes with Redis.

A simple trie implementation, well tested tho.

A simple way to map a tuple to some value

trie implementation in javascript

Simple pathname router that makes zero assumptions about the server

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

Trie implementation based on a minimal automaton.

A trie structure for efficient word and phrase search

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

A prefix tree class

Composable trie based router

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

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

Yet another user agent parser

A simple Trie structure with wildcard support to match streams

Fast Trie structure implementation with matching feature

js ds library

An abstract in-memory trie structure

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

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

splits URLs into useful hierarchical pieces.

Generate regular expressions that match a set of strings

A map-like Trie class

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

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

Basis for efficient persistent data structures

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

Trie-based URL Routing

trie in javascript

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

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

Simple Trie data structure implementation in Javascript

Trie data structure built to process link paths

a Functional Trie

Flexible middleware for executing functions on matched urls

A flexible trie-based registry for storing and querying entries with optional hierarchical keys. `Registrie` supports both simple key-value stores and complex nested structures, making it a versatile tool for various applications.

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

Native JavaScript trie implementation

JS DB.

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

A CLI for my trie project

High-Octane route store/retriever

Autocomplete strategy with Redis

Trie-routing for Koa

A trie implementation for NodeJS

1kB Trie Router

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

Collection of Data Structure implementations written in JavaScript

A collection of data structures to use

A key-value store utilising the filesystem.

A dead-simple trie data structure

js ds library


Preliminary implementation of trie that should be used in autosuggestions feature

My implementation of a Trie, just cause

radix-trie implementation for Inverse Index Document Search.

Library of building blocks for TypeScript

A module for performing a dictionary search

Trie-based URL Routing

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

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

Fast Trie structure implementation with matching feature

Trie implemented dictionary

A simple implementation of Trie data structure in JS.

A CLI that interacts with a trie hosted online

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

Library to implement tries in javascript and typescript

Cedar trie

Allows access to a global trie for storage and customization of words

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

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

A CLI for Slingshot's Fellowship program.

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

A trie implementation for NodeJS

20% Cooler Boilerplate

trie implementation in javascript

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.