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

Re: capturing name of deepest directory in a tree structure.

by liverpole (Monsignor)
on Mar 07, 2010 at 17:48 UTC ( [id://827261]=note: print w/replies, xml ) Need Help??


in reply to Reaped: capturing name of deepest directory in a tree structure.

It was already posted and answered right here.

s''(q.S:$/9=(T1';s;(..)(..);$..=substr+crypt($1,$2),2,3;eg;print$..$/
  • Comment on Re: capturing name of deepest directory in a tree structure.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others pondering the Monastery: (4)
As of 2024-04-26 00:01 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found