Yomguithereal/mnemonist

Health v2 · maintenance only

Adoption not part of the score

2434 stars · 105 forks observed · 2026-08-28

What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded

Mnemonist is a curated collection of data structures for JavaScript and TypeScript, including classics like heaps, tries, and queues as well as exotic ones like Burkhard-Keller trees, Bloom filters, and suffix arrays. It is fully modular, performant, and typed for comfortable TypeScript use.

Use cases

• use a heap or priority queue in JavaScript
• implement an LRU cache in Node.js
• build an inverted index for search
• fuzzy string matching with SymSpell
• use a trie or BK-tree in TypeScript
• need a bloom filter or bitset in JS

When to choose

• you need data structures missing from JavaScript's standard library
• you want modular imports without pulling in a whole library
• you work in TypeScript and want typed data structures

When to avoid

• you need a graph data structure (use graphology instead)
• you need extreme performance of a low-level language
• you only need structures already available in standard JS objects

Facets

library · maturity stable

data-science search-engine caching developer-tools developer-tools browser bun data-structures heap trie bloom-filter lru-cache suffix-array kd-tree modular algorithms search natural-language-processing nodejs javascript typescript deno

Member repositories

For agents

markdown · JSON · MCP: product_card(name="Yomguithereal/mnemonist")