Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

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

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


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

So?


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


Comment on Re^7: Better mousetrap (getting top N values from list X)
Re^8: Better mousetrap (getting top N values from list X)
by BrowserUk (Pope) on Feb 03, 2005 at 23:34 UTC

    So,...you said:

    ...if you had lazy lists (coming in perl6)...

    And I couldn't see how lazy lists would benefit this problem; hence my original question (way back up there^^^ somewhere).


    Examine what is said, not who speaks.
    Silence betokens consent.
    Love the truth but pardon error.
      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.

        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://427864]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (6)
As of 2015-01-31 14:48 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My top resolution in 2015 is:

















    Results (258 votes), past polls