Krasimir Angelov wrote: > How mod is affected by the change in quot? Currently mod is defined as: > > a `mod` b > | b == 0 = divZeroError > | a == minBound && b == (-1) = overflowError > | otherwise = a `modInt` b > > and modInt is defined via remInt# which is primitive. Did you change > the definition of mod as well?
Yes I did. div, mod, quot, rem, divMod, quotRem, for Ints of various sizes. Everything. Bertram _______________________________________________ Glasgow-haskell-users mailing list Glasgowfirstname.lastname@example.org http://www.haskell.org/mailman/listinfo/glasgow-haskell-users