[project @ 1999-12-08 14:21:52 by simonmar]
authorsimonmar <unknown>
Wed, 8 Dec 1999 14:22:00 +0000 (14:22 +0000)
committersimonmar <unknown>
Wed, 8 Dec 1999 14:22:00 +0000 (14:22 +0000)
commit9c370d695ac7b7b7108440b028b017459ae5ef02
tree750fa2f42287075cb0b47b9c61e44bfcbb5ab31f
parent60741e4205e743fc99d50f707c61db93d1372bc8
[project @ 1999-12-08 14:21:52 by simonmar]
Add Marc Van Dongen's Integer improvements.  Specifically:

- new primops: gcdInt#, gcdIntegerInt#, divExact#,
  quotInteger#, remInteger#.

- new definitions of quot and rem for Integer in
  PrelNum (using the new quotInteger# and remInteger#
  primops instead of quotRemInteger#).  Should be
  slightly faster than before.  div & mod aren't
  likewise optimised (yet).

- specialisations of gcd for Int and Integer, and
  lcm for Integer in PrelNum.
ghc/compiler/prelude/PrimOp.lhs
ghc/includes/PrimOps.h
ghc/lib/std/PrelGHC.hi-boot
ghc/lib/std/PrelNum.lhs
ghc/rts/PrimOps.hc