A kind-of recursive sort that doesn't require decoration.
use strict;
use warnings;
use Data::Dumper;
my @AoA = (
['blah', 'asdf', 'foo', 'bar'],
['two'],
['zzz', 'def', 'ghi'],
['one'],
['mmm', 'def', 'ghi'],
['qqq', 'xyz', 'aaa'],
);
my @sortedAoA = do {
my $recSort;
$recSort = sub {
my @arrA = @{ $_[ 0 ] };
my @arrB = @{ $_[ 1 ] };
return 0 unless @arrA;
return ( pop( @arrA ) cmp pop( @arrB ) )
|| $recSort->( \ @arrA, \ @arrB );
};
sort { @$a <=> @$b || $recSort->( $a, $b ) } @AoA;
};
print Data::Dumper->Dumpxs( [ \ @sortedAoA ], [ qw{ *sortedAoA } ] );
The output.
@sortedAoA = (
[
'one'
],
[
'two'
],
[
'qqq',
'xyz',
'aaa'
],
[
'mmm',
'def',
'ghi'
],
[
'zzz',
'def',
'ghi'
],
[
'blah',
'asdf',
'foo',
'bar'
]
);
I hope this is of interest.
Update: Renamed the @revA and @revB variables to @arrA and @arrB as the final solution used pop rather than reverse and shift but I'd forgotten to rename at the time.
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.