Trie Packages

A simple JavaScript Trie-based HTTP router *just routes*.

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

splits URLs into useful hierarchical pieces.

A trie with holes for parameters

Preliminary implementation of trie that should be used in autosuggestions feature

A wrapper of MARISA library.

Double Array Trie written in Typescript

Javascript directed acyclic word graph (DAWG)

trie data stricture with wildcards

replace keywords base trie

Solve Boggle boards by finding every English word in them.

My implementation of a Trie, just cause

A simplified Wasm binding to ternary-tree crate

a JavaScript P(lain) O(ld) D(ictionary) with element access by prefixes, implemented with a trie

a merkle trie implemention that if focused on being generic and fast

radix-trie implementation for Inverse Index Document Search.

Trie based search for autocompletes with Redis.

Generate regular expressions that match a set of strings

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

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