Report: gmp-6.1.2 on MacOS 10.15 using GCC and two Clang

Torbjörn Granlund tg at gmplib.org
Sun Oct 20 20:14:07 UTC 2019


Hans Åberg <haberg-1 at telia.com> writes:

  Strictly, it is for signed overflows one cannot assume modulo 2^n, n =
  number of bits. For the unsigned integer types it is required,
  though.

Believe it or not, but the GMP devs are pretty good at computer
arithmetic.

-- 
Torbjörn
Please encrypt, key id 0xC8601622


More information about the gmp-bugs mailing list