A framework for finding JavaScript memory leaks and analyzing heap snapshots

The fastest JavaScript priority queue out there. Zero dependencies.

Javascript Data Structure & TypeScript Data Structure. Heap, Binary Tree, Red Black Tree, Linked List, Deque, Trie, HashMap, Directed Graph, Undirected Graph, Binary Search Tree, AVL Tree, Priority Queue, Graph, Queue, Tree Multiset, Singly Linked List, Doubly Linked List, Max Heap, Max Priority Queue, Min Heap, Min Priority Queue, Stack.

Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript. Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods.

Minimal versions of popular analytics libraries. Reduce the impact of third-party scripts on your application.

Data structures & algorithms implementations in TypeScript

TOP 200 #Dev 🏆 LeetCode, Solutions in TypeScript, Shell, Database (T-SQL, PL/SQL, MySQL), Concurrency (Python3). @ S. Leschev. Google Engineering Level: L6+

🔍 Heap profiling for hermes

A useful collection of fast and lightweight data structures and their algorithms

v8 heap snapshot inspector

Collection data structures that are not standard built-in objects in JavaScript. This includes a vector (double-ended queue), binary heap (priority queue), binary search tree, and a red black tree.

Typescript implementations of in-memory cache data-structures for Node and Browser.

A phaser3 pathfinding algorithm using heap data structure

🐾 Implementations of some basic algorithms

Typescript implementation of minimum and maximum heap (priority queue).

Persistent priority queue implemented with paring heaps

MinHeap and MaxHeap implemented in Typescript

Heap queue algorithm implementation for Typescript based on heapq.py module from CPython

Algorithm fundamentals implemented by JavaScript(TypeScript), @golang, @rust-lang.

A lightweight TS data structures package