The SplPriorityQueue class

Introduction

The SplPriorityQueue class provides the main functionalities of an prioritized queue, implemented using a heap.

Class synopsis

SplPriorityQueue

SplPriorityQueue implements Iterator , Countable {

/* Methods */

SplPriorityQueue::__construct ( void )

void SplPriorityQueue::compare ( mixed $priority1 , mixed $priority1 )

int SplPriorityQueue::count ( void )

mixed SplPriorityQueue::current ( void )

mixed SplPriorityQueue::extract ( void )

void SplPriorityQueue::insert ( mixed $value , mixed $priority )

bool SplPriorityQueue::isEmpty ( void )

mixed SplPriorityQueue::key ( void )

void SplPriorityQueue::next ( void )

void SplPriorityQueue::recoverFromCorruption ( void )

void SplPriorityQueue::rewind ( void )

void SplPriorityQueue::setExtractFlags ( int $flags )

mixed SplPriorityQueue::top ( void )

bool SplPriorityQueue::valid ( void )

}