Dear ghc guru's,
Could somebody tell me how (==) :: Integer -> Integer -> Bool
is implemented in ghc? Is this done as
(==) a b = (==) (a - b) 0
or is this done by calling some C-function which compares two
integers?
The reason why I want to know is that I have a function which
does subtraction of integers where more than 40% of the execution
time is spent. Depending on the way comparing for equality is
implemented, I may, or may not, be able to squeeze a bit more
performance out of my code.
Thanks in advance,
Marc
________________________________________________________________
Marc van Dongen, Computer Science Dept | phone: +353 21 903083
University College Cork, NUIC | Fax: +353 21 903113
College Road, Cork, Ireland | Email: [EMAIL PROTECTED]
