JSPM

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

Directed Acyclic Word Graph

Trie

STL data structures for JavaScript

Customizable trie data structure built in JavaScript.

Маршрутизатор для Node.js на основе префиксного дерева

A TypeScript library offering efficient standard (prefix) and compressed (radix) tries for optimized string storage and operations, featuring trie-map variants for key-value storage.

Performs fast search and replace on a text based on a set of rules.

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

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

Implementation of verkle trees as used in Ethereum.

js ds library

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

Trie - trie data structure accepting any data type

A simple class for ternary search trie in Node.js™.

Find the longest namespace that a string starts with

A router for Quinn

Trie generator.

typescript implementation of the prefix trie data structure

Data structure and graph processing library written in modern JavaScript

TS/JS Map-like data structure backed by trie

A trie router for toa.

Pure string:val storage, using structural sharing

A node module with a simple trie data structure, support for insert and search functions

Customizable trie data structure built in JavaScript.

My take on an efficient implementation of a Trie in Javascript

burst trie impl in js

A map implementation that supports multiple keys

An implementation of the modified merkle patricia tree used in Ethereum, optimized for in-memory usage

Radix Trie-Based Configuration Platform

A trie with holes for parameters

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

Yet another quad tree

Advanced quick strucures and algorithms at your finger tips

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

Trie data structures for JavaScript

```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

A Javascript library for using classic Data Structures

A simplified Wasm binding to ternary-tree crate

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

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

Trie datastructure with customer delimiters

A wrapper of MARISA library.

Tiny library to make optimized regexes for a specific set of texts

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

Makes an auxilary tree structure to get O(m) efficient autocomplete results, (where m is the length of a search string), without use of external dependencies.<br /> The repo is holds a list of 300k english letter already formatted as tree and available fo

Hash Trie

nodejs关键词过滤工具

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!

NanoSQL SQLite Plugin: exposes a well documented, easy to use API for SQLite. Uses IndexedDB/WebSQL when testing in the browser, then uses SQLite on the device with the exact same API. Includes typescript support, an ORM and undo/redo built in.

js ds library

Like Lego For Databases

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

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

Simle prefix tree aka trie

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

Composable trie based router

Bionamic util library

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

A JavaScript data-structure library

<div align="center">

Javascript directed acyclic word graph (DAWG)

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

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.

An implementation of the Aho-Corasick algorithm in TypeScript.

get trie position list { position: keyword[] }

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

Word search algorithms

Pure string:val storage, using structural sharing

an imperative implementation

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

Array Mapped Trie (Persistent Vector) implementation using IPLD.

Trie datastructure for the SOWPODS dictionary

Data structures and algorithms written in JavaScript with TypeScript types

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)

TypeScript library providing a trie (prefix tree) datastructure.

Minimal trie datastructure representation

Build and search a minimalist dictionary trie

A JavaScript port of Data.Trie

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

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

Flexible middleware for executing functions on matched urls

A simple trie implementation, well tested tho.

Trie based search for autocompletes with Redis.

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

Trie tree implementation with keywords density calcuation functionality

Simple Event Emitter for ES6 and TypeScript based on Prefix Tree

build amazing tries using file-system

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

replace keywords base trie

Solve Boggle boards by finding every English word in them.


A list of common data structures implemented in Javascript

Curated collection of data structures for the JavaScript language.

a http router base on trie

Blazing fast, <1kb search library

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

A double array trie implementation

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

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.

Lightweight collections for JavaScript

Aho–Corasick string matching algorithm

A trie search algorithm in Typscript.

Simple scrabble solver using a trie data structure in Node.

>> Easiest package to build and manipulate prefix trie structures

Basic Data Structures in TypeScript

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


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

React Hooks for using a Trie data structure

A tiny TypeScript trie implementation

js ds library

JS DB.

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

radix-trie implementation for Inverse Index Document Search.

Keeps your data sorted in trie

Proofable Node SDK

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

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

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

Generate regular expressions that match a set of strings

Search Really Really Fast

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 Node http router that implements a Radix tree (trie).

A trie structure

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

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.

Simple Trie data structure implementation in Javascript

Radix trie implementation with partial lookups and extensible paths.

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

Advanced keyword-based search plugin

A Trie data structure for strings

Blazing fast, <1kb search library

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 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

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

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

Trie loader for Webpack

A trie structure for efficient word and phrase search

Server router for Micro

A lightweight trie implementation.

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

A ternary search tree implementation in TypeScript.

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.

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-routing for Koa

Yet another user agent parser

Fast Trie structure implementation with matching feature

Trie-based URL Routing

Trie data structure built to process link paths

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.

A prefix tree class

A simple Trie structure with wildcard support to match streams

An abstract in-memory trie structure

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

compress and decode large dictionaries

a Functional Trie

A collection of data structures to use

radix-trie implementation for Inverse Index Document Search.

A key-value store utilising the filesystem.

High-Octane route store/retriever

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

1kB Trie Router

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 CLI for my trie project

A dead-simple trie data structure

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

A trie implementation for NodeJS

Composable trie based router

20% Cooler Boilerplate

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