JSPM

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

Curated collection of data structures for the JavaScript/TypeScript.

Trie Data Structure to support cspell.

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

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

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

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

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.

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

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

Trie and radix tree implementation tailored towards exact matches.

Implementation of verkle trees as used in Ethereum.

Implementation of verkle trees as used in Ethereum.

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

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

Composable trie based router

Lightweight Path Trie for TypeScript and JavaScript

Implementation of binary trees as used in Ethereum.

trie implementation in javascript

Observable Path Trie Store

Radix Trie in Javascript

An efficient immutable ordered sequence of elements akin to a Vector

Minimalistic trie implementation for prefix searches

production-ready data structures implementation in javascript & typescript.

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

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

The extremely fast compressed trie implementation.

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

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

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

Binary Merkle Tree operations on data

A Trie-based router

Trie Data Structure reader for cspell

Like Lego For Databases

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

Compute the Longest Common Prefix from some strings

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

Runtime code for unicode-trie files.

Aho–Corasick string matching algorithm

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

Hash Array Mapped Trie

Fast prefix operations for strings of digits

npm module to check if a word exists in a language

Server router

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

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

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

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

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

NoSQL Everywhere

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

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

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

JS Trie / DAWG classes

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

Trie-routing for Koa

Customizable trie data structure built in JavaScript.

JavaScript data structures written in CoffeeScript.

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

High-performance JIT router for Node.js

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

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

Apache Shiro permission style using Trie data structure

Comprehensive TypeScript SDK for detecting disposable email addresses with real-time synchronization, advanced DNS validation (MX, SPF, DMARC), intelligent caching, and high-performance email validation. Features 119K+ domains from 15+ sources with automa

A trie data structure for arrays

Generate regular expressions that match a set of strings

Trie

Unicode line-breaking algorithm from UAX #14

Customizable trie data structure built in JavaScript.

A trie router for toa.

Aho–Corasick string matching algorithm

A library of data structures and algorithms

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

A compact trie for mapping keys to values

🚀 Complete TypeScript Data Structures Library: Linked List, Hash Map, Concurrent HashMap, Stack, Queue, Set, Tree, BST, AVL Tree, Red-Black Tree, Graph, Heap, Trie with 100% test coverage, async-safe operations, and comprehensive algorithms. Perfect for

Create a regular expression from trie like object

A lightweight, framework-agnostic autocomplete library with intelligent word learning and trie-based completion

Customizable trie data structure built in JavaScript.

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

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

Builder code for unicode tries

A double array trie implementation

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.

Directed Acyclic Word Graph

Data structure and graph processing library written in modern JavaScript

A serializable compact prefix trie

Implementation of verkle trees as used in Ethereum.

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

Efficient data structures for every day programming

trie data structure

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

React Hooks for using a Trie data structure

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

for js jieba lib

Pure string:val storage, using structural sharing

Trie generator.

ID insertion for React components

A JavaScript data-structure library

A map implementation that supports multiple keys

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.

A trie library for JavaScript with C++ bindings.

A TypeScript implementation of trie data structure

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

A router for Quinn

Javascript versions of classic software development algorithms

get trie position list { position: keyword[] }

rank text by best match of included words and phrases

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

a http router base on trie

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

Radix Trie-Based Configuration Platform

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

word-break util using trie-search dictionary

STL data structures for JavaScript

A trie with holes for parameters

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

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

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

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

<div align="center">

Radix trie implementation with partial lookups and extensible paths.

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

A wrapper of MARISA library.

Minimal trie datastructure representation

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

Advanced quick strucures and algorithms at your finger tips

Bionamic util library

An implementation of the Aho-Corasick algorithm in TypeScript.

Binary Merkle Tree operations on data

Yet another quad tree

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

radix-trie implementation for Inverse Index Document Search.

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

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

Composable trie based router

Javascript directed acyclic word graph (DAWG)

Server router for Micro

Find the longest namespace that a string starts with

an imperative implementation

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

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

Simple pathname router that makes zero assumptions about the server

Trie datastructure with customer delimiters

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

A Trie data structure for strings

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


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

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

Fast Trie structure implementation with matching feature

Basic Data Structures in TypeScript

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

A simple way to map a tuple to some value

typescript implementation of the prefix trie data structure

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

Native JavaScript trie implementation

A trie structure for efficient word and phrase search

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

Hash Trie

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

Proofable Node SDK

A CLI for my trie project

Yet another user agent parser

burst trie impl in js

Aho–Corasick string matching algorithm

simple trie implementation based on JS proxies

Basis for efficient persistent data structures

A CLI that interacts with a trie hosted online

A dead-simple trie data structure

Trie - trie data structure accepting any data type

A collection of clean, testable data structures in modern TypeScript

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

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

Radix Trie - Compressed trie data structure.

nodejs关键词过滤工具

Simple scrabble solver using a trie data structure in Node.

TypeScript library providing a trie (prefix tree) datastructure.

Pure string:val storage, using structural sharing

A ternary search tree implementation in TypeScript.

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

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

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

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

A list of common data structures implemented in Javascript

Word search algorithms

TS/JS Map-like data structure backed by trie


Solve Boggle boards by finding every English word in them.

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

Array Mapped Trie (Persistent Vector) implementation using IPLD.

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

Collection of Data Structure implementations written in JavaScript

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

replace keywords base 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.

Lightweight collections for JavaScript

A JavaScript port of Data.Trie

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.

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 simple trie implementation, well tested tho.

Simle prefix tree aka trie

Curated collection of data structures for the JavaScript language.

Trie datastructure for the SOWPODS dictionary

Trie data structures for JavaScript

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

A simplified Wasm binding to ternary-tree crate

A CLI for Slingshot's Fellowship program.

A simple Trie structure with wildcard support to match streams

Data structures and algorithms written in JavaScript with TypeScript types

js ds library

Trie-based URL Routing

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

1kB Trie Router

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

Composable trie based router

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

Build and search a minimalist dictionary trie

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

A utility for autocompleting words using in memory trie data structure

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

My implementation of a Trie, just cause

js ds library

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

Keeps your data sorted in trie

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

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

A double array trie implementation

extend trie functionality for node-trie

splits URLs into useful hierarchical pieces.

Trie based search for autocompletes with Redis.

A lightweight trie implementation.

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

Trie implementation based on a minimal automaton.

Flexible middleware for executing functions on matched urls

High-Octane route store/retriever

Autocomplete strategy with Redis

An abstract in-memory trie structure

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

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!

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