Trie

A Command Line Interface (CLI) to display, add, delete, search, and autocomplete words in a global trie.

Trie implemented dictionary

Readonly but memory-sufficient data structure for dictionaries

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

<meta charset="utf-8"/>

Keeps your data sorted in trie

A CLI for my trie project

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

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

Trie data structures for JavaScript

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

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

Trie implementation for node and js projects

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

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

Hash Trie

Generates trie roots from key-value pairs

Efficiently search through arrays using a Trie-based implementation for fast and optimized lookups.

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

This is an implementation of the codec for Substrate Trie

Implementation of verkle trees as used in Ethereum.

JavaScript Implementation of the IPLD format - Ethereum Transaction Trie

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

Binary Merkle Tree operations on data

NoSQL Everywhere

Compute the Longest Common Prefix from some strings

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

Apache Shiro permission style using Trie data structure

[![NPM Version][npm-image]][npm-url]

npm module to check if a word exists in a language

word-break util using trie-search dictionary

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

React Hooks for using a Trie data structure

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

Trie datastructure for the SOWPODS dictionary

## Usage

Customizable trie data structure built in JavaScript.

A trie with holes for parameters

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

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

Blazing fast, <1kb search library

Compress a trie map - ©Redsmin

A prefix tree class

Pure string:val storage, using structural sharing

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.

Trie Data Structure to support cspell.

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

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