At Tue, 20 Jan 2009 22:08:55 +0100, Henning Thielemann wrote: > > Jim Burton schrieb: > > > Well, I might but they definitely do not :-) We are talking about some > > maths-averse people and you would not have got to the final syllable > > of 'fibonacci' before all hope was lost. But I am sure there are > > plenty of examples that rely on laziness which will communicate. I am > > sure I read a blog post or something on c.l.f/c.l.h recently about > > lazily sorting a million numbers but can't find it. > > Maybe they are interested in finding all equal files in a set of files. > This can be done in an elegant way by sorting the files with respect to > their content. Practical enough? >
Indeed, thanks! Jim > http://hackage.haskell.org/cgi-bin/hackage-scripts/package/equal-files _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
