RiverSoftAVG Products Help

Zoom Window Out
Larger Text | Smaller Text
Hide Page Header
Show Expanding Text
Printable Version
Send Mail Feedback
Save Permalink URL

Navigation: Code Documentation > RSCommon

GLists Namespace

Defines linked list classes including a priority list. Also defines some stacks and queues.

Note
Unless you are specifically looking for linked lists, you might want to use the stack and queues from the DataStructures.pas unit. The priority queues in DataStructures are much more efficient.

Name

Description

public class

TFreeList

Defines a TList replacement which will free its elements.

Note
This class is deprecated. Use a TObjectList instead.

public class

TGCustomLinkedList

Provides a base linked list class from which to derive all other types of linked lists (doubly linked lists, stacks, and queues).

All structures will have the advantage of being persistent, easily extendable, and assignment compatible. However, the TGCustomLinkedList is slower than a TList because it creates objects for every node.

Note
This class uses TPersistents instead of records for the nodes because of expandability, readability, and power. The performance hit is small (<3%).

public class

TGCustomLinkedListEnumerator

Defines an enumerator class for iterating over a linked list.

public class

TGDoublyLinkedList

Defines a doubly linked list (Previous link as well as Next).

The TGDoublyLinkedList class extends the TGLinkedList class to make it doubly linked.

public class

TGLinkedList

Defines a linked list class where every node in the list has an associated Item object.

public class

TGPriorityQueue

Defines a queue or FIFO (First In, First Out) list of objects sorted by priority.

Tip
This implementation is inefficient, use TPriorityQueue from DataStructures.pas instead

public class

TGPriorityStringQueue

Defines a queue or FIFO (First In, First Out) list of strings and objects sorted by priority.

Tip
This implementation is inefficient, use TPriorityQueue from DataStructures.pas instead

public class

TGQueue

TGQueue maintains a first-in first-out array, or queue, of objects. Use a TGQueue object to store and maintain a first-in first-out list.

To use the class properly as a queue, use the GLists.TGQueue.Push(TObject) and GLists.TGQueue.Pop methods, not Add or Items.

Note
The TGQueue manages the nodes of the list and will ensure nodes get freed.

public class

TGStack

Maintains a last-in first-out (LIFO) array, or stack, of objects.

Use a TGStack object to store and maintain a last-in first-out list. The TGStack object descends from GLists.TGQueue class.

Note
The TGStack manages the nodes of the list and will ensure nodes get freed.

public class

TGStringQueue

TGStringQueue maintains a first-in first-out array, or queue, of objects and associated strings. Use a TGStringQueue object to store and maintain a first-in first-out list.

The TGStringQueue allows you to push onto the queue only a string, only an object, or both. To use the class properly as a queue, use the Push, GLists.TGStringQueue.PushString(String), GLists.TGStringQueue.PushItem(String,TObject) and GLists.TGStringQueue.PopItem(TObject) methods, not Add or Items.

Note
The TGStringQueue manages the nodes of the list and will ensure nodes get freed.

Note
The TGStringQueue is assignment compatible with a TStrings object.

public class

TGStringStack

Maintains a last-in first-out (LIFO) array, or stack, of strings and objects.

Use a TGStringStack object to store and maintain a last-in first-out list. The TGStringStack object descends from GLists.TGStringQueue class.

Note
The TGStringStack manages the nodes of the list and will ensure nodes get freed.

public class

TQOrderedList

Defines a base class for an ordered list based on TList.

public class

TQQueue

TQQueue maintains a first-in first-out array, or queue, of items. Use a TQQueue object to store and maintain a first-in first-out list.

To use the class properly as a queue, use the GLists.TQQueue.Push(TRSPointerType) and GLists.TQQueue.Pop methods, not Add or Items.

public class

TQStack

Maintains a last-in first-out (LIFO) array, or stack, of items.

Use a TQStack object to store and maintain a last-in first-out list. The TQStack object descends from GLists.TQQueue class.

public class

TQStringQueue

TQStringQueue maintains a first-in first-out array, or queue, of string and object items. Use a TQStringQueue object to store and maintain a first-in first-out list.

To use the class properly as a queue, use the GLists.TQStringQueue.Push(TObject) and GLists.TQStringQueue.Pop methods, not Add or AddObject.

public class

TQStringStack

Maintains a last-in first-out (LIFO) array, or stack, of strings and objects.

Use a TQStringStack object to store and maintain a last-in first-out list. The TQStringStack object descends from GLists.TQStringQueue class.

Note
The TQStringStack manages the nodes of the list and will ensure nodes get freed.

public class

TSQDoubleNode

Defines the Nodes for a doubly linked list (i.e., it points to the previous node as well as the next node)

public class

TSQNode

Defines the Nodes for a linked list

Notes to Implementers
This class is the base class for nodes in the GLists.TGCustomLinkedList class.

public class

TSQPriorityNode

Defines the Nodes for a queue which are sorted according to a GLists.TSQPriorityNode.Priority .

Note
A lower value for priority is a higher priority.

public class

TSQPriorityStringNode

Defines the Nodes for a queue which are sorted according to a GLists.TSQPriorityStringNode.Priority and each node has an associated string.

Note
A lower value for priority is a higher priority.

public class

TSQStringNode

Defines the Nodes for a linked list with an associated string for each node

Top

	Name	Description
	SAssignError	'Error assigning %s to %s'
	SEndOfList	'End of list'
	SInvalidIndex	'Invalid Index'
	SListEmpty	'List is empty'
	SNotSortable	'Cannot sort stack or queue'
	SUnknownNode	'Cannot find node within list'

Top

RiverSoftAVG Products Help

Reference