Generate a concise Regular Expression to match a list of words
-
Updated
Jun 8, 2024 - TypeScript
Generate a concise Regular Expression to match a list of words
simple boggle solver built in react typescript
Universal database layer for the client, server & mobile devices. It's like Lego for databases.
Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.
Fast trie implementation written in C++ using jsi
A Double-array trie structure
Typescript implementation of trie/digital tree/radix tree/prefix tree/suffix tree.
Estrutura de dados usando Typescript
Yet another O(n) trie. This time just and only for string search.
🌲 The extremely fast compressed trie implementation in 2 kB gzipped.
TS/JS Map-like data structure backed by trie
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.
Trie data structure implementation in javascript
A fast trie implementation for typescript
"Any word from set that exactly begins with" fast search index.
an unraveled trie, for storing words and related data
A ternary search trie implementation in TypeScript.
Add a description, image, and links to the trie topic page so that developers can more easily learn about it.
To associate your repository with the trie topic, visit your repo's landing page and select "manage topics."