Class Index | File Index

Classes


Class comb.collections.PriorityQueue


Extends comb.collections.MinHeap.
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;
Defined in: PriorityQueue.js.

Class Summary
Constructor Attributes Constructor Name and Description
 
Fields borrowed from class comb.collections.Heap:
count, isEmpty, keys, values
Method Summary
Method Attributes Method Name and Description
 
Removes the item with the highest priority from the queue
 
enqueue(priority, value)
Adds the value with the specified priority to the queue
Methods borrowed from class comb.collections.Heap:
clear, containsKey, containsValue, insert, peek, peekKey, print, remove
Methods borrowed from class comb.collections.Collection:
concat, indexOf, join, lastIndexOf, slice, toString
Class Detail
comb.collections.PriorityQueue()
Method Detail
dequeue()
Removes the item with the highest priority from the queue
Returns:
the value of the item

enqueue(priority, value)
Adds the value with the specified priority to the queue
Parameters:
{Number} priority
the priority of the item
0 = Highest, n = lowest
value

Documentation generated by JsDoc Toolkit 2.4.0 on Fri Nov 18 2011 01:10:52 GMT-0600 (CST)