Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical

Re^3: reduce like iterators

by TimToady (Parson)
on Jan 03, 2011 at 21:04 UTC ( #880260=note: print w/ replies, xml ) Need Help??

in reply to Re^2: reduce like iterators
in thread reduce like iterators

This particular problem is solved in Perl 6 by always cloning all blocks as closures the same way, so state is reset in loops as well as in map. (In fact, the for loop is defined in terms of map in Perl 6. So for loops return a list of values just like map does.) Perl 5 could probably move in the direction of fewer special-cased blocks that aren't true closures; this would have many subtle benefits. Not everything in Perl 6 can be borrowed back, but I suspect this is one of them.

Comment on Re^3: reduce like iterators

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (5)
As of 2015-11-30 07:33 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (764 votes), past polls