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). Stefan
signature.asc
Description: Digital signature
_______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
