[Haskell-cafe] Optimizing a title matcher
Lyle Kopnicky
lists at qseep.net
Wed Sep 27 00:30:00 EDT 2006
Hi folks,
It turns out Haskell is vindicated. It's my algorithm that was slow. As
Robert Dockins pointed out, the double nested loop is just going to take
a long time.
As evidence, it turns out my C++ version is just as slow as the Haskell
version.
So, I'm going to go back to Haskell, but be more selective about which
titles from the reference table I choose to match against, for any given
import title.
Thanks,
Lyle
More information about the Haskell-Cafe
mailing list