Project is in active development and has been moved to the EthereumJS VM monorepo.

Universal database layer for the client, server & mobile devices. It's like Lego for databases.

Generate a concise Regular Expression to match a list of words

Fast Trie structure implementation with matching feature

JS Trie / DAWG classes

TypeScript trie implementation

Yet another O(n) trie. This time just and only for string search.

Array Mapped Trie (Persistent Vector) implementation using IPLD.

simple trie data structure

T9 keypad using tries

ds project | student manager

React's autocomplete input component using Trie data structure

A highly efficient, isomorphic, full-featured, multilingual text search engine library, providing full-text search, fuzzy matching, phonetic scoring, document indexing and more, with micro JSON state hydration/dehydration in-browser and server-side.

A ternary search trie implementation in TypeScript.

simple boggle solver built in react typescript

TS/JS Map-like data structure backed by trie

Implementation of some known string algorithmn and data structures like: Rope, Trie, Knuth Morris Pratt, Boyer Moore, Levenshtein

Tree-based string storage data structure.

an unraveled trie, for storing words and related data

A simple Trie structure with wildcard support to match streams.