Submit a Pull Request Report a Bug

    la clase SplMaxHeap

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

    Introducción

    La clase SplMaxHeap proporciona la funcionalidad principal de un montículo, manteniendo el máximo en la parte superior.

    Sinopsis de la Clase

    SplMaxHeap extends SplHeap implements Iterator , Countable {
    /* Métodos */
    protected compare(mixed $value1, mixed $value2): int
    /* Métodos heredados */
    abstract 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): void
    public SplHeap::isCorrupted(): bool
    public SplHeap::isEmpty(): bool
    public SplHeap::key(): mixed
    public SplHeap::next(): void
    public SplHeap::recoverFromCorruption(): void
    public SplHeap::rewind(): void
    public SplHeap::top(): mixed
    public SplHeap::valid(): bool
    }

    Tabla de contenidos

    • SplMaxHeap::compare — Compara elementos con el fin de colocarlos correctamente en el montón en la parte de arriba
    add a note add a note

    User Contributed Notes 1 note

    up
    1
    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