Implements an ordered tree of resources
uses |
||
System, |
||
|
Contains base classes for resource handling |
This unit implements classes that represent an ordered tree of resources.
Such a tree is used internally by TResources to speed up operations, and by certain resource readers and writers that deal with resource formats where data is stored as ordered trees of resources. For this reason, only implementors of resource readers and writers should be interested in these classes.
A tree begins with a root node, which is an instance of TRootResTreeNode. The root node contains type nodes, that contain name nodes, that contain language id nodes. Finally, a language id node contains a resource.
Each node contains its sub nodes in two lists: a Named list for nodes identified by a name (a string), and an ID list for nodes identified by an ID (an integer). In each list, nodes are sorted in ascending order.
Many resource formats (PECOFF, ELF, Mach-O, and external resource files) use this exact format to store resource information.
| Remark: | When a tree is destroyed, the resources it references aren't destroyed. |