Recursive Subdirectory Searching

Recursive subdirectory searching is the ability to specify that TeX (or any program in the TeX system) should search not only a specified directory, but recursively through all directories below that directory.

This feature is already supported by many implementations of TeX, including, but not limited to, emTeX (and its drivers), PubliC TeX, Web2C, Y&YTeX, dvips(k), xdvi(k), and DECUS TeX for VMS.

Even if your TeX implementation does not directly support subdirectory searching, you may find it useful to adopt the structure if you do not use many fonts or packages. For instance, if you only use Computer Modern and AMS fonts, you can store them in the TDS layout and list the directories individually in configuration files or environment variables.

The TWG recognizes that subdirectory searching places an extra burden on the system and may be the source of performance bottlenecks, particularly on slower machines. Nevertheless, we feel that subdirectory searching is imperative to a well-organized TDS, for the reasons stated above. Implementors are encouraged to provide extensions to the basic principle of subdirectory searching to avoid performance problems. One possible extension is the use of a ``database'' of filenames (this can be as simple as a recursive directory listing) that is consulted before directory searching begins. If a match is found in the database, subdirectory searching is not required, and performance is thus independent of the number of subdirectories present on the system.