Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

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

by runrig (Abbot)
on Jan 21, 2011 at 17:24 UTC ( [id://883580]=note: print w/replies, xml ) Need Help??


in reply to Re^3: Fastest way to recurse through VERY LARGE directory tree
in thread 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');

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others perusing the Monastery: (6)
As of 2025-12-15 11:48 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    What's your view on AI coding assistants?





    Results (95 votes). Check out past polls.

    Notices?
    hippoepoptai's answer Re: how do I set a cookie and redirect was blessed by hippo!
    erzuuliAnonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.