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.
Curated collection of data structures for the JavaScript/TypeScript.
An implementation of the Fibonacci heap data structure
binary heap (priority queue) algorithms (ported from Python's heapq module)
heap analysis plugins for memlab
Min/Max Heap & Heap Sort implementation in javascript
A JavaScript library for escaping CSS strings and identifiers while generating the shortest possible ASCII-only output.
For ruby and ruby on rails
Heap dump, sample profiler and allocation timeline generator for Node.
Parses V8 heap snapshots
Programmable interface to Clinic.js Heap Profiler
Ruby SemVer in TypeScript.
Convention over configuration for using Vite in Ruby apps
Like ruby's abbrev module, but in js
Heap bridge helper for implementing JavaScript sdks on native platforms.
Ruby grammar for tree-sitter
TypeScript definitions for heap
prettier plugin for the Ruby programming language
Heap bridge SDK for React Native
Min Heap
React Native wrapper for Heap Analytics.
WebSocket framework for Ruby on Rails.
Fast heap-based priority queue in JavaScript
Library of data structures
Binary or multiple heap
Got a heap dump? Great. Use this tool to see what's in it!
Make several heap dumps and summarize allocated, retained memory
Got a heap dump? Great. Use this tool to see what's in it!
A Ruby implementation of the Fibonacci heap data structure ideal for use as a priority queue with Dijkstra's algorithm.
This is a skew heap algorithm for educational use.
Introspect the Ruby Heap by indexing, counting, locating references to and detaching (in order to release) objects - optionally narrowing by namespace
A min max heap extension for Ruby
Ruby 1.9 heap contents dumper
This tool allows to measure a fragmentation of the Ruby VM heap.
Performant priority queue in pure ruby with support for changing priority using pairing heap data structure
A binary heap can be used as a priority queue.