Re^2: Quick file search

I know that in unix, File::Find takes much longer than the standard "find" utility for a directory tree of any considerable size.

This was discussed in considerable length in Myth busted: Shell isn't always faster than Perl and was wondering if you can back up the claim of "much longer" . My tests show differences of only a fraction of a second on 100 meg tree.

I'm not really a human, but I play one on earth. flash japh

Comment on Re^2: Quick file search

Replies are listed 'Best First'.
Re^3: Quick file search by graff (Chancellor) on Jan 06, 2006 at 04:48 UTC
The evidence I've gathered about unix "find" vs. File::Find is at least a couple years old, and I haven't checked to see whether there has been an update to File::Find since then, nor tested it more recently to see whether it has improved within the last couple years. (I assume unix "find" remains about the same.) In any case, I posted some benchmarks here and here. Looking at those again just now, my statement above about "5- or 6-to-1" should have simply been "5-to-1".	[reply]

Replies are listed 'Best First'.

Re^3: Quick file search
by graff (Chancellor) on Jan 06, 2006 at 04:48 UTC

In any case, I posted some benchmarks here and here. Looking at those again just now, my statement above about "5- or 6-to-1" should have simply been "5-to-1".

[reply]