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


No such thing as a small change
	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 ( [id://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');
[download]

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

In Section Seekers of Perl Wisdom

Domain Nodelet^?

www.com | www.net | www.org

Node Status^?

node history
Node Type: note [id://883583]
help

Chatterbox^?

How do I use this? • Last hour • Other CB clients

Other Users^?

Others meditating upon the Monastery: (3)

As of 2024-04-26 04:17 GMT

Sections^?

Information^?

Find Nodes^?

Leftovers^?

Today I Learned

Voting Booth^?

No recent polls found