Readonly but memory-sufficient data structure for dictionaries
This is a trie module.
Update a global Trie from the command line. The possibilities are endless!
An in-memory node.js autocomplete package based on the trie data structure, based off the autocomplete module
A fast router middleware for ingress
A simple class for ternary search trie in Node.js™.
Маршрутизатор для Node.js на основе префиксного дерева
An in-memory autocomplete package based on the trie data structure
Hash Array Mapped Trie
Trie with superpowers! 💪
Pure string:val storage, using structural sharing
Generic trie-based router with support for wildcards, route param validation/coercion, auth
Binary Merkle Tree operations on data
Реализация префиксного дерева для автозаполнения с поддержкой слов и фраз
🚀 Complete TypeScript Data Structures Library: Linked List, Hash Map, Stack, Queue, Set, Tree, BST, AVL Tree, Red-Black Tree, Graph, Heap, Trie with 100% test coverage, loop detection, and comprehensive algorithms. Perfect for DSA learning, interviews, a
A high-performance API router for Astro using a Trie-based matcher.
High-performance JIT router for Node.js
Trie implementation for node and js projects
jieba-js chinese word segmentation for node in pure javascript.
Radix Trie - Compressed trie data structure.
word-break util using trie-search dictionary
A trie data structure with wildcard path support.
JavaScript data structures written in CoffeeScript.
Algorithms and data structures for your JavaScript and TypeScript projects 🧑💻
node-trie =========
A tiny TypeScript trie implementation
Trie - trie data structure accepting any data type