Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw

I think *maybe*?

by Anonymous Monk
on Dec 24, 1999 at 00:52 UTC ( #1353=note: print w/replies, xml ) Need Help??

in reply to How do I recursively process files through directories

Wouldn't this work? I haven't even run this to check for syntax, so DON'T EVEN trust me! I'm just as clueless as you are even more so probably, but I would like to know if this is generaly possible && if there are any downs of using this kind of approach.
print &FilesExt('/tmp','csv','txt')." files renamed\n";

sub FilesExt {

    my ($startpath,$orgext,$newext) = @_;
    my ($count);

    foreach $leaf (glob("$startpath/*")) {
        if (-d $leaf) { 
            $count += FilesExt($leaf,$orgext,$newext);
        } elsif ($leaf =~ m/$orgext\z/i) { #case insensitive maybe?
            my $oldleaf = $leaf;
            $leaf =~ s/$1/$newext/;
            rename($oldleaf,$leaf) or warn();
Comments, monks?

Replies are listed 'Best First'.
RE: I think *maybe*?
by Anonymous Monk on Dec 24, 1999 at 00:57 UTC
    YAY! I just ran it... it does work, but I'd still like to know if this is potentially a bad way of doing things... Cheers.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1353]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (8)
As of 2018-02-22 21:37 GMT
Find Nodes?
    Voting Booth?
    When it is dark outside I am happiest to see ...

    Results (299 votes). Check out past polls.