Re[2]: [Haskell-cafe] Lazy lists simulated by unboxed mutable arrays
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 of bytestring package was not very interested in support of other base types Just in order to remind you, ByteString for any Storable types does already exist: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/storablevector Current repository is here: http://code.haskell.org/storablevector/ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re[2]: [Haskell-cafe] Lazy lists simulated by unboxed mutable arrays
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 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 implementation -- Best regards, Bulatmailto:[EMAIL PROTECTED] ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
