TPointerToPointerTree class
TPointerToPointerTree is an associative array of PointerToPointer
Items, or a tree of trees.Declaration
TPointerToPointerTree = classDescription
TPointerToPointerTree is an associative array of PointerToPointer
Items, or a tree of trees. This class uses pointers to identify pointers
within the array, unlike the
TStringToStringTree, which uses
strings to identify strings.
Properties
Count | public | Count - the number of items. |
Values | public | Values - a pointer into the array of values associated with the nodes. |
Tree | public | The Tree that forms the basis of the associative array. |
Methods
Create | public | Constructor for the class instance. |
Destroy | public | Destructor for the class instance. |
Clear | public | |
ClearWithFree | public | Frees objects stored in Values. |
Equals | public | |
IsEqual | public | |
Assign | public | |
Remove | public | |
Contains | public | |
GetFirst | public | GetFirst - finds the first node matching the supplied arguments; returns True if successful. |
GetLast | public | GetLast - finds the last node matching the supplied arguments; returns True if successful. |
GetNext | public | GetNext - finds the next node matching the supplied arguments; returns True if successful. |
GetPrev | public | GetPrev - finds the previous node matching the supplied arguments; returns True if successful. |
FindByValue | public | Finds a Key by its Value using a slow linear search. |
GetEnumerator | public | |
GetEnumeratorHighToLow | public |
An experiment, built from Lazarus main 2dfa93c66e of 10-22-2026. Not the official Lazarus documentation.
