JSPM

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

get trie position list { position: keyword[] }

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.

STL data structures for JavaScript

A wrapper of MARISA library.

Like Lego For Databases

Radix Trie - Compressed trie data structure.

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

js ds library

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

Hash Trie

Array Mapped Trie (Persistent Vector) implementation using IPLD.

Composable trie based router

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

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

TypeScript library providing a trie (prefix tree) datastructure.

A JavaScript port of Data.Trie

My take on an efficient implementation of a Trie in Javascript

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

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

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

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

Word search algorithms

typescript implementation of the prefix trie data structure

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

Pure string:val storage, using structural sharing

Flexible middleware for executing functions on matched urls

A simple trie implementation, well tested tho.

Build and search a minimalist dictionary trie

Minimal trie datastructure representation

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

an imperative implementation


js ds library

Curated collection of data structures for the JavaScript language.

build amazing tries using file-system

A double array trie implementation

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

```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 trie search algorithm in Typscript.

Basic Data Structures in TypeScript

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

A ternary search tree implementation in TypeScript.

Trie datastructure for the SOWPODS dictionary

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

a http router base on trie

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

simple trie implementation based on JS proxies

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

A tiny TypeScript trie implementation

Simple Event Emitter for ES6 and TypeScript based on Prefix Tree

Trie tree implementation with keywords density calcuation functionality

Simple scrabble solver using a trie data structure in Node.

Trie based search for autocompletes with Redis.

Simle prefix tree aka trie

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

Blazing fast, <1kb search library

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

Solve Boggle boards by finding every English word in them.

Trie datastructure with customer delimiters

React Hooks for using a Trie data structure

Lightweight collections for JavaScript

Keeps your data sorted in trie

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


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

TS/JS Map-like data structure backed by trie

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

Proofable Node SDK

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

>> Easiest package to build and manipulate prefix trie structures

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

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

Simple Trie data structure implementation in Javascript

Radix trie implementation with partial lookups and extensible paths.

Search Really Really Fast

burst trie impl in js

radix-trie implementation for Inverse Index Document Search.

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

npm module to check if a word exists in a language

Generate regular expressions that match a set of strings

js ds library

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

A utility for autocompleting words using in memory trie data structure

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

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

Advanced keyword-based search plugin

A trie structure for efficient word and phrase search

Blazing fast, <1kb search library

A list of common data structures implemented in Javascript

Data structures and algorithms written in JavaScript with TypeScript types

A trie structure

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.

Server router for Micro

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

A Trie data structure for strings

replace keywords base trie

Trie loader for Webpack

A lightweight trie implementation.

Trie based search for autocompletes with Redis.

Double Array Trie written in Typescript

trie in javascript

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.

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

A CLI for Slingshot's Fellowship program.

Trie implementation based on a minimal automaton.

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

A prefix tree class

js ds library

Trie data structure built to process link paths

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

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)

compress and decode large dictionaries

Trie-routing for Koa

Trie-based URL Routing

A simple way to map a tuple to some value

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

a Functional Trie

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

High-Octane route store/retriever

Autocomplete strategy with Redis

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

1kB Trie Router

Collection of Data Structure implementations written in JavaScript

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

A CLI for my trie project

JS DB.

js ds library

A collection of data structures to use

A key-value store utilising the filesystem.

A dead-simple trie data structure

Basis for efficient persistent data structures


radix-trie implementation for Inverse Index Document Search.

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