JSPM

  • ESM via JSPM
  • ES Module Entrypoint
  • Export Map
  • Keywords
  • License
  • Repository URL
  • TypeScript Types
  • README
  • Created
  • Published
  • Downloads 3524899
  • Score
    100M100P100Q190565F
  • License ISC

The smallest and simplest JavaScript priority queue

Package Exports

  • tinyqueue

This package does not declare an exports field, so the exports above have been automatically detected and optimized by JSPM instead. If any package subpath is missing, it is recommended to post an issue to the original package (tinyqueue) to support the "exports" field. If that is not possible, create a JSPM override to customize the exports field for this package.

Readme

tinyqueue

The smallest and simplest binary heap priority queue in JavaScript.

// create an empty priority queue
var queue = new TinyQueue();

// add some items
queue.push(7);
queue.push(5);
queue.push(10);

// remove the top item
var top = queue.pop(); // returns 5

// return the top item (without removal)
top = queue.peek(); // returns 7

// get queue length
queue.length; // returns 2

// create a priority queue from an existing array (modifies the array)
queue = new TinyQueue([7, 5, 10]);

// pass a custom item comparator as a second argument
queue = new TinyQueue([{value: 5}, {value: 7}], function (a, b) {
    return a.value - b.value;
});

// turn a queue into a sorted array
var array = [];
while (queue.length) array.push(queue.pop());

Install as an NPM module:

$ npm install tinyqueue

Make a browser build using Browserify:

$ npm install -g browserify
$ browserify index.js -s TinyQueue > tinyqueue.js

Inspired by js-priority-queue by Adam Hooper.