TypeScript
5
1
MIT License
This repository provides a generic, TypeScript implementation of a priority queue (heap) data structure. It allows developers to manage elements with custom ordering via a comparator function, supporting operations like insertion, removal of the highest-priority element, peeking, and iteration. It's designed for TypeScript/JavaScript developers needing an efficient, type-safe priority queue for algorithms, task
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of childrentime/priorityqueue
Babel compiler core.
A Babel preset for each environment.
Babel preset for TypeScript.
Automatically (or with prompts) bump your version number, commit changes, tag, and push to Git
TypeScript definitions for jest
TypeScript definitions for node
Jest plugin to use babel for transformation.
zero config bundler for js/ts/jsx libraries
Node.js runtime enhanced with esbuild for loading TypeScript & ESM
Delightful JavaScript Testing.
Support the repos that depend on childrentime/priorityqueue
Top contributors
childrentime
7 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet