The PriorityQueue class

(No version information available, might only be in Git)

Einführung

A PriorityQueue is very similar to a Queue. Values are pushed into the queue with an assigned priority, and the value with the highest priority will always be at the front of the queue.

Implemented using a max heap.

Hinweis:

"First in, first out" ordering is preserved for values with the same priority.

Hinweis:

Iterating over a PriorityQueue is destructive, equivalent to successive pop operations until the queue is empty.

Klassenbeschreibung

Ds\PriorityQueue implements Ds\Collection {
/* Constants */
const int MIN_CAPACITY = 8 ;
/* Methoden */
public void allocate ( int $capacity )
public int capacity ( void )
public void clear ( void )
public Ds\PriorityQueue copy ( void )
public bool isEmpty ( void )
public mixed peek ( void )
public mixed pop ( void )
public void push ( mixed $value , int $priority )
public array toArray ( void )
}

Vordefinierte Konstanten

Ds\PriorityQueue::MIN_CAPACITY

Inhaltsverzeichnis

add a note add a note

User Contributed Notes

There are no user contributed notes for this page.
To Top