Edit Report a Bug

    The SplMinHeap class

    (PHP 5 >= 5.3.0, PHP 7)

    소개

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

    클래스 개요

    SplMinHeap extends SplHeap implements Iterator , Countable {
    /* 메소드 */
    protected int compare ( mixed $value1 , mixed $value2 )
    /* 상속된 메소드 */
    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 )
    }

    Table of Contents

    • 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
    1
    gom
    4 years 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, )
    add a note add a note
    To Top