The SplMinHeap class

Introducere

The SplMinHeap class provides the main functionalities of a heap, keeping the minimum on the top.

SplMinHeap

class SplMinHeap extends SplHeap implements Iterator , Countable {

/* Methods */

void compare ( mixed $value1 , mixed $value2 )

/* Inherited methods */

abstractint SplHeap::compare ( mixed $value1 , mixed $value2 )

int SplHeap::count ( void )

mixed SplHeap::current ( void )

mixed SplHeap::extract ( void )

void SplHeap::insert ( mixed $value )

bool SplHeap::isEmpty ( void )

mixed SplHeap::key ( void )

void SplHeap::next ( void )

void SplHeap::recoverFromCorruption ( void )

void SplHeap::rewind ( void )

mixed SplHeap::top ( void )

bool SplHeap::valid ( void )

}

SplMinHeap::compare — Compare elements in order to place them correctly in the heap while sifting up.

add a note User Contributed Notes
SplMinHeap

There are no user contributed notes for this page.

Last updated: Fri, 01 Aug 2008