[Haskell-cafe] ByteString search code available in easy-to-digest form

Bryan O'Sullivan bos at serpentine.com
Wed Nov 7 17:21:58 EST 2007

Don Stewart wrote:

> Do we have any benchmarks, for say, 1G files, versus linear, naive
> (strict) search?

Chris mentioned that he did, but I haven't had time to write anything 
benchmarky yet.


More information about the Haskell-Cafe mailing list