Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re: File::find hack

by oko1 (Deacon)
on Feb 25, 2012 at 16:55 UTC ( #956137=note: print w/ replies, xml ) Need Help??


in reply to File::find hack

Not especially elegant - I only strive for grace, not necessarily achieve it :) - but here's something that I think is a bit cleaner and more direct:

#!/usr/bin/perl use common::sense; use File::Find; my $dir = "/some/dir/some/where"; my %dirs; finddepth(\&newest, $dir); sub newest { return unless -f; my ($d, $n) = ($File::Find::dir, $File::Find::name); $dirs{$d} ||= $n and return; $dirs{$d} = $n if (stat($n))[9] > (stat($dirs{$d}))[9]; } print "$_: $dirs{$_}\n" for keys %dirs;
-- 
I hate storms, but calms undermine my spirits.
 -- Bernard Moitessier, "The Long Way"


Comment on Re: File::find hack
Download Code
Re^2: File::find hack
by nemesdani (Friar) on Feb 25, 2012 at 17:46 UTC
    Cool! Thank you very much! Had to think for awhile what ||= does, I'm not an expert as you can clearly see...:)

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (5)
As of 2014-07-30 22:51 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (241 votes), past polls