The SplMinHeap class

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

    Introduction

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

    Class synopsis

    class SplMinHeap extends SplHeap {
    /* Methods */
    protected compare(mixed $value1, mixed $value2): int
    /* Inherited methods */
    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): true
    public SplHeap::isCorrupted(): bool
    public SplHeap::isEmpty(): bool
    public SplHeap::key(): int
    public SplHeap::next(): void
    public SplHeap::recoverFromCorruption(): true
    public SplHeap::rewind(): void
    public SplHeap::top(): mixed
    public SplHeap::valid(): bool
    }

    Table of Contents

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

    Found A Problem?

    Learn How To Improve This Page • Submit a Pull Request • Report a Bug
    ＋add a note

    User Contributed Notes 1 note

    up
    3
    gom
    5 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
    To Top