[Haskell-cafe] ByteString search code available in easy-to-digest
dons at galois.com
Wed Nov 7 17:22:10 EST 2007
> I've packaged up the fast Boyer-Moore and Knuth-Morris-Pratt code that
> Chris Kuklewicz posted a few months ago:
> 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:
> 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
More information about the Haskell-Cafe