The SplMinHeap class

(PHP 5 >= 5.3.0)

Introduction

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

Class synopsis

SplMinHeap extends SplHeap implements Iterator , Countable {

/* Methods */

protected int compare ( mixed $value1 , mixed $value2 )

/* Inherited methods */

abstract protected int SplHeap::compare ( mixed $value1 , mixed $value2 )

public int SplHeap::count ( void )

public mixed SplHeap::current ( void )

public mixed SplHeap::extract ( void )

public void SplHeap::insert ( mixed $value )

public bool SplHeap::isEmpty ( void )

public mixed SplHeap::key ( void )

public void SplHeap::next ( void )

public void SplHeap::recoverFromCorruption ( void )

public void SplHeap::rewind ( void )

public mixed SplHeap::top ( void )

public bool SplHeap::valid ( void )

}

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

Коментарии

Jan 27

Автор: gom


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, )