Trie

TypeScript library providing a trie (prefix tree) datastructure.

simple trie implementation based on JS proxies

Radix tree like router middleware for koa

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

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

A fast router middleware for ingress

Builder code for unicode tries

Binary Merkle Tree operations on data

A trie data structure with wildcard path support.

High-performance JIT router for Node.js

concrete data type implementations

Generates trie roots from key-value pairs

Trie with superpowers! 💪

Compute the Longest Common Prefix from some strings

marisa-trie for Node.js

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

Trie implementation for node and js projects

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

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

Proving things in the Ethereum Patricia Trie (tree)

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

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

Customizable trie data structure built in JavaScript.

A Tailwind-like classNames utility for React Native powered by a fast Trie-based style lookup.Write utility classes in your components and convert them into React Native style objects instantly.

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

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

Build and search a minimalist dictionary trie

Autocomplete trie impl for node and the browser

Abstract IPLD format - Ethereum Trie

Pure string:val storage, using structural sharing

Trie tree implementation with keywords density calcuation functionality

node-trie =========

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

A double array trie implementation

Radix Trie - Compressed trie data structure.

Server router

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

A TypeScript implementation of a Trie (prefix tree) data structure.

>> Easiest package to build and manipulate prefix trie structures

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

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

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

JavaScript data structures written in CoffeeScript.

Hash Array Mapped Trie

Verkle Trie Crytography WASM/TypeScript Bindings

A wrapper of MARISA library.

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