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;
ExtendsRemoves the item with the highest priority from the queue
Returnsthe value of the item
function (){
return this.remove();
}
Adds the value with the specified priority to the queue
Argumentsthe priority of the item 0 = Highest, n = lowest
function (priority,value){
return this.insert(priority, value);
}
MIT https://github.com/C2FO/comb/raw/master/LICENSE
git clone git://github.com/C2FO/comb.git