|ADF||The initialism (acronym) for Advanced Data Format.|
|Child||One of the subnodes of a Parent. A child node does not have knowledge of its parent node. The user must keep track of this relationship.|
|Database||A hierarchy of ADF nodes. By use of links, it may physically span multiple files.|
|File||An ADF file, which a single root node and its underlying structure.|
|ID||A unique identifier to access a given node within a file. This 8-byte field contains sufficient information for ADF to locate the node within a file. For any given node, the ID is generated only after the file it resides in has been opened by a program and the user requests information about the node. The ID is valid only within the program that opened the file and while that file is open. If the file is closed and reopened, the ID for any given node will be different. Within different programs, the node-ID for the same node will be different. The ID is never actually written into a file.|
|Link-Node||A special type of node.
Links are created using the
The data type of this node is LK, and its data is a
one-dimensional array containing the name of the file (if other
than the current file) containing the node to be linked and the
full path name in that file from the root node to the desired
Links provide a mechanism for referring to a node that physically resides in a different part of the hierarchy. The node pointed to by a link may or may not reside in the same file as the link itself. A link within ADF is very similar to a "soft" link in the UNIX operating system in that it does not guarantee that the referenced node exists. ADF will "resolve" the link only when information is requested about the node. If the ID of a link-node is used in an ADF call, the effect of the call is the same as if the ID of the linked-to node was used. Note that a link node does not have children itself. In the example database figure, the children seen for L3 are F4 and F5. If a child is "added" to L3, then in reality, the child is added to F3. There are specialized subroutines provided to create link nodes and extract the link details.
|Node||The single component used to construct an ADF database.|
|Node name||A node has a 32-character name. Every child node directly under a given parent must have a unique name. Legal characteristics in a name are A-Z, a-z, 0-9, and special characters (ASCII values from 32 to 126, omitting the forward slash "/", ASCII number 47). Names will be blank filled to 32 bytes; they are case sensitive. Leading blanks are discarded and trailing blanks are ignored, whereas internal blanks are significant.|
|Parent||A node that has subnodes directly associated with it.|
|Pathname||Within a database, nodes can be referenced using the name of a node
along with its parent ID, or by using a "pathname" whose syntax is
roughly the same as a path name in the UNIX environment.
A pathname that begins with a leading slash "/" is
assumed to begin at the root node of the file.
If no leading slash is given, the name is assumed to begin at the
node specified by the parent ID.
Although there is a 32-character limitation on the node Name,
there is no restriction on the length of the pathname.
For example, equivalent ways to refer to node N8 in the
hierarchy in the example
database figure are: