istvan@hhb.UUCP (Istvan Mohos) (05/04/90)
The utmost conceptual simplicity of file system trees belies the
difficulty of memorizing actual nodal layouts of specific trees.
In spite a plain topological essence of TREE no two trees are
the same; and most users would have an equal chance of being able
to recall the exact twig arrangement of last year's Christmas tree
as they would in describing a 30 Meg Unix subdirectory.
Recursive listers such as 'find' obscure the tree structure by the
one-dimensionality of their output: standard output mediums of
pinfeed paper or the scrollable screen rigidly limit the width,
while allowing infinitely long lists.
The treeD file system diagrammer erases the width limitation of
the output medium, and constructs true two-dimensional maps of
file systems. To realize a hardcopy of a map, the internal diagram
is output as equal-sized pages, each page bearing a letter/number
coordinate analogous to lettered, numbered grids on a street map.
Command line options fine tune the format of the output, control
non-default grid sizes and the depth of the directory search.
C source posted today to alt.sources.
--
Istvan Mohos
...uunet!pyrdc!pyrnj!hhb!istvan
RACAL-REDAC/HHB 1000 Wyckoff Ave. Mahwah NJ 07430 201-848-8000
======================================================================