/* automatically generated by JSCoverage - do not edit */
if (typeof _$jscoverage === 'undefined') _$jscoverage = {};
if (! _$jscoverage['collections/PriorityQueue.js']) {
  _$jscoverage['collections/PriorityQueue.js'] = [];
  _$jscoverage['collections/PriorityQueue.js'][1] = 0;
  _$jscoverage['collections/PriorityQueue.js'][4] = 0;
  _$jscoverage['collections/PriorityQueue.js'][12] = 0;
  _$jscoverage['collections/PriorityQueue.js'][25] = 0;
  _$jscoverage['collections/PriorityQueue.js'][34] = 0;
  _$jscoverage['collections/PriorityQueue.js'][39] = 0;
}
_$jscoverage['collections/PriorityQueue.js'][1]++;
var define = require("../define").define, MinHeap = require("./MinHeap"), base = require("../base");
_$jscoverage['collections/PriorityQueue.js'][4]++;
var PriorityQueue;
_$jscoverage['collections/PriorityQueue.js'][12]++;
PriorityQueue = define(MinHeap, {instance: {enqueue: (function (priority, value) {
  _$jscoverage['collections/PriorityQueue.js'][25]++;
  return this.insert(priority, value);
}), dequeue: (function () {
  _$jscoverage['collections/PriorityQueue.js'][34]++;
  return this.remove();
})}});
_$jscoverage['collections/PriorityQueue.js'][39]++;
module.exports = exports = PriorityQueue;
_$jscoverage['collections/PriorityQueue.js'].source = ["var define = require(\"../define\").define,","        MinHeap = require(\"./MinHeap\"),","        base = require(\"../base\");","var PriorityQueue;","","/**"," * @class PriorityQueue Implementation where the value with the highest priority moves to the front"," *        Priority starts at 0, and the greatest value being the lowest priority;"," * @augments comb.collections.MinHeap"," * @memberOf comb.collections"," */","PriorityQueue = define(MinHeap, {","    instance : {","        /**@lends comb.collections.PriorityQueue.prototype*/","","        /**","         * Adds the value with the specified priority to the queue","         *","         * @param {Number} priority the priority of the item","         *      &lt;/br&gt;","         *      &lt;b&gt;0 = Highest, n = lowest&lt;/b&gt;","         * @param value","         */","        enqueue : function(priority, value) {","            return this.insert(priority, value);","        },","","        /**","         * Removes the item with the highest priority from the queue","         *","         * @returns the value of the item","         */","        dequeue : function() {","            return this.remove();","        }","    }","});","","module.exports = exports = PriorityQueue;"];
