From: Eli Zaretskii <eliz AT is DOT elta DOT co DOT il>
Newsgroups: comp.os.msdos.djgpp
Subject: Re: Best way to implement DELTREE
Date: Tue, 04 Apr 2000 18:58:46 +0200
Organization: NetVision Israel	
Lines: 14
Message-ID: <38EA1F46.4636CDE6@is.elta.co.il>
References: <8ccfq7$v1q$1 AT newsg1 DOT svr DOT pol DOT co DOT uk> <38E9C679 DOT 30DE0FA4 AT mtu-net DOT ru>
NNTP-Posting-Host: ras1-p103.rvt.netvision.net.il
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
X-Trace: news.netvision.net.il 954867436 28803 62.0.172.105 (4 Apr 2000 16:57:16 GMT)
X-Complaints-To: abuse AT netvision DOT net DOT il
NNTP-Posting-Date: 4 Apr 2000 16:57:16 GMT
X-Mailer: Mozilla 4.7 [en] (Win98; I)
X-Accept-Language: en,ru,hebrew
To: djgpp AT delorie DOT com
DJ-Gateway: from newsgroup comp.os.msdos.djgpp
Reply-To: djgpp AT delorie DOT com

"Alexei A. Frounze" wrote:
> 
> You need a recursive traversal through all the directories.

There are already such functions in the library.  See my other message in
this thread.

> Here you should use findfirst() and findnext() plus two subroutines that
> save and restore searching state of findfirst() and findnext(). These 2
> additional functions simply saves and restores DTA

No need to save and restore the DTA: the DJGPP versions of findfirst/findnext
do that automagically for you.  (Also note that the LFN versions of these two
functions don't require to set DTA at all.)