[Haskell-cafe] Re: Over-allocation

Gracjan Polak gracjanpolak at gmail.com
Thu Nov 22 04:38:04 EST 2007

Don Stewart <dons <at> galois.com> 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

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


More information about the Haskell-Cafe mailing list