Perl equivalent to the following shell operation.

[grocery_stocker]

I'm analyzing a really large file. While I was bringing in carts at
work, I figured it would be easier/more efficient just to split the
file, sort it in parallel, then merge it. If I wrote a shell script, I
would do something like the following:

#This code is duped from a google search
(cat list1 list2 list3 | sort | uniq > list123) &
(cat list4 list5 list6 | sort | uniq > list456) &

wait

diff list123 list456

However, I'm writing this in Perl because it would be easier to sort
the file using the Schwartzian Transform method. Is there an equivalent
in Perl or would I have to use some kind of existing Perl mod?

Chad

 

[grocery_stocker]

I'm analyzing a really large file. While I was bringing in carts at
work, I figured it would be easier/more efficient just to split the
file, sort it in parallel, then merge it. If I wrote a shell script, I
would do something like the following:

#This code is duped from a google search
(cat list1 list2 list3 | sort | uniq > list123) &
(cat list4 list5 list6 | sort | uniq > list456) &

wait

diff list123 list456

However, I'm writing this in Perl because it would be easier to sort
the file using the Schwartzian Transform method. Is there an equivalent
in Perl or would I have to use some kind of existing Perl mod?

Chad

Never mind. I entered the world 'parallel' in the search box thingy and
google magically turned up the answer.

 

[Dave]

Never mind. I entered the world 'parallel' in the search box thingy and
google magically turned up the answer.

I'm not sure why use say it 'would be easier to sort the file using the
Schwartian Transform method'. This method does not make it easier, in fact
it makes the code more complex that simply sorting, but with the advantage
of efficiency where re-calculating values is involved at each comparison.
This would not be the case in the simple sort above.

 

[Dave]

I'm not sure why use say it 'would be easier to sort the file using the
Schwartian Transform method'. This method does not make it easier, in fact
it makes the code more complex that simply sorting, but with the advantage
of efficiency where re-calculating values is involved at each comparison.
This would not be the case in the simple sort above.

s/use/you/;