|
Add(IInterface)
|
Adds the item to the heap.
When an item is added to the heap. It is pushed up from the bottom of the heap (the tree) until it is not bigger (according to Order) than any of its parents.
|
|
Assign(TPersistent)
|
Represents method Assign(TPersistent). (Inherited from DataStructures.TIHeap.)
|
|
Clear
|
Clears or empties the heap. (Inherited from DataStructures.TIHeap.)
|
|
Delete(Integer)
|
Overloaded. Deletes the node or heap element at the specified index in the heap. The item at the specified node is returned.
If the item to delete is the last one, delete it and shrink the tree, the tree will still be a heap. Otherwise, delete replace the item with the lowest, rightmost item in the heap and "reheapify".
|
|
Delete(TIHeapElement)
|
Overloaded. Deletes the heap element from the heap. The item at the specified node is returned. (Inherited from DataStructures.TIHeap.)
|
|
GetCount
|
Returns the number of items in the heap (Inherited from DataStructures.TIHeap.)
|
|
GetItem(Integer)
|
Returns the item in the heap at the specified position. (Inherited from DataStructures.TIHeap.)
|
|
IndexOf(IInterface)
|
Overloaded. Finds an item in the heap and returns its index in the heap.
The heap is assumed to be sorted .
|
|
IndexOf(TIHeapElement)
|
Overloaded. Returns the index of the node in the heap (Inherited from DataStructures.TIHeap.)
|
|
ModifyPriority(Integer)
|
Overloaded. Modifies the priority the heap element at the specified index position in the heap. The new index of the element is returned. (Inherited from DataStructures.TIHeap.)
|
|
ModifyPriority(TIHeapElement)
|
Overloaded. Modifies the priority the heap element in the heap. The index of the element is returned. (Inherited from DataStructures.TIHeap.)
|
|
Peek
|
Returns the object at the front of the queue. Call Peek to access the queue without removing an item. Peek returns the next item in the queue.
To remove an item from the queue, call DataStructures.TIPriorityQueue.Pop.
|
|
Pop
|
Removes and returns the item at the front of the queue. Call Pop to retrieve an item from the queue. Pop removes the next item from the queue (that is, the next item based on priority and sort order), then returns the interface of the deleted item.
To access the queue without removing an item, call DataStructures.TIPriorityQueue.Peek .
|
|
Push(IInterface)
|
Adds an item to the queue. Call Push to add an item to the queue.
To retrieve items added with Push, call DataStructures.TIPriorityQueue.Pop or DataStructures.TIPriorityQueue.Peek .
|
|
PushDown(Integer)
|
Push the Parent down the tree if it is smaller (according to Order) than one of its children
The DataStructures.TIHeap.PushUp(Integer) and DataStructures.TIHeap.PushDown(Integer) methods maintain the sort order of the heap. These methods are O(n) in efficiency.
|
|
PushUp(Integer)
|
Push the last value up the tree until it is not bigger (according to Order) than any of its parents.
The DataStructures.TIHeap.PushUp(Integer) and DataStructures.TIHeap.PushDown(Integer) methods maintain the sort order of the heap.
|
|
SetOrder(THeapOrder)
|
Represents method SetOrder(THeapOrder). (Inherited from DataStructures.TIHeap.)
|
