The SplMinHeap class

(PHP 5 >= 5.3.0, PHP 7, PHP 8)

简介

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

类摘要

SplMinHeap extends SplHeap implements Iterator , Countable {

/* 方法 */

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

/* 继承的方法 */

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

public SplHeap::count ( ) : int

public SplHeap::current ( ) : mixed

public SplHeap::extract ( ) : mixed

public SplHeap::insert ( mixed $value ) : bool

public SplHeap::isCorrupted ( ) : bool

public SplHeap::isEmpty ( ) : bool

public SplHeap::key ( ) : int

public SplHeap::next ( ) : void

public SplHeap::recoverFromCorruption ( ) : bool

public SplHeap::rewind ( ) : void

public SplHeap::top ( ) : mixed

public SplHeap::valid ( ) : bool

}

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

User Contributed Notes

gom 27-Jan-2020 07:12


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

The SplMinHeap class

简介

类摘要

Table of Contents

User Contributed Notes