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

Re^4: RFC: Implicit Parallelization Pragma

by hardburn (Abbot)
on Jan 26, 2005 at 14:22 UTC ( #425213=note: print w/ replies, xml ) Need Help??

in reply to Re^3: RFC: Implicit Parallelization Pragma
in thread RFC: Implicit Parallelization Pragma

How about the Schwartzian as an example?

my @sorted = map { $_->[0] } sort { $a->[1] <=> $b->[1] } map {[ $_, substr( $_, 2, 5 ) ]} @list;

The maps can be parellelized, and the sort can, too, if perl (lowercase) implemented it with a parellel sorting algorithm. The second map (in execution order) must come out in correct order--otherwise, why did you even bother sorting? Intrestingly, the first map does not need to come out in order, though there is a problem of letting perl in on this fact.

"There is no shame in being self-taught, only in not trying to learn in the first place." -- Atrus, Myst: The Book of D'ni.

Comment on Re^4: RFC: Implicit Parallelization Pragma
Download Code

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others having an uproarious good time at the Monastery: (7)
As of 2014-12-25 03:21 GMT
Find Nodes?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?

    Results (159 votes), past polls