| Class TIntHeap (unit EZIntQue) |
TObject
A priority queue for storing longints
| Constructors |
constructor Create(Ascending : boolean);| Functions |
procedure Add(const Value : longint);--------
function Count : longint;--------
destructor Destroy;--------
function IsEmpty : boolean;--------
function Pop : longint;--------
| Properties |
| Events |
| Variables |
Queue : TPriorityQueue;| Constructors |
constructor Create(Ascending : boolean);===TIntMaxHeap implementation=========================================
| Functions |
procedure Add(const Value : longint);-Return the longint at the front of the queue after popping it
--------
function Count : longint;-Destroy the queue
--------
destructor Destroy;-Initialise the queue for Ascending order
--------
function IsEmpty : boolean;-Return the number of longints in the queue
--------
function Pop : longint;-Return true if the queue is empty
--------
| Properties |
| Events |
| Variables |
Queue : TPriorityQueue;