 |
|
|
|
|
 | Down-tree traversal requires that you start at the root project (aaaaaaaa),
open the '.a' file to find the current extension of the data file,
open that, search the child records in the data file for the required file,
and then repeat the process. |
| If a child project record is marked as 'deleted' then that project and
the projects and files below it are logically deleted. They exist
physically in the tree until they are purged. |
| Because files and projects below the 'logical' delete point are not
individually marked as such, it is necessary to traverse back up tree to the root
to find out if any parent has been logically deleted to determine
if a file is active or deleted |
| Up-Tree traversal requires that you use the parent project reference to
open that file and so on back to the root. |
| If the file is shared there nay be more than one parent project reference
and thus more than one path back to the root |
|
|
|
