[Haskell-cafe] Re: Over-allocation

Don Stewart writes:

ByteStrings have all the same operations as lists though, so you can index, compare and take substrings, with the benefit that he underlying string will be shared, not copied. And only use 1 byte per element.

Is there any parser built directly over ByteString that I could look at? Or maybe somebody implemented something like Text.ParserCombinators.ReadP for ByteString?

From the first sight it seems doable, so there is light at the end of the tunnel :)

-- Gracjan