>SL>
 >  > You do get the really spiffy speed-enhancing quality of returning
 >  > more than one filename at a time if you use the OS/2 method.
 >SL>
 >
 > And this is a major bonus when used on a network that has a heavy
 > traffic load.  I wish that more OS/2 applications writers were aware
 > of this little trick.

So what general strategy should be employed? Case in point:  I'm writing a
FidoNet message tosser.  I would like to get all the names of the ARCmail
bundles that are waiting in an inbound area, so that they can be
decompressed and processed.  Additionally, I want to process them in order
by creation date.

I have no idea how many bundles may be queued up, perhaps one, perhaps a
few dozen.  Since I am only interested in the level 1 information, then I
suppose that I would have to allocate enough storage to hold a FILEFINDBUF3
data structure for all the potential files, correct?  What should I do,
just make some determination in advance as to the maximum allowable number
of files in the inbound area at one time, such as 100, 200, or perhaps
1000? I'm being somwehat facetious here of course, but I would like to
understand how it works.

If I use the routines in the Watcom runtime library, don't they have to
actually call to the OS/2 API under the covers anyway?

Thanks in advance.

--- Colt45 0.91.b