Hi Igor.
| We don't support targeting Cygwin, I'm afraid. Details here:
|
|
| http://www.haskell.org/ghc/docs/latest/html/building/winbuild.html
|
| Various people have worked to provide libraries offering Posix-like
| facilities for Haskell on Windows, to ease the kind of porting you are
| tryin
Yup, that's it. It does indeed go nice and fast with GHC 5.04.3, but
slows down with 6.2. This is because 6.2 is using the new
Data.PackedString library, which is unoptimised. (the code also needs a
fix to hashPS for 6.2: indexPS is 0-based rather than 1-based).
Cheers,
Simon
> Does
On Fri, 19 Mar 2004, Simon Marlow wrote:
> I did post a hash table version of this program a while back, that I
> claimed was a factor of 3 faster at the time. Unfortunately the
> attachment in the archive is in base64 and I can't read it, and I've
> lost the code :-( If you can decode the attac
> looking at `The Great Computer Language Shootout' mentioned in another
> thread, I wanted to try if Data.HashTable gives better results than
> Data.FiniteMap for the spell checker test
> http://www.bagley.org/~doug/shootout/bench/spellcheck/
>
> I came up with the attached program. With data
Hi !
[EMAIL PROTECTED] wrote:
I am still unsure of whether Haskell would be a good competitor against
other languages in my case, but it seems like if it does the best option
would be to reuse C++ graph libraries and carefully write a wrapper
around them to minimize passing values between C and
