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.

Krótki opis klasy

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

Stałe predefiniowane


Spis treści

add a note add a note

User Contributed Notes

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