Submit a Pull Request Report a Bug

    The SplMaxHeap class

    (PHP 5 >= 5.3.0, PHP 7)

    Wstęp

    The SplMaxHeap class provides the main functionalities of a heap, keeping the maximum on the top.

    Krótki opis klasy

    SplMaxHeap extends SplHeap implements Iterator , Countable {
    /* Metody */
    protected compare ( mixed $value1 , mixed $value2 ) : int
    /* Metody dziedziczone */
    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
    }

    Spis treści

    • SplMaxHeap::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
    -4
    MuLoT [ojousset49 at yahoo dot fr]
    13 years ago
    SplMaxHeap simple example with integer values...

    <?php
    class MySimpleHeap extends SplHeap
    {
        public function  compare( $value1, $value2 ) {
            return ( $value1 - $value2 );
        }
    }

    $obj = new MySimpleHeap();
    $obj->insert( 4 );
    $obj->insert( 8 );
    $obj->insert( 1 );
    $obj->insert( 0 );

    foreach( $obj as $number ) {
        echo $number.\"\\n\";
    }

    /*
        Output display :
        8
        4
        1
        0
    */
    ?>
    add a note add a note
    To Top