JSPM

Radix Trie - Compressed trie data structure.

js ds library

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

Bionamic util library

js ds library

Javascript directed acyclic word graph (DAWG)

시간, 공간 복잡도는 개발 중 겪는 ‘문제’의 근본인 경우가 많다. 요구사항도 내가 느끼지 못했을 뿐 자료구조를 만드는 일과 비슷하다(데이터를 어떻게 다룰 것인가..).

Tiny search module based on trie and aho-corasick using TypeScript

Simple scrabble solver using a trie data structure in Node.

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

Composable trie based router

An implementation of the Aho-Corasick algorithm in TypeScript.

get trie position list { position: keyword[] }

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

Word search algorithms

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

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

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

an imperative implementation

Yet another user agent parser

Server router for Micro

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

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

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

Array Mapped Trie (Persistent Vector) implementation using IPLD.

Like Lego For Databases

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

TypeScript library providing a trie (prefix tree) datastructure.

Pure string:val storage, using structural sharing

A JavaScript port of Data.Trie

Build and search a minimalist dictionary trie

This package provides a powerful Radix data storage and retrieval library for TypeScript. It allows you to efficiently store and manage structured data using a Radix tree data structure.

A CLI for my trie project

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

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

Flexible middleware for executing functions on matched urls

Trie based search for autocompletes with Redis.

Simle prefix tree aka trie

A simple trie implementation, well tested tho.

Trie tree implementation with keywords density calcuation functionality

Simple Event Emitter for ES6 and TypeScript based on Prefix Tree

replace keywords base trie

build amazing tries using file-system

Solve Boggle boards by finding every English word in them.


An abstract in-memory trie structure

A list of common data structures implemented in Javascript

Curated collection of data structures for the JavaScript language.

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

radix-trie implementation for Inverse Index Document Search.

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

A double array trie implementation

Lightweight collections for JavaScript

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.

Aho–Corasick string matching algorithm

A trie search algorithm in Typscript.

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

Trie datastructure for the SOWPODS dictionary

A ternary search tree implementation in TypeScript.

Basic Data Structures in TypeScript


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

Trie data structure built to process link paths

React Hooks for using a Trie data structure

js ds library

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

JS DB.

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

A lightweight trie implementation.

A Trie data structure for strings

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

A key-value store utilising the filesystem.

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

Search Really Really Fast

Keeps your data sorted in trie

Generate regular expressions that match a set of strings

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

A utility for autocompleting words using in memory trie data structure

npm module to check if a word exists in a language

A trie structure

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

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

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

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

splits URLs into useful hierarchical pieces.

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

Advanced keyword-based search plugin

Simple Trie data structure implementation in Javascript

Radix trie implementation with partial lookups and extensible paths.

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

Blazing fast, <1kb search library

Blazing fast, <1kb search library

A utility for autocompleting words using in memory trie data structure

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

Simple pathname router that makes zero assumptions about the server

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

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

trie data stricture with wildcards

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

A trie structure for efficient word and phrase search

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

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

Trie based search for autocompletes with Redis.

Double Array Trie written in Typescript

trie in javascript

Trie implementation based on a minimal automaton.

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

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

A simple way to map a tuple to some value

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

A CLI for Slingshot's Fellowship program.

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

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

Class-based IPv4/IPv6 toolkit for JS/TS: CIDR math, ranges, allocator, trie — bigint + generators.

Composable trie based router

A trie implementation for NodeJS

High-Octane route store/retriever

trie implementation in javascript