RiverSoftAVG Products Help

Create(THeapElementClass)

Overloaded. Creates and initializes the heap. The ElementClass parameter specifies the THeapElement class to create for every node in the heap. (Inherited from DataStructures.TCustomHeap.)

Create(TRSObjectOrderedListClass)

Creates the priority list.

The OrderedListClass dfines the class to maintain the list of items with the same priority in the list.

Destroy

Represents the destructor of the TPriorityList class. (Overrides DataStructures.TCustomHeap.Destroy.)

Count

Returns the number of items in the heap (Inherited from DataStructures.TCustomHeap.)

ElementClass

Specifies the heap element class to create for every node in the heap. (Inherited from DataStructures.TCustomHeap.)

Element[Integer]

Returns the heap element at the specified position (Inherited from DataStructures.TCustomHeap.)

FreeIfNoPop

Represents property FreeIfNoPop.

Heap

Stores the nodes that make up the heap (Inherited from DataStructures.TCustomHeap.)

Item[Integer]

Returns the item in the heap at the specified position. (Inherited from DataStructures.TCustomHeap.)

LastIndex

Represents property LastIndex.

LastList

Represents property LastList.

LastListIndex

Represents property LastListIndex.

Order

Specifies the order of items in the heap. (Inherited from DataStructures.TCustomHeap.)

OrderedListClass

Defines the class to maintain the list of items with the same priority in the heap

Add(TObject,Integer)

Adds the item to the heap with the specified priority.

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 Priority and     Order) than any of its parents.

Assign(TPersistent)

Represents method Assign(TPersistent). (Overrides DataStructures.TCustomHeap.Assign(TPersistent).)

Clear

Clears or empties the heap. (Overrides DataStructures.TCustomHeap.Clear.)

Delete(Integer)

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(THeapElement)

Overloaded. Deletes the heap element from the heap. The item at the specified node is returned.
 (Inherited from DataStructures.TCustomHeap.)

GetCount

Returns the number of items in the heap (Overrides DataStructures.TCustomHeap.GetCount.)

GetItem(Integer)

Returns the item in the heap at the specified position. (Overrides DataStructures.TIntHeap.GetItem(Integer).)

IndexOf(Integer)

Overloaded. Returns the index of the element in the heap that matches the specified priority. If no element has that priority, the function returns -1. (Inherited from DataStructures.TIntHeap.)

IndexOf(THeapElement)

Overloaded. Returns the index of the node in the heap. (Inherited from DataStructures.TCustomHeap.)

IndexOf(TObject)

Overloaded. Returns the index of the element in the heap that matches the specified item (with an assumed priority of 0). If they are not found, the function returns -1. (Overrides DataStructures.TCustomHeap.IndexOf(TObject).)

IndexOf(TObject,Integer)

Overloaded. Returns the index of the element in the heap that matches the specified item and priority. If they are not found, the function returns -1. (Inherited from DataStructures.TIntHeap.)

ModifyPriority(THeapElement)

Overloaded. Modifies the priority the heap element in the heap. The index of the element is returned. (Overrides DataStructures.TCustomHeap.ModifyPriority(THeapElement).)

ModifyPriority(THeapElement,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.TIntHeap.)

PushDown(Integer)

Push the Parent down the tree if it is smaller (according to     Order) than one of its children

The DataStructures.TCustomHeap.PushUp(Integer) and DataStructures.TCustomHeap.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.TCustomHeap.PushUp(Integer) and DataStructures.TCustomHeap.PushDown(Integer) methods maintain the sort order of the heap.

SetItem(Integer,TObject)

Represents method SetItem(Integer,TObject).

SetOrder(THeapOrder)

Represents method SetOrder(THeapOrder). (Inherited from DataStructures.TCustomHeap.)