On Sun, 24 Aug 2008, John Van Enk wrote:
Eric, I was hoping to use a packed format like ByteString eventually. Right now, I want to get everything working nicely. As it stands, I end up marshaling a lot of information into/out of arrays which I'd much rather keep as a block of memory. I'm guessing that some sort of unboxed array would be close to what I want. If you have suggestions, I'm more than open to them. (This is my first attempt at writing a library.)
In recent versions of StorableVector (not at hackage yet, only in darcs repository) there is a chunky lazy variant. However there are also the uvector and vector packages, and no-one seems to know, on which one we should focus.
Let me elaborate on my point, that there is not one data structre which fits all needs: The great thing about Haskell's laziness is that you can implement feedback easily. But this does not work with chunky lazy sequences (StorableVector.Lazy) and causes quadratic computation time with my State.Signal representation. It works only with element-wise lazy structures, aka lists. I have an idea for a more efficient data structure for that problem, but I'm uncertain if it is really more efficient in the end.
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
