PHP 8.0.0 Beta 4 available for testing

The SplMinHeap class

(PHP 5 >= 5.3.0, PHP 7)

Introducere

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

Sinopsisul clasei

SplMinHeap extends SplHeap implements Iterator , Countable {
/* Metode */
protected compare ( mixed $value1 , mixed $value2 ) : int
/* Metode moștenite */
abstract protected SplHeap::compare ( mixed $value1 , mixed $value2 ) : int
public SplHeap::count ( void ) : int
public SplHeap::current ( void ) : mixed
public SplHeap::extract ( void ) : mixed
public SplHeap::insert ( mixed $value ) : void
public SplHeap::isCorrupted ( void ) : bool
public SplHeap::isEmpty ( void ) : bool
public SplHeap::key ( void ) : mixed
public SplHeap::next ( void ) : void
public SplHeap::recoverFromCorruption ( void ) : void
public SplHeap::rewind ( void ) : void
public SplHeap::top ( void ) : mixed
public SplHeap::valid ( void ) : bool
}

Cuprins

  • 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 1 note

up
0
gom
7 months ago
I experimented what happens when arrays are inserted:

<?php
$heap
= new SplMinHeap();
$heap->insert([22,333]);
$heap->insert([2,33]);
$heap->insert([222,3]);

var_export($heap->extract());
echo
'<br>';
var_export($heap->extract());
echo
'<br>';
var_export($heap->extract());
?>

Output:

array ( 0 => 2, 1 => 33, )
array ( 0 => 22, 1 => 333, )
array ( 0 => 222, 1 => 3, )
To Top