Re: [Haskell-cafe] Interesting folds over bytestring lists?

In message "Justin Bailey" 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? Duncan