If you find yourself "uniquifying" keys for a hash you should probably be using an array. Consider:
use strict;
use warnings;
use constant KEY => 1;
my @sort_data;
while (my $record = <DATA>) {
my $key = (split(/,/, $record))[KEY];
push @sort_data, [$record, $key];
}
foreach my $pair (sort {$a->[1] cmp $b->[1]} @sort_data) {
print "$pair->[0]";
}
using the same data as in previous samples prints:
BUT, It runs with no errors, but nothing prints.
I tried your code, and it seems quite simple, hence, efective.
At the moment, due to the small file size, sort time is unimportant.
At some point, when I get to that stage, the sorted data will be reuse
+d.
DWIM is Perl's answer to Gödel
-
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.