Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re^9: Better mousetrap (getting top N values from list X)

by sleepingsquirrel (Hermit)
on Feb 03, 2005 at 23:58 UTC ( #427874=note: print w/ replies, xml ) Need Help??


in reply to Re^8: Better mousetrap (getting top N values from list X)
in thread Better mousetrap (getting top N values from list X)

You're correct, sort is strict on its input arguments (i.e. it has to evaluate each one), but the importance of laziness comes about because the output is a lazy list.


-- All code is 100% tested and functional unless otherwise noted.


Comment on Re^9: Better mousetrap (getting top N values from list X)
Download Code
Re^10: Better mousetrap (getting top N values from list X)
by BrowserUk (Pope) on Feb 04, 2005 at 00:05 UTC

    See 427875


    Examine what is said, not who speaks.
    Silence betokens consent.
    Love the truth but pardon error.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (12)
As of 2014-07-31 10:51 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (248 votes), past polls