On 7/31/07, Donald Bruce Stewart [EMAIL PROTECTED] wrote:
jgbailey:
Also, be sure to compare against a naive search, optimised for
strict and lazy bytestrings,
http://hpaste.org/1803
If its not faster than those 2, then you're doing something wrong :)
-- Don
Yes, I was really hoping
I've implemented KMP string searching for lazy bytestrings, and I'd
like some help improving the performance of the code. I'd also like to
know if it doesn't look correct - I've tested it pretty extensively
but you never know ...
I've been testing on a 7 MB file, where the search sequence is not
Now I wonder what that 7MB file might be? :-)
We (team TNT) implemented KMP over lazy bytestrings as part of our icfp
2007 contest entry. As I remember, for the DNA evaluator it gave modest
speed improvements over more naïve searching. Our implementation was based
upon this blog post:
On Wed, 2007-08-01 at 01:51 +0100, Tim Docker wrote:
Now I wonder what that 7MB file might be? :-)
We (team TNT) implemented KMP over lazy bytestrings as part of our icfp
2007 contest entry. As I remember, for the DNA evaluator it gave modest
speed improvements over more naïve searching. Our
