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

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.

Comment on Re^8: Better mousetrap (getting top N values from list X)

Replies are listed 'Best First'.
Re^9: Better mousetrap (getting top N values from list X) by sleepingsquirrel (Chaplain) on Feb 03, 2005 at 23:46 UTC
Ahh. I think Re^5: Better mousetrap (getting top N values from list X) is the answer you're looking for. (Or at least a starting place.) -- All code is 100% tested and functional unless otherwise noted.	[reply]
Re^9: Better mousetrap (getting top N values from list X) by sleepingsquirrel (Chaplain) on Feb 03, 2005 at 23:58 UTC
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.	[reply] [d/l]
Re^10: Better mousetrap (getting top N values from list X) by BrowserUk (Patriarch) 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.	[reply] [d/l]