Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris

Re^2: How A Function Becomes Higher Order

by Anonymous Monk
on Sep 16, 2005 at 19:56 UTC ( #492742=note: print w/ replies, xml ) Need Help??

in reply to Re: How A Function Becomes Higher Order
in thread How A Function Becomes Higher Order

We're getting warmer. What we'd really like to do is reuse the abstractions and functions we've already got available. So you tie a file to an array, and use the standard collection traversal functions (map, grep, foreach, reduce, etc.) to do the dirty work. And be sure to make it lazy (demand driven) just like our familiar unix command line utilities. (see Chapter 9, pg. 142 of Advanced Perl Programming (the Panther)).

Comment on Re^2: How A Function Becomes Higher Order

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (9)
As of 2015-11-27 10:22 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 (724 votes), past polls