A priority queue oriented, pairing heap class

    (Available since version 1.0)

    Introduction

    This class represents the heap used in, and forming the basis of, the SEIDS::Heaps::Pairing::PriorityQueue class.

    Note:

    This class is not intended for public consumption. Most users should instead be using the SEIDS::Heaps::Pairing::PriorityQueue class itself.

    Class synopsis

    SEIDS::Heaps::Pairing::PriorityQueueHeap extends SEIDS::Heaps::Pairing::Heap {
    /* Properties */
    protected callable $callback_compare ;
    /* Inherited properties */
    protected int $size ;
    protected SEIDS::Heaps::Pairing::Subheap $subheap ;
    protected array $hasht ;
    protected int $last_tag ;
    /* Methods */
    public __construct ( callable $callback_compare )
    protected int compare ( mixed $value1 , mixed $value2 )
    protected mixed value ( SEIDS::Heaps::PriorityQueueHeapItem $value )
    /* Inherited methods */
    public int Heap::count ( void )
    public mixed Heap::current ( void )
    public bool Heap::isEmpty ( void )
    public int Heap::key ( void )
    public void Heap::next ( void )
    public void Heap::rewind ( void )
    public bool Heap::valid ( void )
    protected mixed Heap::hashtIndex ( mixed $value )
    public void Heap::__clone ( void )
    public mixed Heap::extract ( void )
    public bool Heap::insert ( mixed $value )
    public bool Heap::recoverFromCorruption ( void )
    public mixed Heap::top ( void )
    public void Heap::update ( mixed $value1 , mixed $value2 )
    protected SEIDS::Heaps::Pairing::Subheap Heap::merge ( SEIDS::Heaps::Pairing::Subheap $a , SEIDS::Heaps::Pairing::Subheap $b )
    protected void Heap::mergePairs ( SubHeap $subheap )
    protected void Heap::swapWithParent ( SubHeap $child )
    protected void Heap::siftDown ( SubHeap $subheap )
    protected void Heap::siftUp ( SubHeap $subheap )
    }

    Properties

    callback_compare

    A callback to use for the PriorityQueueHeap::compare() method.

    See Also

    Table of Contents

    To Top