avl-tree-typed
Standard AVL tree
Standard AVL tree
Fast javascript array implementation
Not only caches data in a key-value format but also supports efficient data management with a hierarchical structure.
A simple and fast way to manage concurrent promise tasks with Queue Data Structure.
A serializable compact prefix trie
This module is an utility for managing data in the form of Map.
A suite of circular data structures, including deques, lists, maps, queues, sets and stacks.
A fixed-size auto-overwriting stack.
A powerful TypeScript library for normalizing and validating complex data structures using customizable schemas
Standard data structure
A slim and efficient in-memory Deque (doubly-ended queue) for Node.js projects, designed with Data-Oriented Design principles and implemented using a cyclic buffer to optimize memory layout through sequential item allocation. A notable real-world use case
A slim and efficient in-memory queue for Node.js projects. The implementation employs Data-Oriented Design using a cyclic buffer, optimizing memory layout through sequential item allocation.
Search attributes easily within structures of type dictionary, list and embedded substructures.
Deque
Provide commonly used data-structures for javascript.
Binary Search Tree
Implementation of the bucket queue data structure in TypeScript
Binary Tree. Javascript & Typescript Data Structure.
A type-safe groupBy function for TypeScript
Directed Graph