trie-data-structure
A node module with a simple trie data structure, support for insert and search functions
Found 321 results for trie es6
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
Trie - trie data structure accepting any data type
Advanced quick strucures and algorithms at your finger tips
Customizable trie data structure built in JavaScript.
HTTP маршрутизатор для Node.js на основе префиксного дерева
A trie router for toa.
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
<div align="center">
Маршрутизатор для Node.js на основе префиксного дерева
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! 💪
an imperative implementation
Hash Trie
Trie datastructure for the SOWPODS dictionary
A radix tree map-like structure for /route/:like/keys and values
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
TypeScript library providing a trie (prefix tree) datastructure.
a ~7kb, typed, zero-dependency trie library
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
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
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.
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
js ds library
Word search algorithms
A double array trie implementation
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
A utility for autocompleting words using in memory trie data structure
A utility for autocompleting words using in memory trie data structure
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.
A tiny TypeScript trie implementation
Trie tree implementation with keywords density calcuation functionality
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

simple trie implementation based on JS proxies
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 specified in Ethereum's yellow paper.
Search Really Really Fast
burst trie impl in js
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.
extend trie functionality for node-trie
compress and decode large dictionaries
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 in javascript
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
A redis completer using Sebastian's trie algorithm: https://gist.github.com/574044
A high-performance, tree-based router for JavaScript and TypeScript, featuring a powerful plugin system for extreme extensibility
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)
Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
splits URLs into useful hierarchical pieces.
Generate regular expressions that match a set of strings
A map-like Trie class
An in-memory node.js autocomplete package based on the trie data structure, based off the autocomplete module
Simple Trie data structure implementation in Javascript
Trie data structure built to process link paths
A Node.js library for filtering sensitive words using a prefix tree (Trie).
A Command Line Interface made with Node which can interact with a Trie hosted globally live on a Google Cloud server
Basis for efficient persistent data structures
A Node http router that implements a Radix tree (trie).
Trie-based URL Routing
trie in javascript
A redis completer using Sebastian's trie algorithm: https://gist.github.com/574044
Run SQLite on the device and IndexedDB in the browser with exactly the same API with nanoSQL 2!
Native JavaScript trie implementation
a Functional Trie
Flexible middleware for executing functions on matched urls
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.
JS DB.
Dictionary storage in trie structure to allow fast search and efficient memory use
A CLI for my trie project
High-Octane route store/retriever
Autocomplete strategy with Redis
Trie-routing for Koa
A trie implementation for NodeJS
1kB Trie Router
JS implementation of persistent bit-partitioned vector trie a.k.a vector data structure in Clojure
Collection of Data Structure implementations written in JavaScript
A collection of data structures to use
A key-value store utilising the filesystem.
A dead-simple trie data structure
js ds library
Library of building blocks for TypeScript
A module for performing a dictionary search
Trie-based URL Routing

Preliminary implementation of trie that should be used in autosuggestions feature
My implementation of a Trie, just cause
radix-trie implementation for Inverse Index Document Search.
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
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
Fast Trie structure implementation with matching feature
Trie implemented dictionary
A simple implementation of Trie data structure in JS.
A CLI that interacts with a trie hosted online
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
Library to implement tries in javascript and typescript
Cedar trie
Allows access to a global trie for storage and customization of words
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
An easy to easy TypeScript implementation of the Trie data structure for
A CLI for Slingshot's Fellowship program.
Trie-based autocomplete/search library for Node.js, Angular, and React
A trie implementation for NodeJS
20% Cooler Boilerplate
trie implementation in javascript
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.