Beefy Boxes and Bandwidth Generously Provided by pair Networks vroom
go ahead... be a heretic
 
PerlMonks  

Re: How do I recursively process files through directories

by Discipulus (Canon)
on Sep 12, 2002 at 08:40 UTC ( [id://197204]=note: print w/replies, xml ) Need Help??

This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.


in reply to How do I recursively process files through directories

on my first script (I'm still a newbie) I had the same problem. I have solved it in this way:
use DirHandle; use Cwd; use File::stat; $strarting_dir = cwd; &creaalbero($strarting_dir); &alkilo($dimensione); print $dimensione; sub creaalbero { chdir $_; $cwd = cwd; $percorso = "$cwd"."\\"; $dh = new DirHandle; $dh->open("$_"); @lista = ($dh->read()); shift @lista; shift @lista; foreach $dir (<*>) { if (-d $dir) { chdir $dir; &creaalbero(); $albero{"$percorso"} = directory; chdir".."; } if (-f $dir) { $current = cwd; $albero{"$current"."\\"."$dir"} = file; $stat = stat ($dir); $dimensione += $stat->size; } } } sub alkilo { $dimensione = $dimensione / 1024; @grand = qw/Tb Gb Mb Kb /; if ( $dimensione >= 1024 ) { pop @grand ; &alkilo($dimensione) } unless ( $dimensione == 0 ) { $molt = pop @grand } $dimensione =~ /^\d*\.\d?\d?/; $dimensione = "$&" . " " . "$molt"; }
This code make %albero with the paths as keys and directory or file as values(is unnecessary to recurse the directory).
It calculate the size of the sub tree and print out the value.
The magic point is:
foreach $dir(<*>)
NOTE: creaalbero means maketree and percorso means path.

seeU L*

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://197204]
help
Sections?
Information?
Find Nodes?
Leftovers?
    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.