Re: [Haskell-cafe] Substring replacements

Am Montag, 12. Dezember 2005 01:34 schrieben Sie:

On 12/12/05, Daniel Fischer wrote:

...

Okay, I have looked up KMP and implemented it. Seems to work -- my first use of QuickCheck, too. It's slower than Bulat's and Tomasz' for Branimir's test :-(, but really fast for my test. Undoubtedly, one can still tune it.

Perhaps by using unboxed arrays...

/S

-- Sebastian Sylvan +46(0)736-818655 UIN: 44640862

I'm afraid, unboxed arrays are out of the question, because bord is incrementally produced :-( Working very long test2: <<loop>> Cheers, Daniel