Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things

Re^4: Sorting files you Have read

by GrandFather (Saint)
on Nov 16, 2006 at 23:07 UTC ( #584629=note: print w/replies, xml ) Need Help??

in reply to Re^3: Sorting files you Have read
in thread Sorting files you Have read

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

Log In?

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://584629]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (2)
As of 2022-08-16 21:35 GMT
Find Nodes?
    Voting Booth?

    No recent polls found