in reply to Re^2: Finding deepest directories in a tree structure represented in a flatfile?
in thread Finding deepest directories in a tree structure represented in a flatfile?

May fail on other data

A better regex would be m{^(.+[\\/])[^\\/]*$} which will also work on MS Windows file paths.

But, as you said, would be better to use File::Basename as it will work with the file path syntax of several other OSes.

  • Comment on Re^3: Finding deepest directories in a tree structure represented in a flatfile?
  • Download Code

In Section Seekers of Perl Wisdom