The PriorityQueue class

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


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.


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


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

Sinopse da classe

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

Constantes pré-definidas



add a note add a note

User Contributed Notes

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