A binary max-heap class

(Available since version 1.0)

Introduction

This class provides the main functionalities of a heap, keeping the maximum on the top. The underlying implementation is a binary heap.

It provides the same interface as SplMaxHeap with the extra methods, Heap::extractInsert() and Heap::update() which allows one to update a node in the heap.

Class synopsis

SEIDS::Heaps::Binary::MaxHeap extends SEIDS::Heaps::Binary::Heap {

/* Inherited properties */

protected int $size ;

protected array $btree ;

protected array $hasht ;

protected int $last_tag ;

/* Methods */

protected int compare ( mixed $value1 , mixed $value2 )

/* Inherited methods */

public Heap::__construct ([ array $array ] )

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::value ( mixed $value )

protected mixed Heap::hashtIndex ( mixed $value )

public mixed Heap::extract ( void )

public mixed Heap::extractInsert ( mixed $value )

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 int Heap::parentIndex ( int $index )

protected int Heap::childOneIndex ( int $index )

protected int Heap::childTwoIndex ( int $index )

protected void Heap::swap ( int $a , int $b )

protected void Heap::siftDown ( int $index )

protected void Heap::siftUp ( int $index )

}

A binary max-heap class

Introduction

Class synopsis

See Also

Table of Contents