Re: [Haskell-cafe] Mutable arrays

Jeff φ wrote:

Changing the subject slightly, I once wrote code in Concurrent Clean that filtered a file that was larger than the available memory on my PC. I did this by creating a function that returned the contents of the original file as a lazy list.

Doing this is idiomatic in Haskell, although its usage is commonly discouraged in more complex UI settings because you cannot ever close the file handle until the end of the program. The relevant functions are to be found in the Prelude (or in Data.ByteString.Lazy, for that matter). ---------------------------------------------------------------------- Get a free email account with anti spam protection. http://www.bluebottle.com/tag/2