Class TmwDList (unit mwDList) |
Inherits from
TComponent
constructor Create(AOwner:TComponent);
- Create the list with default values
Procedure Delete(aNode: PNode);
Delete a given node
Procedure DeleteEmptyNodes;
Delete empty nodes
destructor Destroy;
Destroy the whole list, node by node
Procedure Find(item: String);
Look for a item in the list.
Function GetData : string;
Retrive data of current node.
Procedure InsertBefore(item: String);
Insert before current node, make new node current
Procedure InsertBehind(item: String);
Insert behind current node, make new node current
Procedure InsertFirst(item: String);
Insert as first node, make new node current
Procedure InsertLast(item: String);
insert Node after current item, make newNode current
Procedure LoadFromFile(FileName: String);
Load the list from file
Procedure MoveFirst;
make first value in list current
Procedure MoveLast;
make last value in list current
Procedure MoveNext;
make next value in list current
Procedure MovePrevious;
make previous value in list current
Procedure SaveToFile(FileName: String);
Save the list to file
Procedure Sort;
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~} { Start sorting
Function CompareFunction(a, b: PNode):Integer;
Compare the data of two nodes
Function CreateNode(n, p:PNode; item:String):PNode;
Create a node with given values
Procedure Merge(a, b: PNode);
Merge the sublists a and b
Procedure MergeSort;
Main sorting routine
Procedure PlaceBefore(a, b, c: PNode);
Place c before a
property IgnoreCase : boolean
property Name :
property Reversed : boolean
property Sorted : boolean
property Tag :
property Size : integer
a_count : Integer;
bottom : PNode;
Head and Bottom are pseude Nodes, they don't contain any Data.
b_count : Integer;
current : PNode;
They make it much easier to manage the list.
FIgnore : boolean;
FReversed : boolean;
FSize : Integer;
FSorted : boolean;
head : PNode;
Node : PNode;
todoA : PNode;
todoB : PNode;
constructor Create(AOwner:TComponent);
Create the list with default values
Procedure Delete(aNode: PNode);
Delete a given node
Procedure DeleteEmptyNodes;
Delete empty nodes
destructor Destroy;
Destroy the whole list, node by node
Procedure Find(item: String);
Look for a item in the list. Starts at head node.
Function GetData : string;
Retrive data of current node.
Procedure InsertBefore(item: String);
Insert before current node, make new node current
Procedure InsertBehind(item: String);
Insert behind current node, make new node current
Procedure InsertFirst(item: String);
Insert as first node, make new node current
Procedure InsertLast(item: String);
insert Node after current item, make newNode current
Procedure LoadFromFile(FileName: String);
Load the list from file
Procedure MoveFirst;
make first value in list current
Procedure MoveLast;
make last value in list current
Procedure MoveNext;
make next value in list current
Procedure MovePrevious;
make previous value in list current
Procedure SaveToFile(FileName: String);
Save the list to file
Procedure Sort;
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~} { Start sorting
Function CompareFunction(a, b: PNode):Integer;
Compare the data of two nodes
Function CreateNode(n, p:PNode; item:String):PNode;
Create a node with given values
Procedure Merge(a, b: PNode);
Merge the sublists a and b
Procedure MergeSort;
Main sorting routine
Procedure PlaceBefore(a, b, c: PNode);
Place c before a
property IgnoreCase : boolean
property Name :
property Reversed : boolean
property Sorted : boolean
property Tag :
property Size : integer
a_count : Integer;
bottom : PNode;
Head and Bottom are pseude Nodes, they don't contain any Data.
b_count : Integer;
current : PNode;
They make it much easier to manage the list.
FIgnore : boolean;
FReversed : boolean;
FSize : Integer;
FSorted : boolean;
head : PNode;
Node : PNode;
todoA : PNode;
todoB : PNode;