[Haskell-cafe] A round of golf

[Ketil Malde]

Don Stewart <dons at galois.com> writes:

>> If I want to make my own efficient bytestring consumer, is that
>> what I need to use in order to preserve the inherent laziness of
>> the datastructure? 

> you can get foldChunks from Data.ByteString.Lazy.Internal,
> or write your own chunk folder.

IME you can also get nicely by using the standard list-alikes:
uncons, head, tail, take, drop... 

-k
-- 
If I haven't seen further, it is by standing in the footprints of giants