>    I am trying to gather the file information about certain files on the
> A drive.  They may exist on different subdirectories, and I'd like to
> identify the files I find with their full paths (A:\filename,
> A:\subdir1\filename, a:\subdir2\filename, etc.).  I am able to _find_ all
> the files (using a recursive Find* routine I found here last month), but
> Find* only returns the filename and no more.  This routine constructs and
> lists the full path, but I'd like to be able to store and sort the full
> pathnames before I display the ones I find.
>    It appears that I must "construct" a string with all the information I
> want and store that in an array for sorting/listing.  I'd like to avoid
> this, if possible, because I could have (up to) 200+ such files (and data
> lines), and I'm concerned about the amount of Stack I'd have to use to do
> all this.  No, I won't build a Linked List (and sort that), which I'd
> have to explicitly dispose of when this process is completed - I want to
> do it all in a subprogram and keep the data on the Stack.
>    Given these requirements, is there a better way to collect, sort, and
> make available (up to) 200+ full paths which are recursively found?
>    Following is the routine I've used to start building this process:

> procedure Recurser;
> procedure ListAll (Root : String);
> var SR : SearchRec;
>      D : DirStr;
>      N : NameStr;
>      E : ExtStr;
> begin
>   Root := FExpand (Root); FindFirst (Root, AnyFile, SR);
>   FSplit (Root,D,N,E);
>   while DOSError = 0 do with SR do
>     begin
>       if ((Attr and Directory) = Directory) and (Name <> '.') and
>          (Name <> '..') then
>         begin
>           writeln (D,Name); ListAll (D+Name+'\*.*')
>         end
>       else writeln (D+Name);
>       Findnext (SR)
>     end;
> end;
> begin
>   ListAll ('A:\*.*')
> end;

> procedure Recurser;
> procedure ListAll (Root : String);
> var SR : SearchRec;
>      D : DirStr;
>      N : NameStr;
>      E : ExtStr;
> begin
>   Root := FExpand (Root); FindFirst (Root, AnyFile, SR);
>   FSplit (Root,D,N,E);
>   while DOSError = 0 do with SR do
>     begin
>       if ((Attr and Directory) = Directory) and (Name <> '.') and
>          (Name <> '..') then
>         begin
>           writeln (D,Name); ListAll (D+Name+'\*.*')
>         end
>       else writeln (D+Name);
>       Findnext (SR)
>     end;
> end;
> begin
>   ListAll ('A:\*.*')
> end;

> If I understand correctly, You want the full path to be stored, but you
> don't want the overhead of storing that full path?  One way I can think
> of is to enumerate each directory as you find it, then store the just
> the filename from each directory with the value referring to the
> directory it's in.  It may not solve the problems, but it can reduce
> memory requirements, especially when directory names start getting
> long.  

> procedure Recurser;
> procedure ListAll (Root : String);
> var SR : SearchRec;
>      D : DirStr;
>      N : NameStr;
>      E : ExtStr;
> begin
>   Root := FExpand (Root); FindFirst (Root, AnyFile, SR);
>   FSplit (Root,D,N,E);
>   while DOSError = 0 do with SR do
>     begin
>       if ((Attr and Directory) = Directory) and (Name <> '.') and
>          (Name <> '..') then
>         begin
>           writeln (D,Name); ListAll (D+Name+'\*.*')
>         end
>       else writeln (D+Name);
>       Findnext (SR)
>     end;
> end;
> begin
>   ListAll ('A:\*.*')
> end;

>>                            ...it's still going to be a tough job trying
>> to squeeze it in so it all fits in the stack segment.  (Isn't that what
>> dynamic allocation is for in the first place?)

>   Yes, but I haven't got very much of that - less than Stack, ftm.  This
>is my largest application, already overlayed to the hilt, and I sometimes
>have as little as 2000 bytes of Heap available when all the data is
>stored...