dmeoli / ADS / 39319858833

98%

Build Type

push

github

Committed by dmeoli

Commit Message

BigInteger nearer GMP: the sums and the products by one digit in assembly with MULX and the carry chains of ADCX and ADOX, the NTT on lanes of doubles of AVX2 with FMA modulo three primes below 2^50 on 2^k or 3 2^k terms, two rounds per pass, its scratch kept per thread, and the NTT on pieces of 32 bits with the products of Shoup on lanes of AVX2, Algorithm D with the trial quotients of three digits by two and the reciprocal of a digit with no division (Moeller and Granlund), the division by Newton's reciprocal by blocks with the products by the divisor modulo b^N - 1, the quotient alone by the divisor cut digit by digit or with no last remainder, the conversions by the powers without their low digits 0, with their reciprocals kept and the leaves divided in pairs, the gcd with one digit by Hensel's division, the Karatsuba middle sum shared, the numbers of one or two digits with no allocation, BigInteger::divExact() and addMul() for the sums of Rational, the thresholds tuned against GMP on a Xeon Gold 5120; the tests at every new threshold and edge

Coverage Stats

600 of 602 new or added lines in 3 files covered. (99.67%)

1 existing line in 1 file now uncovered.

23476 of 23930 relevant lines covered (98.1%)

8649944.91 hits per line