PHP 8.0.0 Released!

La clase SplMinHeap

(PHP 5 >= 5.3.0, PHP 7)

Introducción

La clase SplMinHeap proporciona la funcionalidad principal de un montículo, manteniendo el mínimo en la parte superior.

Sinopsis de la Clase

SplMinHeap extends SplHeap implements Iterator , Countable {
/* Métodos */
protected compare ( mixed $value1 , mixed $value2 ) : int
/* Métodos heredados */
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
}

Tabla de contenidos

  • SplMinHeap::compare — Comparar elementos con el fin de colocarlos correctamente en el montón em la parte de arriba
add a note add a note

User Contributed Notes 1 note

up
0
gom
10 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