[Haskell-cafe] Interesting folds over bytestring lists?

Duncan Coutts duncan.coutts at worc.ox.ac.uk
Thu Sep 20 07:49:57 EDT 2007

In message <a45dff840709191630h4e98e87em6ade4bee433f7bcf at mail.gmail.com> "Justin
Bailey" <jgbailey at gmail.com> writes:
> I have a data structure which is a list of bytestrings, but externally
> it looks like one big string.

A lazy bytestring is a list of strict bytestring which externally looks like one
big string. Could you not just use a lazy bytestring and it's take and drop
functions? Perhaps you can help me understand what it is you're trying to do?


More information about the Haskell-Cafe mailing list