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

Trie Data Structure to support cspell.

for js jieba lib

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

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

JS Trie / DAWG classes

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

JavaScript implementation of Double-Array trie

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 library of data structures and algorithms

Composable trie based router

Implementation of verkle trees as used in Ethereum.

Trie and radix tree implementation tailored towards exact matches.

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

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

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

Implementation of binary trees as used in Ethereum.

Implementation of verkle trees as used in Ethereum.

An efficient immutable ordered sequence of elements akin to a Vector

Minimalistic trie implementation for prefix searches

Lightweight Path Trie for TypeScript and JavaScript

Observable Path Trie Store

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

Like Lego For Databases

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

A Trie-based router

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

js ds library

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

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

Hash Array Mapped Trie

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

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

js ds library

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

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

npm module to check if a word exists in a language

concrete data type implementations

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

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

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

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

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

Builder code for unicode tries

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

Apache Shiro permission style using Trie data structure

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

NoSQL Everywhere

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

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

Binary Merkle Tree operations on data

Trie-routing for Koa

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

🚀 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

word-break util using trie-search dictionary

Javascript versions of classic software development algorithms

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

A double array trie implementation

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

Directed Acyclic Word Graph

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

Customizable trie data structure built in JavaScript.

Efficient data structures for every day programming

Generate regular expressions that match a set of strings

trie data structure

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

A compact trie for mapping keys to values

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.

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.

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

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

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

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

Pure string:val storage, using structural sharing

typescript implementation of the prefix trie data structure

Trie - trie data structure accepting any data type

TS/JS Map-like data structure backed by trie

Data structure and graph processing library written in modern JavaScript

Trie generator.

A trie router for toa.

A router for Quinn

My take on an efficient implementation of a Trie in Javascript

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

Find the longest namespace that a string starts with

simple trie implementation based on JS proxies

Trie

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

burst trie impl in js

Radix Trie-Based Configuration Platform

js ds library

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.

A map implementation that supports multiple keys

A Javascript library for using classic Data Structures

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

Advanced quick strucures and algorithms at your finger tips

Trie data structures for JavaScript

Customizable trie data structure built in JavaScript.

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

Trie datastructure with customer delimiters

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

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

Hash Trie

an imperative implementation

nodejs关键词过滤工具

Radix Trie - Compressed trie data structure.

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

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 with holes for parameters

A wrapper of MARISA library.

js ds library

Simle prefix tree aka trie

Like Lego For Databases

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.

An implementation of the Aho-Corasick algorithm in TypeScript.

A JavaScript data-structure library

Bionamic util library

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

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

Javascript directed acyclic word graph (DAWG)

<div align="center">

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.

get trie position list { position: keyword[] }

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

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

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

Pure string:val storage, using structural sharing

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

Lightweight collections for JavaScript

Trie datastructure for the SOWPODS dictionary

Data structures and algorithms written in JavaScript with TypeScript types

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

A list of common data structures implemented in Javascript

A JavaScript port of Data.Trie

TypeScript library providing a trie (prefix tree) datastructure.

Minimal trie datastructure representation

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

Word search algorithms

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

A simplified Wasm binding to ternary-tree crate

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

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

Array Mapped Trie (Persistent Vector) implementation using IPLD.

A trie search algorithm in Typscript.

Trie based search for autocompletes with Redis.

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

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

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

replace keywords base trie

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

Basic Data Structures in TypeScript

Solve Boggle boards by finding every English word in them.

npm module to check if a word exists in a language

a http router base on trie

Blazing fast, <1kb search library

Build and search a minimalist dictionary trie

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

build amazing tries using file-system

Blazing fast, <1kb search library

A double array trie implementation

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

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 tiny TypeScript trie implementation

js ds library

trie data stricture with wildcards

Radix trie implementation with partial lookups and extensible paths.

JS DB.

radix-trie implementation for Inverse Index Document Search.

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

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

Aho–Corasick string matching algorithm

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

Proofable Node SDK

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

Search Really Really Fast

Keeps your data sorted in trie


Composable trie based router

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

A utility for autocompleting words using in memory trie data structure

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

A trie structure

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.

extend trie functionality for node-trie

compress and decode large dictionaries

Advanced keyword-based search plugin

A Trie data structure for strings

Double Array Trie written in Typescript

Create regular expression patterns based on a list of strings to be matched.

React Hooks for using a Trie data structure

Trie loader for Webpack

A trie implementation

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

Server router for Micro

A lightweight trie implementation.

A simple way to map a tuple to some value

A ternary search tree implementation in TypeScript.

Trie based search for autocompletes with Redis.

A simple trie implementation, well tested tho.

Trie implementation based on a minimal automaton.

Yet another user agent parser

splits URLs into useful hierarchical pieces.