PriorityQueue |
A priority queue to manage prioritized data. The implementation is based on the heap structure.
| PriorityQueue | A priority queue to manage prioritized data. |
| Functions and Properties | |
| PriorityQueue | Initializes a priority queue with a given size. |
| front | The front item or null if the heap is empty. |
| maxSize | The maximum capacity. |
| enqueue | Enqueues a prioritized item. |
| dequeue | Dequeues and returns the front item. |
| reprioritize | Reprioritizes an item. |
| remove | Removes an item. |
| contains | @inheritDoc |
| clear | @inheritDoc |
| getIterator | @inheritDoc |
| size | @inheritDoc |
| isEmpty | @inheritDoc |
| toArray | @inheritDoc |
| toString | Prints out a string representing the current object. |
| dump | Prints all elements (for debug/demo purposes only). |
Initializes a priority queue with a given size.
public function PriorityQueue( size: int )
The front item or null if the heap is empty.
public function get front():Prioritizable
The maximum capacity.
public function get maxSize():int
Enqueues a prioritized item.
public function enqueue( obj: Prioritizable ):Boolean
Dequeues and returns the front item.
public function dequeue():Prioritizable
Reprioritizes an item.
public function reprioritize( obj: Prioritizable, newPriority: int ):Boolean
Removes an item.
public function remove( obj: Prioritizable ):Boolean
@inheritDoc
public function contains( obj: * ):Boolean
@inheritDoc
public function clear():void
@inheritDoc
public function getIterator():Iterator
@inheritDoc
public function get size():int
@inheritDoc
public function isEmpty():Boolean
@inheritDoc
public function toArray():Array
Prints out a string representing the current object.
public function toString():String
Prints all elements (for debug/demo purposes only).
public function dump():String