Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

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

by eff_i_g (Curate)
on Jan 21, 2011 at 17:38 UTC ( #883583=note: print w/ replies, xml ) Need Help??


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

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');


Comment on Re^5: Fastest way to recurse through VERY LARGE directory tree
Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://883583]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (6)
As of 2014-12-20 01:13 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (94 votes), past polls