Re^6: Memory Efficient Alternatives to Hash of Array

[BrowserUk]

I stand corrected.

However, you're still better off using an external sort, as it allows you to gather the multiple values for each key together without loading the entire dataset into memory. Using a fairly simple loop like this:

#! perl 
use strict;

my( $key, @array ) = split "\t", <>;
while( <> ) {
    chomp;
    my( $newKey, $value ) = split "\t";
    if( $newKey eq $key ) {
        push @array, $value;
        next;
    }
    else {
        # Process @array for $key      
        
        #...
        
        ## Remember the newKey
        $key = $nextKey;
        ## And the reset the array
        @array = $value;
    }
}

And a command line like:

sort < unsortedFile | perl theScriptAbove

Or just sort the file and then feed it to the script as separate steps:

sort < unsortedFile > sortedFile
perl theScriptAbove sortedFile

[tilly]

*ahem* My first answer had the same idea, but with one less bug.

[BrowserUk]

Acknowledged on both counts.

Well sort of. The effect of using an external sort (or Sort::External) on

while (my $line = <DATA>) {

could be considered a bug, which would put us evens...but that just nit-picking:)