From 3a66e93d2075a3c12cad8e242ce3e1a140d198e1 Mon Sep 17 00:00:00 2001 From: William Hart Date: Sat, 3 Oct 2015 12:41:18 +0000 Subject: [PATCH] Run makeinfo. --- doc/mpir.info | 8 ++++---- doc/mpir.info-2 | 16 +++++++++++----- 2 files changed, 15 insertions(+), 9 deletions(-) diff --git a/doc/mpir.info b/doc/mpir.info index 9e89f32e..bb0f5ebd 100644 --- a/doc/mpir.info +++ b/doc/mpir.info @@ -169,9 +169,9 @@ Node: Float Internals345688 Node: Raw Output Internals353002 Node: C++ Interface Internals354197 Node: Contributors357484 -Node: References366492 -Node: GNU Free Documentation License374251 -Node: Concept Index399402 -Node: Function Index443969 +Node: References366795 +Node: GNU Free Documentation License374554 +Node: Concept Index399705 +Node: Function Index444272  End Tag Table diff --git a/doc/mpir.info-2 b/doc/mpir.info-2 index 4607608b..f514c23f 100644 --- a/doc/mpir.info-2 +++ b/doc/mpir.info-2 @@ -1427,8 +1427,9 @@ development. Niels Moller wrote the fast ngcd code for computing integer GCD, the quadratic Hensel division code and precomputed inverse code for -Euclidean division. He also made contributions to the Toom multiply -code, especially helper functions to simplify Toom evaluations. +Euclidean division, along with fast jacobi symbols code. He also made +contributions to the Toom multiply code, especially helper functions to +simplify Toom evaluations. Pierrick Gaudry provided initial AMD 64 assembly support and revised the FFT code. @@ -1447,18 +1448,23 @@ He also helped write the root code and wrote much of the Itanium assembly code and a couple of Core 2 assembly functions and part of the basecase middle product assembly code for x86 64 bit. He also wrote the improved string input and output code and made improvements to the GCD -and extended GCD code. Torbjorn is also responsible for numerous other -bits and pieces that have been used from the GNU project. +and extended GCD code. He also contributed the nextprime code and +coauthored the bin_uiui code. Torbjorn is also responsible for numerous +other bits and pieces that have been used from the GNU project. Marco Bodrato and Alberto Zanoni suggested the unbalanced multiply strategy and found optimal Toom multiplication sequences. Marco Bodrato wrote an mpz implementation of the Toom 7 code and wrote most of the Toom 8.5 multiply and squaring code. He also helped -write the divide and conquer Euclidean division code. +write the divide and conquer Euclidean division code. He also +contributed many improved number theoretical functions including +factorial, multi-factorial, primorial, n-choose-k. Robert Gerbicz contributed fast factorial code. + Martin Boij made assorted contributions to the nextprime code. + David Harvey wrote fast middle product code and divide and conquer approximate quotient code for both Euclidean and Hensel division and contributed to the quadratic Hensel code.