All notable changes to this project will be documented in this file.
The format is based on Keep a Changelog, and this project adheres to Semantic Versioning.
- Allows creating queues from list of values in O(n) runtime via constructor & fromArray
- README
- Added backward compatibility with v5's compare function format for MinPriorityQueue and MaxPriorityQueue
- Fixed iterator type.
- ts types.
- upgrade @datastructures-js/heap to latest
.remove(cb)to remove all elements that meet a criteria.
- Symbol.iterator
- Readme.
- upgrade heap to v4.1.2
- add types to package.json
- typos in readme.
- push & pop as alias methods for enqueue & dequeue
- new version: improved usage and types
- PriorityQueue as a type for queue with comparator.
- ability to create a priority queue with a comparator.
- index.d.ts
- typescript.
- README
- README
- README
- upgrade heap to latest major version.
.enqueuecan now be chanined.
- a default priority callback that returns the element itself if no callback is provided.
- cleaner error messages.
- README
- jsdoc
- Allow any number value for priority.
- README
- package.json
- allow passing a priority callback in constructor.
- split PriorityQueue into
MinPriorityQueue&MaxPriorityQueueto enable working with different type of priorities.
- jsdoc
.front(),.back(),.dequeue(),.toArray()now returns the priority with the element.
- README
- jsdoc
- use a Min Heap to store queue elements.