[Haskell-cafe] Lazy lists simulated by unboxed mutable arrays
bulat.ziganshin at gmail.com
Wed May 28 04:31:53 EDT 2008
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
> every 1000th byte or so. My suggestion aims at laziness at element level
> but still more efficiency than a list.
well, i don't understand difference between your idea and lazybs
Bulat mailto:Bulat.Ziganshin at gmail.com
More information about the Haskell-Cafe