Re^4: Fastest way to recurse through VERY LARGE directory tree

Read the OP. I didn't say FFR has to return the entire list, the OP says the entire list needs to be processed. So, in this case, FFR would return the entire list of files.

Comment on Re^4: Fastest way to recurse through VERY LARGE directory tree

Replies are listed 'Best First'.
Re^5: Fastest way to recurse through VERY LARGE directory tree by eff_i_g (Curate) on Jan 21, 2011 at 17:38 UTC
Ah, gotcha. But you can work around building the entire list: `use warnings; use strict; use File::Find::Rule; File::Find::Rule->file->exec( sub { print $_[2], "\n"; return 0; } )->in('/path');` [download]	[reply] [d/l]


Problems? Is your data what you think it is?
	PerlMonks