JSPM

https://en.wikipedia.org/wiki/Trie

Curated collection of data structures for the JavaScript/TypeScript.

Trie Data Structure to support cspell.

Fork of HAMT that adds transient mutation and support for custom key types

Strongly typed trie data structure for path and URL-like strings.

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

Construct Merkle Trees and verify proofs

JavaScript implementation of Double-Array trie

A trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.

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

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

A memoization algorithm in which each function argument represents a new key, creating a trie of caches as defined by the array in your first argument.

Generate regular expressions that match a set of strings

Standard data structure

Implementation of verkle trees as used in Ethereum.

Trie and radix tree implementation tailored towards exact matches.

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

Implementation of binary trees as used in Ethereum.

Implementation of verkle trees as used in Ethereum.

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

trie implementation in javascript

Lightweight Path Trie for TypeScript and JavaScript

Observable Path Trie Store

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

Composable trie based router

production-ready data structures implementation in javascript & typescript.

Radix Trie in Javascript

An efficient immutable ordered sequence of elements akin to a Vector

Minimalistic trie implementation for prefix searches

ES Map/Set-compatible implementations with customizable equality semantics & supporting operations

The extremely fast compressed trie implementation.

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

A Trie-based router

Like Lego For Databases

Trie Data Structure reader for cspell

Aho–Corasick string matching algorithm

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

TypeScript implementation of the Aho-Corasick algorithm for efficient string matching

Binary Merkle Tree operations on data

Radix tree like router middleware for koa

An in-memory autocomplete package based on the trie data structure

concrete data type implementations

A fast router middleware for ingress

Compute the Longest Common Prefix from some strings

Server router

To create a working instance of uBlock Origin's static network filtering engine

Fast prefix operations for strings of digits

John Resig's trie implementation, prettified and packaged for npm

High-performance JIT router for Node.js

Create a regular expression to match any of the phrases added to the trie (inspired by Dan Kogai's Regexp::Trie Perl module.)

Реализация префиксного дерева для автозаполнения с поддержкой слов и фраз

Hash Array Mapped Trie

Algorithms and data structures for your JavaScript and TypeScript projects 🧑‍💻

jieba-js chinese word segmentation for node in pure javascript.

Runtime code for unicode-trie files.

A library of data structures and algorithms

Generic trie-based router with support for wildcards, route param validation/coercion, auth

npm module to check if a word exists in a language

Trie-based ES6 Map clone: keys=iterables, values=anything

To create a working instance of uBlock Origin's static network filtering engine

A trie data structure for arrays

NoSQL Everywhere

Collection of string utilities. Edit-Distances, Search and Data structures. Offers for example trie, levenshtein distance.

JavaScript data structures written in CoffeeScript.

Trie-based ES6-like Map data structures with prefix search/query support

Trie-routing for Koa

🚀 Complete TypeScript Data Structures Library: Linked List, Hash Map, Stack, Queue, Set, Tree, BST, AVL Tree, Red-Black Tree, Graph, Heap, Trie with 100% test coverage, loop detection, and comprehensive algorithms. Perfect for DSA learning, interviews, a

Create a regular expression from trie like object

Unicode line-breaking algorithm from UAX #14

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

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

word-break util using trie-search dictionary

A high-performance API router for Astro using a Trie-based matcher.

Builder code for unicode tries

A trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.

A serializable compact prefix trie

Directed Acyclic Word Graph

Immutable, structure sharing collections, including B-trees and S-trees (sequence trees)

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

Apache Shiro permission style using Trie data structure

Efficient data structures for every day programming

Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.

rank text by best match of included words and phrases

Aho–Corasick string matching algorithm

Customizable trie data structure built in JavaScript.

A double array trie implementation

Generate regular expressions that match a set of strings

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

Implementation of verkle trees as used in Ethereum.

trie data structure

A compact trie for mapping keys to values

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

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

JS Trie / DAWG classes

Data structure and graph processing library written in modern JavaScript

for js jieba lib

Trie

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

Radix Trie-Based Configuration Platform

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

Find the longest namespace that a string starts with

Pure string:val storage, using structural sharing

Trie generator.

A collection of clean, testable data structures in modern TypeScript

Advanced quick strucures and algorithms at your finger tips

Trie - trie data structure accepting any data type

Customizable trie data structure built in JavaScript.

ES6 JS lightweight data structures (Priority Queue, Binary Search Tree (BST), Graph, Bloom Filters, Trie, Queue, Stack, Linked-List)

A trie router for toa.

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

A map implementation that supports multiple keys

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

A router for Quinn

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

Trie data structures for JavaScript

Binary Merkle Tree operations on data

Customizable trie data structure built in JavaScript.

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

Yet another quad tree

nodejs关键词过滤工具

Javascript versions of classic software development algorithms

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

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

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

An implementation of the Aho-Corasick algorithm in TypeScript.

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

A JavaScript data-structure library

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.

Bionamic util library

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

<div align="center">

STL data structures for JavaScript

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.

get trie position list { position: keyword[] }

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

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

js ds library

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

Like Lego For Databases

Radix Trie - Compressed trie data structure.

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

Hash Trie

an imperative implementation

Trie datastructure for the SOWPODS dictionary

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

TypeScript library providing a trie (prefix tree) datastructure.

A trie with holes for parameters

My take on an efficient implementation of a Trie in Javascript

A wrapper of MARISA library.

A JavaScript port of Data.Trie

Simle prefix tree aka trie

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

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.

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

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

Word search algorithms

js ds library

A double array trie implementation

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

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 and search a minimalist dictionary trie

build amazing tries using file-system

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.

Simple Event Emitter for ES6 and TypeScript based on Prefix Tree

Trie tree implementation with keywords density calcuation functionality

A tiny TypeScript trie implementation

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

Blazing fast, <1kb search library

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.

Solve Boggle boards by finding every English word in them.

Aho–Corasick string matching algorithm

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

Trie datastructure with customer delimiters

trie data stricture with wildcards

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


A utility for autocompleting words using in memory trie data structure

simple trie implementation based on JS proxies

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.

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 speficed in Ethereum's yellow paper, adpated for Polkadot.

extend trie functionality for node-trie

compress and decode large dictionaries

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.

A utility for autocompleting words using in memory trie data structure

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

A list of common data structures implemented in Javascript


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

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

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.

Composable trie based router