1
--HWXREF---------------------------------------------------------------------

  HWXREF <starting file> <resulting filename> </p=filename>

        <starting file>        your starting HyperWIN file.
        <resulting filename>   is where the xref will be created
        </p=replacement for hwpath.pth>

  Output (in <resulting filename>) is:

  <link A name>
     <node1 who references it> [filename of this node]
     <node2 who references it> [filename of this node]
     <node3 who references it> [filename of this node]
  <link B name>
     <node4 who references it> [filename of this node]
     <node5 who references it> [filename of this node]
     <node6 who references it> [filename of this node]

--HWINDEX--------------------------------------------------------------------

  This program scans HyperWIN files looking for nodes that do not
  have the ;file() tag in them. It then produces a list of these
  in the form of a sorted index file.

  If you are using this to process multiple subdirectories in a single
  execution, then you need to have HWPATH.PTH setup. See HyperWIN User
  Guide for instructions. Also put this program (HWINDEX.EXE) in the same
  subdirectory where HWPATH.PTH is.

  Format is

  HWINDEX <starting file> <resulting filename> </po> </p=filename>

          </po> = option to produce list of procedural nodes only
                  procedure nodes are identified by the ;ProcNode() tag
          </p=replacement for hwpath.pth>
          <resulting filename> is where the index will be created

--HWTREE---------------------------------------------------------------------

 This builds the HyperWIN tree file

 Format is

 HWTREE <starting file> <resulting filename> </p=filename>

        </p=replacement for hwpath.pth>
        <resulting filename> is where the tree file will be created

 this program scans the HyperWIN files and builds a file like:

  0 node A
    1 node B
      2 node E
       3 node G
      2 node F
       3 node H
       3 node I
    1 node C
    1 node D
      *2 node E
      *2 node F
    *1 node E
    *1 node F

  * - means they have already been process prior...this is so we
      we don't get into recursive loops where A -> B -> C -> A
      and we expand it continuously


 The tree is build in a depth-first-search order of the HyperWIN tree
   (letters represent nodes)


                                A
                        /     /  \     \   \
                       B     C   D     E   F
                      / \       / \
                     E  F       E F
                     |  |\
                     G  H I

--BSF------------------------------------------------------------------------

 Build Secondary File

 this program has two inputs
      1- a filename which contains a list a directories to process
      2- the output file name

   the files in each directory listed are scanned for HyperWIN nodes

   the resulting file (output file) is in the form
      ;file(node name) filename
      ;file(node name) filename

 This program produces the HyperWIN secondary lookup file

 Format:

 BSF <In filename> <Out filename>
    where <In filename> is a file which lists the directories
                     this program is to process
                     suggestion is HWPATH.PTH
    where <Out filename> is the OutPut File
