We don't bite newbies here... much | |
PerlMonks |
Re: Fastest way to recurse through VERY LARGE directory treeby JavaFan (Canon) |
on Jan 21, 2011 at 03:08 UTC ( [id://883449]=note: print w/replies, xml ) | Need Help?? |
Benchmark.
It may very well be that whatever you come up with is only faster than File::Find on some setups of disks/volume managers/filesystem, and slower on others. You need to benchmark to find out. Now, in theory, carefully handcrafting something that does exactly what you need is going to be faster than a more general setup than File::Find. But whether that's actually be measurable is a different question. So, benchmark. Of course, as you describe the problem, the bottleneck might very well be your I/O. Hence, benchmark. Have I said you should benchmark? No? Well, benchmark!
In Section
Seekers of Perl Wisdom
|
|