JSPM

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

production-ready data structures implementation in javascript & typescript.

trie implementation in javascript

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

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

Radix Trie in Javascript

Curated collection of data structures for the JavaScript/TypeScript.

Construct Merkle Trees and verify proofs

for js jieba lib

Trie Data Structure to support cspell.

Binary Merkle Tree operations on data

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

JS Trie / DAWG classes

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.

Standard data structure

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.

Composable trie based router

A library of data structures and algorithms

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.

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

Implementation of binary trees as used in Ethereum.

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

An efficient immutable ordered sequence of elements akin to a Vector

Implementation of verkle trees as used in Ethereum.

Minimalistic trie implementation for prefix searches

Lightweight Path Trie for TypeScript and JavaScript

Observable Path Trie Store

Like Lego For Databases

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

A Trie-based router

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

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

The extremely fast compressed trie implementation.

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

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

Server router

Radix tree like router middleware for koa

Fast prefix operations for strings of digits

Trie Data Structure reader for cspell

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

js ds library

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

Aho–Corasick string matching algorithm

npm module to check if a word exists in a language

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

concrete data type implementations

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

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

js ds library

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

Hash Array Mapped Trie

JavaScript data structures written in CoffeeScript.

A trie data structure for arrays

A fast router middleware for ingress

Compute the Longest Common Prefix from some strings

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

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

Runtime code for unicode-trie files.

High-performance JIT router for Node.js

A serializable compact prefix trie

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

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

A collection of clean, testable data structures in modern TypeScript

Unicode line-breaking algorithm from UAX #14

Apache Shiro permission style using Trie data structure

Builder code for unicode tries

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

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

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

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

NoSQL Everywhere

Binary Merkle Tree operations on data

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

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

Javascript versions of classic software development algorithms

Create a regular expression from trie like object

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

A double array trie implementation

Directed Acyclic Word Graph

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

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

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

Customizable trie data structure built in JavaScript.

Efficient data structures for every day programming

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

Generate regular expressions that match a set of strings

rank text by best match of included words and phrases

trie data structure

A compact trie for mapping keys to values

word-break util using trie-search dictionary

Aho–Corasick string matching algorithm

Trie

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

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.

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

Trie - trie data structure accepting any data type

typescript implementation of the prefix trie data structure

Trie generator.

Data structure and graph processing library written in modern JavaScript

Find the longest namespace that a string starts with

TS/JS Map-like data structure backed by trie

A router for Quinn

A trie router for toa.

simple trie implementation based on JS proxies

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

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

A 'micro' Trie implementation in Js for learning data structure design.

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

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

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

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

Trie datastructure with customer delimiters

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

an imperative implementation

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.

A wrapper of MARISA library.

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.

Bionamic util library

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.

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

get trie position list { position: keyword[] }

Word search algorithms

Pure string:val storage, using structural sharing

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

Trie datastructure for the SOWPODS dictionary

A list of common data structures implemented in Javascript

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

TypeScript library providing a trie (prefix tree) datastructure.

A JavaScript port of Data.Trie

Minimal trie datastructure representation

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

A simplified Wasm binding to ternary-tree crate

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

Array Mapped Trie (Persistent Vector) implementation using IPLD.

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

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

Basic Data Structures in TypeScript

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

build amazing tries using file-system

replace keywords base trie

Solve Boggle boards by finding every English word in them.


Build and search a minimalist dictionary trie

a http router base on trie

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

Blazing fast, <1kb search library

Blazing fast, <1kb search library

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

A double array trie implementation

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

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

Curated collection of data structures for the JavaScript language.

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

trie data stricture with wildcards

Radix trie implementation with partial lookups and extensible paths.

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.

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

Proofable Node SDK

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


Keeps your data sorted in trie

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

A utility for autocompleting words using in memory 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

Composable trie based router

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.

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

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

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

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

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