heap in js
Various heap implementations for arbitrary values and with customizable ordering
Compare heaps from JS runtimes
A versatile TypeScript library for addressable binary heaps, delivering optimized and scalable min-heap and max-heap implementations, seamlessly supporting both object-oriented and functional paradigms.
Common TypeScript utilities (sleep, semaphore, queues, heaps, exponential backoff)
Efficient data structures for Node: heaps, queues, tries, string builders etc.
implementation of priority queues using heaps
A JavaScript implementation of Heap's efficient Permutation Algorithm
🌳 Binary min & max heaps for ES6
Zero-dependency list-based data structures: linked lists (doubly/singly linked, circular), caches (LRU, LFU, FIFO), heaps, queues, stacks, splay trees.
_High Performance Game Framework_
Functions for maintaining heaps with arrays
Binomial heaps for ES6
Perisistent Priority Queue implemented with Pairing Heaps for TS
A double-ended priority queue based on min-max heaps.
__*Fairplay SDK*__ which does heaps of cool stuff.
No description provided.
An efficient online k-min selection algorithm based on min-max heaps.
AlgoVerse is a JavaScript library for efficient algorithms, data structures, and interactive visualizations. It helps developers implement and visualize structures like heaps, graphs, and trees in real time.
Efficient TypeScript implementation of Heap's algorithm to generate all permutations of a given array
Zero-runtime Stylesheets-in-TypeScript
Zero-runtime Stylesheets-in-TypeScript
Zero-runtime Stylesheets-in-TypeScript
Standard TypeScript Library
A Rust library for finding shortest paths in weighted graphs using Dijkstra's algorithm with multiple heap implementations
Thread-safe, self-owned JSON-like data with manual garbage collection.
Generic d-ary heap priority queue supporting min/max via comparator, with O(1) item lookup for updates. Features configurable arity, efficient priority updates, and cross-language API compatibility.
A high-performance Fibonacci Heap implementation in Rust with generic type support
Determine the size in bytes an object occupies inside RAM.
AI-powered JVM heap analysis tool — parse HPROF dumps, detect memory leaks, trace GC paths
AI-powered JVM heap analysis tool — parse HPROF dumps, detect memory leaks, trace GC paths
A Min Priority Queue implemented as a Thin Wrapper around BinaryHeap from the Standard Library
A crate for calculating the heap usage of a data structure.
An addressable pairing heap implementation.
Descriptor heap allocator for Direct3D 12
Production-grade leak hunting at the CLI for JVM/Android hprof dumps: retained-size dominators, leak suspects, R8 mapping deobfuscation, content previews, bitmap mode, snapshot diff. LLM-friendly.
Got a heap dump? Great. Use this tool to see what's in it!
A set of helpers for analyzing the output of ObjectSpace.dump_all
Make several heap dumps and summarize allocated, retained memory
Implements Heap's server-side API
Light-weight priority queue implementation using a heap
This is a fibonacci-heap priority-queue implementation. That means insert: O(1) decrease_priority: Amortized O(1) delete_min: Amortized O(log n) This project is different from K. Kodamas PQueue in that it allows a decrease key operation. That makes PriorityQueue usable for algorithms like dijkstras shortest path algorithm, while PQueue is more suitable for Heapsort and the like.
Binary or multiple heap
Log parser to identify actions which significantly increase VM heap size
A convenient place to store giant hammers
Create an interactive memory info interface while pwn / exploiting. Useful for rubiers writing exploit scripts. HeapInfo can be used even when target is being ptraced, this tool helps a lot when one needs to debug an ptraced process.
A standard binary heap implementation in ruby. Internally, it uses an array as data store and a mutex to keep insert and eject opeations thread-safe (both on CRuby and JRuby).
A priority queue which implements a lazy binomial heap. It supports the change priority operation, being suitable for algorithms like Dijkstra's shortest path and Prim's minimum spanning tree. It can be instantiated as a min-priority queue as well as a max-priority queue.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.