#!/usr/bin/perl --
use strict; use warnings; use Data::Dump qw/ dd pp /;
my @AoA = (
[ 0.5, "b1", "c0" ],
[ 0.4, "b1", "c1" ],
[ 0.7, "b2", "c2" ],
[ 0.3, "b3", "c3" ],
[ 0.6, "b3", "c4" ],
);
dd\@AoA;
@AoA = sort { $$b[0] <=> $$a[0] } @AoA;
dd\@AoA;
{ my %seen;
@AoA = grep{!$seen{$$_[1]}++}@AoA;
}
dd\@AoA;
__END__
[
[0.5, "b1", "c0"],
[0.4, "b1", "c1"],
[0.7, "b2", "c2"],
[0.3, "b3", "c3"],
[0.6, "b3", "c4"],
]
[
[0.7, "b2", "c2"],
[0.6, "b3", "c4"],
[0.5, "b1", "c0"],
[0.4, "b1", "c1"],
[0.3, "b3", "c3"],
]
[[0.7, "b2", "c2"], [0.6, "b3", "c4"], [0.5, "b1", "c0"]]
Also worth considering are Sort::Key - the fastest way to sort anything in Perl
and Sort::Key::External allows to sort huge lists that do not fit in the available memory. |