Trie Packages

Curated collection of data structures for the JavaScript language.

rank text by best match of included words and phrases

A prefix tree class

trie in javascript

A serializable compact prefix trie

Standard data structure

Data structures and algorithms written in JavaScript with TypeScript types

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

JS DB.

A module for performing a dictionary search

An easy to easy TypeScript implementation of the Trie data structure for

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

extend trie functionality for node-trie

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

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


a Functional Trie

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

Implementation of verkle trees as used in Ethereum.

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