@datastructures-js/priority-queue
Advanced tools
Comparing version 3.0.0 to 3.0.1
@@ -9,2 +9,6 @@ # Changelog | ||
## [3.0.1] - 2020-04-11 | ||
### Fixed | ||
- jsdoc | ||
## [3.0.0] - 2020-04-09 | ||
@@ -11,0 +15,0 @@ ### Changed |
{ | ||
"name": "@datastructures-js/priority-queue", | ||
"version": "3.0.0", | ||
"version": "3.0.1", | ||
"description": "priority queue implementation in javascript using a Min Heap", | ||
@@ -5,0 +5,0 @@ "main": "index.js", |
@@ -20,3 +20,3 @@ /** | ||
* @public | ||
* @returnss {number} | ||
* @returns {number} | ||
*/ | ||
@@ -29,3 +29,3 @@ size() { | ||
* @public | ||
* @returnss {boolean} | ||
* @returns {boolean} | ||
*/ | ||
@@ -39,3 +39,3 @@ isEmpty() { | ||
* returns the element with highest priority in the queue | ||
* @returnss {object} | ||
* @returns {object} | ||
*/ | ||
@@ -110,4 +110,4 @@ front() { | ||
/** | ||
* @public | ||
* clears the queue | ||
* @public | ||
*/ | ||
@@ -114,0 +114,0 @@ clear() { |
10275