Hi
And strangely enough on my machine 1) is faster by a few percent than
Consider a few percent to be noise. It may not really be a faster
result, and it may not have anything to do with what you wrote.
A few percent might seem unimportant, but I am
currently developing my Haskell style.
HP Wei wrote:
I cut and paste the code from
http://blog.moertel.com/articles/2004/03/13/concurrent-port-scanner-in-haskell
And compiled the resulting portscan.hs
with both ghc-6.8.2 and ghc-6.6.1
on a host with Sun-Sparc [SunOS 5.10].
Besides the issue of binary-code-size blow-up with
alexander.fuchs:
Hi there,
I am trying to write my first serious Haskell program, but have
problems understanding 'strange' performance results. It seems to be
a ghc specific question, so I am asking here.
In a happy parser I have this code 1):
%monad { Parsed } { thenP } { returnP }