Have you tried using any of the standard string searching algorithms
to speed up the search? Like BM or KMP?
-- Lennart
Branimir Maksimovic wrote:
From: Tomasz Zielonka <[EMAIL PROTECTED]>
To: Branimir Maksimovic <[EMAIL PROTECTED]>
CC: [EMAIL PROTECTED], [email protected]
Subject: Re: [Haskell-cafe] Differences in optimisiation with
interactive and compiled mo
Date: Sat, 10 Dec 2005 18:14:58 +0100
On Sat, Dec 10, 2005 at 04:14:20PM +0000, Branimir Maksimovic wrote:
> Nice code.
But incorrect. I have broken it when refactoring :-/
Here is the correct version:
replace2 src dst = repl
where
repl input | src `isPrefixOf` input = dst ++ repl (drop (length
src) input)
repl (x:xs) = x : repl xs
repl [] = []
> But it takes lot of ram (1GB is not enough )and can't execute my test.
Can you check this version?
It's ok now; 2 megs like other versions.
It's just about 1.5 seconds slower then mine version and Daniels version
is a
bit faster the mine.
[EMAIL PROTECTED] ~/tutorial
$ time ./replace1.exe
Working:seaseasearch replace able seaseaseasearch baker seaseasearch
charlie
True
Done
real 0m14.140s
user 0m0.015s
sys 0m0.000s
Greetings, Bane.
_________________________________________________________________
Express yourself instantly with MSN Messenger! Download today it's FREE!
http://messenger.msn.click-url.com/go/onm00200471ave/direct/01/
_______________________________________________
Haskell-Cafe mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell-cafe
_______________________________________________
Haskell-Cafe mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell-cafe