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

bos:

I've packaged up the fast Boyer-Moore and Knuth-Morris-Pratt code that Chris Kuklewicz posted a few months ago:

http://article.gmane.org/gmane.comp.lang.haskell.libraries/7363

The consensus at the time was that the code was not ready for rolling into the bytestring package, but now it's easy to install and start working with.

API docs:

http://darcs.serpentine.com/stringsearch/dist/doc/html/stringsearch/

Patches against the darcs repo welcome:

darcs get http://darcs.serpentine.com/stringsearch

Credit to Justin Bailey, Daniel Fischer, and Chris Kuklewicz for their hard work.

(Currently only tested against GHC 6.6.1, FYI.)

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