Re^2: Finding nested directories from a string list.

This is great QM ! I had to make one change due to the order that keys are pulled out of a hash. I changed the code from:

foreach my $path ( keys %paths )
{
[download]

to:

# : N.B. We explicitly iterate over the paths in order of the
#   number of directory components.  This is so we don't create
#   directories for a child path before creating directories for a
#   parent path.

# : sort the keys to %path by the number of directory components and
#   then by a string compare.  (both comparisons are ascending.)
my @sorted_paths = sort { $a =~ tr/\\// <=> $b =~ tr/\\//  ||
                          $a cmp $b
                        } keys %paths;

# : foreach $path in the @sorted_paths array
    foreach my $path (@sorted_paths) {
[download]

Comment on Re^2: Finding nested directories from a string list. Select or Download Code

Replies are listed 'Best First'.
Re^3: Finding nested directories from a string list. by QM (Parson) on Feb 27, 2006 at 16:58 UTC
As was stated elsewhere in this thread, you can sort on length instead. The parent will always sort before the child: `my @sorted_paths = sort { length($a) <=> length($b) } keys %paths;` [download] -QM -- Quantum Mechanics: The dreams stuff is made of	[reply] [d/l]