Mail Archives: djgpp/1999/01/12/20:50:45
| From: | "Camilo" <CmlLpz AT worldnet DOT att DOT net>
|
| Newsgroups: | comp.os.msdos.djgpp
|
| Subject: | Travers the DirTree structure in ANSI C++
|
| Date: | 13 Jan 1999 01:45:10 GMT
|
| Organization: | AT&T WorldNet Services
|
| Lines: | 21
|
| Message-ID: | <77gtr6$ng@bgtnsc02.worldnet.att.net>
|
| NNTP-Posting-Host: | 12.78.196.203
|
| X-Newsreader: | Microsoft Outlook Express 4.72.3110.5
|
| X-MimeOLE: | Produced By Microsoft MimeOLE V4.72.3110.3
|
| To: | djgpp AT delorie DOT com
|
| DJ-Gateway: | from newsgroup comp.os.msdos.djgpp
|
| Reply-To: | djgpp AT delorie DOT com
|
Hi,
I need to know how do you travers the DirTree structure in ANSI C++?
In Win you use:
struct _finddata_t DirFls;
_findfirst(char *curpth, &DirFls);
_findnext( hFile, &DirFls);
_findclose(hFile);
as I did in the attached (dirty, yet working) code example.
I did my homework, and was wondering if ANSI C++ does not provide such
thing (either).
Thank you.
Camilo
- Raw text -