Search results
300 packages found
A lightweight trie implementation.
This package can be used to implement a Search-As-You-Type funtionality and uses a Trie data structure
production-ready data structures implementation in javascript & typescript.
- data structures typescript
- es6 data structures
- javascript data structures
- data structures
- data structures javascript
- data structures js
- stack
- es6 stack
- queue
- es6 queue
- priority queue
- priorityqueue
- set
- linked list
- View more
Minimalistic trie implementation for prefix searches
Implementation of verkle trees as used in Ethereum.
Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.
High-performance JIT router for Node.js
A ternary search tree for Node.js
Hachiko aims to be the easiest, fastest and most practical of all data structure libraries for FP in JS
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 trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.
Search Really Really Fast
Generic trie-based router with support for wildcards, route param validation/coercion, auth
Quick fork of unicode-trie for modernity