A flexible trie-based registry for storing and querying entries with optional hierarchical keys. `Registrie` supports both simple key-value stores and complex nested structures, making it a versatile tool for various applications.
This package provides a powerful Radix data storage and retrieval library for TypeScript. It allows you to efficiently store and manage structured data using a Radix tree data structure.
A Node http router that implements a Radix tree (trie).
Lightweight Path Trie for TypeScript and JavaScript
Advanced quick strucures and algorithms at your finger tips
A trie implementation
A responsive search page component, using dynamic Trie based search funcationality, that can easily be added to your React Project
Allows access to a global trie for storage and customization of words
an imperative implementation
Algorithms and data structures for your JavaScript and TypeScript projects 🧑💻
A map-like Trie class
npm module to check if a word exists in a language
A flexible implementation of a trie (prefix tree) to let you efficiently find partial and complete matches of stored values. A trie is a tree-like data structure, also referred to as a prefix tree, that enables optimized searching for specific keys from a
Trie data structures for JavaScript
A zero dependencies http router for `bun.serve` [Homepage](https://github.com/Triment/sweet.js/tree/npm) ## useage ### install ```bash npm install @triment/sweet.js@latest ``` Alternative by bun ```bash bun install @triment/sweet.js@latest ``` #### impor
Fast Trie structure implementation with matching feature
Trie-based map data structure with prefix search/query support
Run SQLite on the device and IndexedDB in the browser with exactly the same API with nanoSQL 2!
Like Lego For Databases