[Haskell-cafe] Block-wise lazy sequences in Haskell

Stefan O'Rear stefanor at cox.net
Wed Sep 5 14:51:41 EDT 2007

On Wed, Sep 05, 2007 at 07:54:34PM +0200, Henning Thielemann wrote:
>  I want to have a data structure like Data.ByteString.Lazy, that is 
> block-wise lazy, but polymorphic. I could use a lazy list of unboxed arrays 
> (UArray) but the documentation says, that the element types are restricted. 
> But I will need (strict) pairs of Double and the like as elements. It seems 
> that I need generalized instances in order to use these arrays.
>  I thought it must be possible to define an unboxed array type with 
> Storable elements. I cannot find such a type in the standard libraries. 
> Further on, I wonder why pairs are not instances of Storable.

Your request is perfectly reasonable, it just hasn't been implemented.
I started something like this a while ago; I'll see how easy it is to
finish (famous last words).

-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 189 bytes
Desc: Digital signature
Url : http://www.haskell.org/pipermail/haskell-cafe/attachments/20070905/55800f64/attachment.bin

More information about the Haskell-Cafe mailing list