downloads | documentation | faq | getting help | mailing lists | licenses | wiki | reporting bugs | php.net sites | links | conferences | my php.net

search for in the

SplMinHeap::compare> <SplMaxHeap::compare
[edit] Last updated: Fri, 23 Mar 2012

view this page in

The SplMinHeap class

(PHP 5 >= 5.3.0)

Wstęp

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

Krótki opis klasy

SplMinHeap extends SplHeap implements Iterator , Countable {
/* Metody */
int compare ( mixed $value1 , mixed $value2 )
/* Metody dziedziczone */
abstract int 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 )
}

Spis treści

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


add a note add a note User Contributed Notes SplMinHeap
There are no user contributed notes for this page.

 
show source | credits | stats | sitemap | contact | advertising | mirror sites