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

2007-09-05 Thread Stefan O'Rear
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.

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

2007-09-05 Thread Henning Thielemann
On Wed, 5 Sep 2007, Bryan O'Sullivan wrote: Henning Thielemann wrote: I thought it must be possible to define an unboxed array type with Storable elements. Yes, this just hasn't been done. There would be a few potentially tricky corners, of course; Storable instances are not required to

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

2007-09-05 Thread Bryan O'Sullivan
Henning Thielemann wrote: I thought it must be possible to define an unboxed array type with Storable elements. Yes, this just hasn't been done. There would be a few potentially tricky corners, of course; Storable instances are not required to be fixed in size, though all the precanned ins

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

2007-09-05 Thread Henning Thielemann
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 see