PHP - PriorityQueue Functions

PriorityQueue is very similar to the Queue. The values are pushed into the queue with an assigned priority, and the value with the highest priority can always be at the front of the queue. It is implemented by using a max heap.

Class Synopsis

Ds\PriorityQueue implements Ds\Collection {
   /* Constants */
   const int MIN_CAPACITY = 8 ;
   
   /* Methods */
   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 )
}

Predefined Constants

Ds\PriorityQueue::MIN_CAPACITY