Yet another priority queue implementation.
Caution
This is a very alpha, API can be changed.
Features
- implementation of Array interface (
push
,slice
,forEach
,map
etc.) - written in ES6
Installing
npm install priority-queue-js
API
.push(item)
- inserts a new item.peek()
- returns the smallest item.pop()
- removes the smallest item and returns it.shift()
- removes the biggest item and returns it.slice(begin, end)
- returns slice of queue data.copy()
- returns copy of queue data
Quick start
; const queue = ; queue;queue;queue; console // [3, 5, 9]
{ return aval - bval;} const queue = comparator ; queue;queue;queue; for const item of queue console;