I'd sort first, then remove duplicates
I've still no idea what resample means
#!/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.
-
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.