Re[2]: [Haskell-cafe] Lazy lists simulated by unboxed mutable arrays

2008-05-29 Thread Henning Thielemann
On Thu, 29 May 2008, Bulat Ziganshin wrote: Hello Andrew, Wednesday, May 28, 2008, 10:37:47 PM, you wrote: looks like lazy.bytestring generalized to any a That sounds like a darn useful thing to have... well, support on only Word8 as base type isn't some fundamental limit, just creators

Re[2]: [Haskell-cafe] Lazy lists simulated by unboxed mutable arrays

2008-05-28 Thread Bulat Ziganshin
Hello Henning, Wednesday, May 28, 2008, 12:22:54 PM, you wrote: Whenever an element with an index beyond the cursor is requested, sufficiently many new elements are written to the array and the cursor is advanced. As far as I know, ByteString.Lazy is chunky, that is laziness occurs only