RubyGems - glib2 - Versions diffs - 3.0.7-x64-mingw32 → 3.0.8-x64-mingw32 - Mend

glib2 3.0.7-x64-mingw32 → 3.0.8-x64-mingw32

Files changed (1062) hide show

data/vendor/local/share/gtk-doc/html/p11-kit/trust-module.html CHANGED Viewed

@@ -2,13 +2,13 @@
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
-<title>p11-kit: Trust Policy Module</title>
+<title>Trust Policy Module: p11-kit</title>
 <meta name="generator" content="DocBook XSL Stylesheets V1.78.1">
 <link rel="home" href="index.html" title="p11-kit">
 <link rel="up" href="index.html" title="p11-kit">
 <link rel="prev" href="sharing.html" title="Proxy Module">
 <link rel="next" href="trust-nss.html" title="Using the Trust Policy Module with NSS">
-<meta name="generator" content="GTK-Doc V1.21 (XML mode)">
+<meta name="generator" content="GTK-Doc V1.24 (XML mode)">
 <link rel="stylesheet" href="style.css" type="text/css">
 </head>
 <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -90,7 +90,6 @@ $ pkg-config --variable p11_trust_paths p11-kit-1
 </div>
 </div>
 <div class="footer">
-<hr>
-          Generated by GTK-Doc V1.21</div>
+<hr>Generated by GTK-Doc V1.24</div>
 </body>
 </html>

data/vendor/local/share/gtk-doc/html/p11-kit/trust-nss.html CHANGED Viewed

@@ -2,13 +2,13 @@
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
-<title>p11-kit: Using the Trust Policy Module with NSS</title>
+<title>Using the Trust Policy Module with NSS: p11-kit</title>
 <meta name="generator" content="DocBook XSL Stylesheets V1.78.1">
 <link rel="home" href="index.html" title="p11-kit">
 <link rel="up" href="trust-module.html" title="Trust Policy Module">
 <link rel="prev" href="trust-module.html" title="Trust Policy Module">
 <link rel="next" href="trust-glib-networking.html" title="Using the Trust Policy Module with glib-networking">
-<meta name="generator" content="GTK-Doc V1.21 (XML mode)">
+<meta name="generator" content="GTK-Doc V1.24 (XML mode)">
 <link rel="stylesheet" href="style.css" type="text/css">
 </head>
 <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -35,7 +35,6 @@
 	GUI or command line configuration.</p>
 </div>
 <div class="footer">
-<hr>
-          Generated by GTK-Doc V1.21</div>
+<hr>Generated by GTK-Doc V1.24</div>
 </body>
 </html>

data/vendor/local/share/gtk-doc/html/p11-kit/trust.html CHANGED Viewed

@@ -2,13 +2,13 @@
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
-<title>p11-kit: trust</title>
+<title>trust: p11-kit</title>
 <meta name="generator" content="DocBook XSL Stylesheets V1.78.1">
 <link rel="home" href="index.html" title="p11-kit">
 <link rel="up" href="tools.html" title="Manual Pages">
 <link rel="prev" href="pkcs11-conf.html" title="pkcs11.conf">
 <link rel="next" href="reference.html" title="API Reference">
-<meta name="generator" content="GTK-Doc V1.21 (XML mode)">
+<meta name="generator" content="GTK-Doc V1.24 (XML mode)">
 <link rel="stylesheet" href="style.css" type="text/css">
 </head>
 <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -383,7 +383,6 @@ $ trust extract-compat
 </div>
 </div>
 <div class="footer">
-<hr>
-          Generated by GTK-Doc V1.21</div>
+<hr>Generated by GTK-Doc V1.24</div>
 </body>
 </html>

data/vendor/local/share/info/gmp.info CHANGED Viewed

@@ -1,10 +1,10 @@
-This is ../../gmp/doc/gmp.info, produced by makeinfo version 4.13 from
+This is ../../gmp/doc/gmp.info, produced by makeinfo version 4.8 from
 ../../gmp/doc/gmp.texi.
-This manual describes how to install and use the GNU multiple precision
-arithmetic library, version 6.0.0.
+   This manual describes how to install and use the GNU multiple
+precision arithmetic library, version 6.1.0.
-   Copyright 1991, 1993-2014 Free Software Foundation, Inc.
+   Copyright 1991, 1993-2015 Free Software Foundation, Inc.
    Permission is granted to copy, distribute and/or modify this
 document under the terms of the GNU Free Documentation License, Version
@@ -12,7 +12,7 @@ document under the terms of the GNU Free Documentation License, Version
 with no Invariant Sections, with the Front-Cover Texts being "A GNU
 Manual", and with the Back-Cover Texts being "You have freedom to copy
 and modify this GNU Manual, like GNU software".  A copy of the license
-is included in *note GNU Free Documentation License::.
+is included in *Note GNU Free Documentation License::.
 INFO-DIR-SECTION GNU libraries
 START-INFO-DIR-ENTRY
@@ -21,161 +21,156 @@ END-INFO-DIR-ENTRY
 Indirect:
-gmp.info-1: 882
-gmp.info-2: 300831
+gmp.info-1: 884
+gmp.info-2: 298669
 Tag Table:
 (Indirect)
-Node: Top882
-Node: Copying2953
-Node: Introduction to GMP5299
-Node: Installing GMP8014
-Node: Build Options8746
-Node: ABI and ISA24479
-Node: Notes for Package Builds34316
-Node: Notes for Particular Systems37403
-Node: Known Build Problems45153
-Node: Performance optimization48688
-Node: GMP Basics49817
-Node: Headers and Libraries50465
-Node: Nomenclature and Types51870
-Node: Function Classes53866
-Node: Variable Conventions55400
-Node: Parameter Conventions57009
-Node: Memory Management59065
-Node: Reentrancy60193
-Node: Useful Macros and Constants62061
-Node: Compatibility with older versions63052
-Node: Demonstration Programs63963
-Node: Efficiency65828
-Node: Debugging73452
-Node: Profiling80478
-Node: Autoconf84469
-Node: Emacs86250
-Node: Reporting Bugs86856
-Node: Integer Functions89483
-Node: Initializing Integers90259
-Node: Assigning Integers92635
-Node: Simultaneous Integer Init & Assign94246
-Node: Converting Integers95893
-Node: Integer Arithmetic98857
-Node: Integer Division100593
-Node: Integer Exponentiation107345
-Node: Integer Roots108839
-Node: Number Theoretic Functions110559
-Node: Integer Comparisons118034
-Node: Integer Logic and Bit Fiddling119472
-Node: I/O of Integers122117
-Node: Integer Random Numbers125108
-Node: Integer Import and Export127725
-Node: Miscellaneous Integer Functions131741
-Node: Integer Special Functions133655
-Node: Rational Number Functions137815
-Node: Initializing Rationals139008
-Node: Rational Conversions141487
-Node: Rational Arithmetic143237
-Node: Comparing Rationals144649
-Node: Applying Integer Functions146057
-Node: I/O of Rationals147576
-Node: Floating-point Functions149634
-Node: Initializing Floats152604
-Node: Assigning Floats156697
-Node: Simultaneous Float Init & Assign159288
-Node: Converting Floats160838
-Node: Float Arithmetic164128
-Node: Float Comparison166281
-Node: I/O of Floats167941
-Node: Miscellaneous Float Functions170630
-Node: Low-level Functions172632
-Node: Random Number Functions205756
-Node: Random State Initialization206824
-Node: Random State Seeding209689
-Node: Random State Miscellaneous211094
-Node: Formatted Output211736
-Node: Formatted Output Strings211981
-Node: Formatted Output Functions217360
-Node: C++ Formatted Output221435
-Node: Formatted Input224135
-Node: Formatted Input Strings224371
-Node: Formatted Input Functions229023
-Node: C++ Formatted Input231992
-Node: C++ Class Interface233895
-Node: C++ Interface General234846
-Node: C++ Interface Integers237916
-Node: C++ Interface Rationals241637
-Node: C++ Interface Floats245660
-Node: C++ Interface Random Numbers251676
-Node: C++ Interface Limitations254078
-Node: Custom Allocation257656
-Node: Language Bindings261875
-Node: Algorithms265469
-Node: Multiplication Algorithms266169
-Node: Basecase Multiplication267258
-Node: Karatsuba Multiplication269166
-Node: Toom 3-Way Multiplication272792
-Node: Toom 4-Way Multiplication279211
-Node: Higher degree Toom'n'half280590
-Node: FFT Multiplication281876
-Node: Other Multiplication287211
-Node: Unbalanced Multiplication289685
-Node: Division Algorithms290473
-Node: Single Limb Division290852
-Node: Basecase Division293742
-Node: Divide and Conquer Division294945
-Node: Block-Wise Barrett Division297014
-Node: Exact Division297666
-Node: Exact Remainder300831
-Node: Small Quotient Division303081
-Node: Greatest Common Divisor Algorithms304679
-Node: Binary GCD304976
-Node: Lehmer's Algorithm307825
-Node: Subquadratic GCD310044
-Node: Extended GCD312501
-Node: Jacobi Symbol313813
-Node: Powering Algorithms314828
-Node: Normal Powering Algorithm315091
-Node: Modular Powering Algorithm315619
-Node: Root Extraction Algorithms316401
-Node: Square Root Algorithm316716
-Node: Nth Root Algorithm318857
-Node: Perfect Square Algorithm319642
-Node: Perfect Power Algorithm321729
-Node: Radix Conversion Algorithms322350
-Node: Binary to Radix322726
-Node: Radix to Binary326656
-Node: Other Algorithms328744
-Node: Prime Testing Algorithm329096
-Node: Factorial Algorithm330280
-Node: Binomial Coefficients Algorithm332670
-Node: Fibonacci Numbers Algorithm333564
-Node: Lucas Numbers Algorithm336038
-Node: Random Number Algorithms336759
-Node: Assembly Coding338881
-Node: Assembly Code Organisation339841
-Node: Assembly Basics340808
-Node: Assembly Carry Propagation341958
-Node: Assembly Cache Handling343789
-Node: Assembly Functional Units345950
-Node: Assembly Floating Point347563
-Node: Assembly SIMD Instructions351341
-Node: Assembly Software Pipelining352323
-Node: Assembly Loop Unrolling353385
-Node: Assembly Writing Guide355600
-Node: Internals358365
-Node: Integer Internals358877
-Node: Rational Internals361133
-Node: Float Internals362371
-Node: Raw Output Internals369785
-Node: C++ Interface Internals370979
-Node: Contributors374300
-Node: References380372
-Node: GNU Free Documentation License386132
-Node: Concept Index411295
-Node: Function Index457482
+Node: Top884
+Node: Copying2955
+Node: Introduction to GMP5301
+Node: Installing GMP8016
+Node: Build Options8748
+Node: ABI and ISA24481
+Node: Notes for Package Builds34318
+Node: Notes for Particular Systems37405
+Node: Known Build Problems45155
+Node: Performance optimization48690
+Node: GMP Basics49819
+Node: Headers and Libraries50467
+Node: Nomenclature and Types51872
+Node: Function Classes53868
+Node: Variable Conventions55402
+Node: Parameter Conventions57011
+Node: Memory Management59067
+Node: Reentrancy60195
+Node: Useful Macros and Constants62063
+Node: Compatibility with older versions63054
+Node: Demonstration Programs63965
+Node: Efficiency65830
+Node: Debugging73454
+Node: Profiling80480
+Node: Autoconf84471
+Node: Emacs86252
+Node: Reporting Bugs86858
+Node: Integer Functions89485
+Node: Initializing Integers90261
+Node: Assigning Integers92637
+Node: Simultaneous Integer Init & Assign94248
+Node: Converting Integers95895
+Node: Integer Arithmetic98859
+Node: Integer Division100595
+Node: Integer Exponentiation107347
+Node: Integer Roots108841
+Node: Number Theoretic Functions110561
+Node: Integer Comparisons117818
+Node: Integer Logic and Bit Fiddling119256
+Node: I/O of Integers121901
+Node: Integer Random Numbers124892
+Node: Integer Import and Export127509
+Node: Miscellaneous Integer Functions131525
+Node: Integer Special Functions133439
+Node: Rational Number Functions137600
+Node: Initializing Rationals138793
+Node: Rational Conversions141272
+Node: Rational Arithmetic143022
+Node: Comparing Rationals144434
+Node: Applying Integer Functions145905
+Node: I/O of Rationals147424
+Node: Floating-point Functions149482
+Node: Initializing Floats152526
+Node: Assigning Floats156619
+Node: Simultaneous Float Init & Assign159210
+Node: Converting Floats160760
+Node: Float Arithmetic164050
+Node: Float Comparison166203
+Node: I/O of Floats167774
+Node: Miscellaneous Float Functions170463
+Node: Low-level Functions172465
+Node: Random Number Functions206639
+Node: Random State Initialization207707
+Node: Random State Seeding210572
+Node: Random State Miscellaneous211977
+Node: Formatted Output212619
+Node: Formatted Output Strings212864
+Node: Formatted Output Functions218243
+Node: C++ Formatted Output222318
+Node: Formatted Input225018
+Node: Formatted Input Strings225254
+Node: Formatted Input Functions229906
+Node: C++ Formatted Input232875
+Node: C++ Class Interface234778
+Node: C++ Interface General235729
+Node: C++ Interface Integers238799
+Node: C++ Interface Rationals242638
+Node: C++ Interface Floats246661
+Node: C++ Interface Random Numbers252677
+Node: C++ Interface Limitations255079
+Node: Custom Allocation258657
+Node: Language Bindings262876
+Node: Algorithms266470
+Node: Multiplication Algorithms267170
+Node: Basecase Multiplication268259
+Node: Karatsuba Multiplication270167
+Node: Toom 3-Way Multiplication273793
+Node: Toom 4-Way Multiplication280212
+Node: Higher degree Toom'n'half281591
+Node: FFT Multiplication282877
+Node: Other Multiplication288213
+Node: Unbalanced Multiplication290687
+Node: Division Algorithms291475
+Node: Single Limb Division291854
+Node: Basecase Division294745
+Node: Divide and Conquer Division295948
+Node: Block-Wise Barrett Division298017
+Node: Exact Division298669
+Node: Exact Remainder301834
+Node: Small Quotient Division304084
+Node: Greatest Common Divisor Algorithms305682
+Node: Binary GCD305979
+Node: Lehmer's Algorithm308828
+Node: Subquadratic GCD311047
+Node: Extended GCD313507
+Node: Jacobi Symbol314819
+Node: Powering Algorithms315834
+Node: Normal Powering Algorithm316097
+Node: Modular Powering Algorithm316625
+Node: Root Extraction Algorithms317407
+Node: Square Root Algorithm317722
+Node: Nth Root Algorithm319863
+Node: Perfect Square Algorithm320648
+Node: Perfect Power Algorithm322735
+Node: Radix Conversion Algorithms323356
+Node: Binary to Radix323732
+Node: Radix to Binary327353
+Node: Other Algorithms329441
+Node: Prime Testing Algorithm329793
+Node: Factorial Algorithm330977
+Node: Binomial Coefficients Algorithm333367
+Node: Fibonacci Numbers Algorithm334261
+Node: Lucas Numbers Algorithm336735
+Node: Random Number Algorithms337456
+Node: Assembly Coding339578
+Node: Assembly Code Organisation340538
+Node: Assembly Basics341505
+Node: Assembly Carry Propagation342655
+Node: Assembly Cache Handling344486
+Node: Assembly Functional Units346647
+Node: Assembly Floating Point348260
+Node: Assembly SIMD Instructions352038
+Node: Assembly Software Pipelining353020
+Node: Assembly Loop Unrolling354082
+Node: Assembly Writing Guide356297
+Node: Internals359062
+Node: Integer Internals359574
+Node: Rational Internals361830
+Node: Float Internals363068
+Node: Raw Output Internals370482
+Node: C++ Interface Internals371676
+Node: Contributors374997
+Node: References381138
+Node: GNU Free Documentation License386906
+Node: Concept Index412069
+Node: Function Index458256
 End Tag Table
-Local Variables:
-coding: iso-8859-1
-End:

data/vendor/local/share/info/gmp.info-1 CHANGED Viewed

@@ -1,10 +1,10 @@
-This is ../../gmp/doc/gmp.info, produced by makeinfo version 4.13 from
+This is ../../gmp/doc/gmp.info, produced by makeinfo version 4.8 from
 ../../gmp/doc/gmp.texi.
-This manual describes how to install and use the GNU multiple precision
-arithmetic library, version 6.0.0.
+   This manual describes how to install and use the GNU multiple
+precision arithmetic library, version 6.1.0.
-   Copyright 1991, 1993-2014 Free Software Foundation, Inc.
+   Copyright 1991, 1993-2015 Free Software Foundation, Inc.
    Permission is granted to copy, distribute and/or modify this
 document under the terms of the GNU Free Documentation License, Version
@@ -12,7 +12,7 @@ document under the terms of the GNU Free Documentation License, Version
 with no Invariant Sections, with the Front-Cover Texts being "A GNU
 Manual", and with the Back-Cover Texts being "You have freedom to copy
 and modify this GNU Manual, like GNU software".  A copy of the license
-is included in *note GNU Free Documentation License::.
+is included in *Note GNU Free Documentation License::.
 INFO-DIR-SECTION GNU libraries
 START-INFO-DIR-ENTRY
@@ -26,9 +26,9 @@ GNU MP
 ******
    This manual describes how to install and use the GNU multiple
-precision arithmetic library, version 6.0.0.
+precision arithmetic library, version 6.1.0.
-   Copyright 1991, 1993-2014 Free Software Foundation, Inc.
+   Copyright 1991, 1993-2015 Free Software Foundation, Inc.
    Permission is granted to copy, distribute and/or modify this
 document under the terms of the GNU Free Documentation License, Version
@@ -36,7 +36,7 @@ document under the terms of the GNU Free Documentation License, Version
 with no Invariant Sections, with the Front-Cover Texts being "A GNU
 Manual", and with the Back-Cover Texts being "You have freedom to copy
 and modify this GNU Manual, like GNU software".  A copy of the license
-is included in *note GNU Free Documentation License::.
+is included in *Note GNU Free Documentation License::.
 * Menu:
@@ -162,15 +162,15 @@ the GMP library and one for bug reports.  For more information, see
      `https://gmplib.org/mailman/listinfo/'.
    The proper place for bug reports is <gmp-bugs@gmplib.org>.  See
-*note Reporting Bugs:: for information about reporting bugs.
+*Note Reporting Bugs:: for information about reporting bugs.
 1.1 How to use this Manual
 ==========================
-Everyone should read *note GMP Basics::.  If you need to install the
-library yourself, then read *note Installing GMP::.  If you have a
-system with multiple ABIs, then read *note ABI and ISA::, for the
+Everyone should read *Note GMP Basics::.  If you need to install the
+library yourself, then read *Note Installing GMP::.  If you have a
+system with multiple ABIs, then read *Note ABI and ISA::, for the
 compiler options that must be used on applications.
    The rest of the manual can be used for later reference, although it
@@ -197,7 +197,7 @@ And you can install (under `/usr/local' by default) with
      make install
    If you experience problems, please report them to
-<gmp-bugs@gmplib.org>.  See *note Reporting Bugs::, for information on
+<gmp-bugs@gmplib.org>.  See *Note Reporting Bugs::, for information on
 what to include in useful bug reports.
 * Menu:
@@ -220,7 +220,7 @@ All the usual autoconf configure options are available, run `./configure
 installation information too.
 Tools
-     `configure' requires various Unix-like tools.  See *note Notes for
+     `configure' requires various Unix-like tools.  See *Note Notes for
      Particular Systems::, for some options on non-Unix systems.
      It might be possible to build without the help of `configure',
@@ -233,7 +233,7 @@ Build Directory
      directory.  For example
           cd /my/build/dir
-          /my/sources/gmp-6.0.0/configure
+          /my/sources/gmp-6.1.0/configure
      Not all `make' programs have the necessary features (`VPATH') to
      support this.  In particular, SunOS and Slowaris `make' have bugs
@@ -384,7 +384,7 @@ Fat binary, `--enable-fat'
           ./configure --host=mips64-sgi-irix6 ABI=n32
-     See *note ABI and ISA::, for the available choices on relevant
+     See *Note ABI and ISA::, for the available choices on relevant
      CPUs, and what applications need to do.
 `CC', `CFLAGS'
@@ -549,14 +549,14 @@ Execution Profiling, `--enable-profiling=prof/gprof/instrument'
 Documentation
      The source for the document you're now reading is `doc/gmp.texi',
-     in Texinfo format, see *note Texinfo: (texinfo)Top.
+     in Texinfo format, see *Note Texinfo: (texinfo)Top.
      Info format `doc/gmp.info' is included in the distribution.  The
      usual automake targets are available to make PostScript, DVI, PDF
      and HTML (these will require various TeX and Texinfo tools).
      DocBook and XML can be generated by the Texinfo `makeinfo' program
-     too, see *note Options for `makeinfo': (texinfo)makeinfo options.
+     too, see *Note Options for `makeinfo': (texinfo)makeinfo options.
      Some supplementary notes can also be found in the `doc'
      subdirectory.
@@ -866,7 +866,7 @@ as making it possible for a user to omit `--build' (and `--host') so
 `--build' will be wanted for systems where `./config.guess' is inexact.
    On systems with multiple ABIs, a packaged build will need to decide
-which among the choices is to be provided, see *note ABI and ISA::.  A
+which among the choices is to be provided, see *Note ABI and ISA::.  A
 given run of `./configure' etc will only build one ABI.  If a second
 ABI is also required then a second run of `./configure' etc must be
 made, starting from a clean directory tree (`make distclean').
@@ -936,7 +936,7 @@ FreeBSD 7.x, 8.x, 9.0, 9.1, 9.2
      `gm4', which GMP cannot guess.
 FreeBSD 7.x, 8.x, 9.x
-     GMP releases starting with 5.2 do not support `ABI=32' on
+     GMP releases starting with 6.0 do not support `ABI=32' on
      FreeBSD/amd64 prior to release 10.0 of the system.  The cause is a
      broken `limits.h', which GMP no longer works around.
@@ -1145,7 +1145,7 @@ File: gmp.info,  Node: Performance optimization,  Prev: Known Build Problems,  U
 ============================
 For optimal performance, build GMP for the exact CPU type of the target
-computer, see *note Build Options::.
+computer, see *Note Build Options::.
    Unlike what is the case for most other programs, the compiler
 typically doesn't matter much, since GMP uses assembly language for the
@@ -1304,20 +1304,20 @@ There are six classes of functions in the GMP library:
      functions in this class.  (*note Integer Functions::)
   2. Functions for rational number arithmetic, with names beginning with
-     `mpq_'.  The associated type is `mpq_t'.  There are about 40
+     `mpq_'.  The associated type is `mpq_t'.  There are about 35
      functions in this class, but the integer functions can be used for
      arithmetic on the numerator and denominator separately.  (*note
      Rational Number Functions::)
   3. Functions for floating-point arithmetic, with names beginning with
-     `mpf_'.  The associated type is `mpf_t'.  There are about 60
+     `mpf_'.  The associated type is `mpf_t'.  There are about 70
      functions is this class.  (*note Floating-point Functions::)
   4. Fast low-level functions that operate on natural numbers.  These
      are used by the functions in the preceding groups, and you can
      also call them directly from very time-critical user programs.
      These functions' names begin with `mpn_'.  The associated type is
-     array of `mp_limb_t'.  There are about 30 (hard-to-use) functions
+     array of `mp_limb_t'.  There are about 60 (hard-to-use) functions
      in this class.  (*note Low-level Functions::)
   5. Miscellaneous functions.  Functions for setting up custom
@@ -1447,9 +1447,9 @@ of space, determined by the chosen precision and allocated at
 initialization, so their size doesn't change.
    All memory is allocated using `malloc' and friends by default, but
-this can be changed, see *note Custom Allocation::.  Temporary memory
+this can be changed, see *Note Custom Allocation::.  Temporary memory
 on the stack is also used (via `alloca'), but this can be changed at
-build-time if desired, see *note Build Options::.
+build-time if desired, see *Note Build Options::.
 File: gmp.info,  Node: Reentrancy,  Next: Useful Macros and Constants,  Prev: Memory Management,  Up: GMP Basics
@@ -1513,7 +1513,7 @@ File: gmp.info,  Node: Useful Macros and Constants,  Next: Compatibility with ol
  -- Global Constant: const char * const gmp_version
      The GMP version number, as a null-terminated string, in the form
-     "i.j.k".  This release is "6.0.0".  Note that the format "i.j" was
+     "i.j.k".  This release is "6.1.0".  Note that the format "i.j" was
      used, before version 4.3.0, when k was zero.
  -- Macro: __GMP_CC
@@ -1765,7 +1765,7 @@ File: gmp.info,  Node: Debugging,  Next: Profiling,  Prev: Efficiency,  Up: GMP
 Stack Overflow
      Depending on the system, a segmentation violation or bus error
      might be the only indication of stack overflow.  See
-     `--enable-alloca' choices in *note Build Options::, for how to
+     `--enable-alloca' choices in *Note Build Options::, for how to
      address this.
      In new enough versions of GCC, `-fstack-check' may be able to
@@ -1788,7 +1788,7 @@ Heap Problems
      In all such cases a `malloc' debugger is recommended.  On a GNU or
      BSD system the standard C library `malloc' has some diagnostic
-     facilities, see *note Allocation Debugging: (libc)Allocation
+     facilities, see *Note Allocation Debugging: (libc)Allocation
      Debugging, or `man 3 malloc'.  Other possibilities, in no
      particular order, include
@@ -1829,14 +1829,14 @@ Source File Paths
      path to the source directory.
           cd /my/build/dir
-          /my/source/dir/gmp-6.0.0/configure
+          /my/source/dir/gmp-6.1.0/configure
      This works via `VPATH', and might require GNU `make'.  Alternately
      it might be possible to change the `.c.lo' rules appropriately.
 Assertion Checking
      The build option `--enable-assert' is available to add some
-     consistency checks to the library (see *note Build Options::).
+     consistency checks to the library (see *Note Build Options::).
      These are likely to be of limited value to most applications.
      Assertion failures are just as likely to indicate memory
      corruption as a library or compiler bug.
@@ -1906,7 +1906,7 @@ Valgrind
 Other Problems
      Any suspected bug in GMP itself should be isolated to make sure
-     it's not an application problem, see *note Reporting Bugs::.
+     it's not an application problem, see *Note Reporting Bugs::.
 File: gmp.info,  Node: Profiling,  Next: Autoconf,  Prev: Debugging,  Up: GMP Basics
@@ -2076,8 +2076,8 @@ If you think you have found a bug in the GMP library, please
 investigate it and report it.  We have made this library available to
 you, and it is not too much to ask you to report the bugs you find.
-   Before you report a bug, check it's not already addressed in *note
-Known Build Problems::, or perhaps *note Notes for Particular
+   Before you report a bug, check it's not already addressed in *Note
+Known Build Problems::, or perhaps *Note Notes for Particular
 Systems::.  You may also want to check `https://gmplib.org/' for
 patches for this release.
@@ -2321,7 +2321,7 @@ File: gmp.info,  Node: Converting Integers,  Next: Integer Arithmetic,  Prev: Si
 This section describes functions for converting GMP integers to
 standard C types.  Functions for converting _to_ GMP integers are
-described in *note Assigning Integers:: and *note I/O of Integers::.
+described in *Note Assigning Integers:: and *Note I/O of Integers::.
  -- Function: unsigned long int mpz_get_ui (const mpz_t OP)
      Return the value of OP as an `unsigned long'.
@@ -2586,7 +2586,7 @@ File: gmp.info,  Node: Integer Exponentiation,  Next: Integer Roots,  Prev: Inte
      Set ROP to (BASE raised to EXP) modulo MOD.
      Negative EXP is supported if an inverse BASE^-1 mod MOD exists
-     (see `mpz_invert' in *note Number Theoretic Functions::).  If an
+     (see `mpz_invert' in *Note Number Theoretic Functions::).  If an
      inverse doesn't exist then a divide by zero is raised.
  -- Function: void mpz_powm_sec (mpz_t ROP, const mpz_t BASE, const
@@ -2658,20 +2658,14 @@ File: gmp.info,  Node: Number Theoretic Functions,  Next: Integer Comparisons,
  -- Function: int mpz_probab_prime_p (const mpz_t N, int REPS)
      Determine whether N is prime.  Return 2 if N is definitely prime,
      return 1 if N is probably prime (without being certain), or return
-     0 if N is definitely composite.
-     This function does some trial divisions, then some Miller-Rabin
-     probabilistic primality tests.  The argument REPS controls how
-     many such tests are done; a higher value will reduce the chances
-     of a composite being returned as "probably prime".  25 is a
-     reasonable number; a composite number will then be identified as a
-     prime with a probability of less than 2^(-50).
+     0 if N is definitely non-prime.
-     Miller-Rabin and similar tests can be more properly called
-     compositeness tests.  Numbers which fail are known to be composite
-     but those which pass might be prime or might be composite.  Only a
-     few composites pass, hence those which pass are considered
-     probably prime.
+     This function performs some trial divisions, then REPS Miller-Rabin
+     probabilistic primality tests.  A higher REPS value will reduce the
+     chances of a non-prime being identified as "probably prime".  A
+     composite number will be identified as a prime with a probability
+     of less than 4^(-REPS).  Reasonable values of REPS are between 15
+     and 50.
  -- Function: void mpz_nextprime (mpz_t ROP, const mpz_t OP)
      Set ROP to the next prime greater than OP.
@@ -2727,9 +2721,11 @@ File: gmp.info,  Node: Number Theoretic Functions,  Next: Integer Comparisons,
           OP2)
      Compute the inverse of OP1 modulo OP2 and put the result in ROP.
      If the inverse exists, the return value is non-zero and ROP will
-     satisfy 0 < ROP < abs(OP2).  If an inverse doesn't exist the
-     return value is zero and ROP is undefined.  The behaviour of this
-     function is undefined when OP2 is zero.
+     satisfy 0 <= ROP < abs(OP2) (with ROP = 0 possible only when
+     abs(OP2) = 1, i.e., in the somewhat degenerate zero ring).  If an
+     inverse doesn't exist the return value is zero and ROP is
+     undefined.  The behaviour of this function is undefined when OP2
+     is zero.
  -- Function: int mpz_jacobi (const mpz_t A, const mpz_t B)
      Calculate the Jacobi symbol (A/B).  This is defined only for B odd.
@@ -2807,7 +2803,7 @@ File: gmp.info,  Node: Number Theoretic Functions,  Next: Integer Comparisons,
      The Fibonacci numbers and Lucas numbers are related sequences, so
      it's never necessary to call both `mpz_fib2_ui' and
      `mpz_lucnum2_ui'.  The formulas for going from Fibonacci to Lucas
-     can be found in *note Lucas Numbers Algorithm::, the reverse is
+     can be found in *Note Lucas Numbers Algorithm::, the reverse is
      straightforward too.
@@ -2922,7 +2918,7 @@ for a STREAM argument to any of these functions will make them read from
 `stdio.h' before `gmp.h', since that will allow `gmp.h' to define
 prototypes for these functions.
-   See also *note Formatted Output:: and *note Formatted Input::.
+   See also *Note Formatted Output:: and *Note Formatted Input::.
  -- Function: size_t mpz_out_str (FILE *STREAM, int BASE, const mpz_t
           OP)
@@ -2985,7 +2981,7 @@ File: gmp.info,  Node: Integer Random Numbers,  Next: Integer Import and Export,
 The random number functions of GMP come in two groups; older function
 that rely on a global state, and newer functions that accept a state
-parameter that is read and modified.  Please see the *note Random
+parameter that is read and modified.  Please see the *Note Random
 Number Functions:: for more information on how to use and not to use
 random number functions.
@@ -2995,7 +2991,7 @@ random number functions.
      2^N-1, inclusive.
      The variable STATE must be initialized by calling one of the
-     `gmp_randinit' functions (*note Random State Initialization::)
+     `gmp_randinit' functions (*Note Random State Initialization::)
      before invoking this function.
  -- Function: void mpz_urandomm (mpz_t ROP, gmp_randstate_t STATE,
@@ -3003,7 +2999,7 @@ random number functions.
      Generate a uniform random integer in the range 0 to N-1, inclusive.
      The variable STATE must be initialized by calling one of the
-     `gmp_randinit' functions (*note Random State Initialization::)
+     `gmp_randinit' functions (*Note Random State Initialization::)
      before invoking this function.
  -- Function: void mpz_rrandomb (mpz_t ROP, gmp_randstate_t STATE,
@@ -3015,7 +3011,7 @@ random number functions.
      be in the range 0 to 2^N-1, inclusive.
      The variable STATE must be initialized by calling one of the
-     `gmp_randinit' functions (*note Random State Initialization::)
+     `gmp_randinit' functions (*Note Random State Initialization::)
      before invoking this function.
  -- Function: void mpz_random (mpz_t ROP, mp_size_t MAX_SIZE)
@@ -3054,8 +3050,8 @@ data with the following functions.
      word first or -1 for least significant first.  Within each word
      ENDIAN can be 1 for most significant byte first, -1 for least
      significant first, or 0 for the native endianness of the host CPU.
-     The most significant NAILS bits of each word are skipped, this can
-     be 0 to use the full words.
+     The most significant NAILS bits of each word are skipped, this
+     can be 0 to use the full words.
      There is no sign taken from the data, ROP will simply be a positive
      integer.  An application can handle any sign itself, and apply it
@@ -3221,7 +3217,7 @@ applications will not need them.
        mp_limb_t *xp;
        n = mpz_size (x);
-       xp = mpz_limbs_modify(x, 2*n);
+       xp = mpz_limbs_modify (x, 2*n);
        for (i = 0; i < n; i++)
          xp[n+i] = xp[n-1-i];
        mpz_limbs_finish (x, mpz_sgn (x) < 0 ? - 2*n : 2*n);
@@ -3441,6 +3437,7 @@ File: gmp.info,  Node: Comparing Rationals,  Next: Applying Integer Functions,
 ========================
  -- Function: int mpq_cmp (const mpq_t OP1, const mpq_t OP2)
+ -- Function: int mpq_cmp_z (const mpq_t OP1, const mpz_t OP2)
      Compare OP1 and OP2.  Return a positive value if OP1 > OP2, zero
      if OP1 = OP2, and a negative value if OP1 < OP2.
@@ -3517,7 +3514,7 @@ for a STREAM argument to any of these functions will make them read from
 `stdio.h' before `gmp.h', since that will allow `gmp.h' to define
 prototypes for these functions.
-   See also *note Formatted Output:: and *note Formatted Input::.
+   See also *Note Formatted Output:: and *Note Formatted Input::.
  -- Function: size_t mpq_out_str (FILE *STREAM, int BASE, const mpq_t
           OP)
@@ -3556,34 +3553,35 @@ File: gmp.info,  Node: Floating-point Functions,  Next: Low-level Functions,  Pr
 GMP floating point numbers are stored in objects of type `mpf_t' and
 functions operating on them have an `mpf_' prefix.
-   The mantissa of each float has a user-selectable precision, limited
-only by available memory.  Each variable has its own precision, and
-that can be increased or decreased at any time.
+   The mantissa of each float has a user-selectable precision, in
+practice only limited by available memory.  Each variable has its own
+precision, and that can be increased or decreased at any time.  This
+selectable precision is a minimum value, GMP rounds it up to a whole
+limb.
-   The exponent of each float is a fixed precision, one machine word on
+   The accuracy of a calculation is determined by the priorly set
+precision of the destination variable and the numeric values of the
+input variables.  Input variables' set precisions do not affect
+calculations (except indirectly as their values might have been
+affected when they were assigned).
+   The exponent of each float has fixed precision, one machine word on
 most systems.  In the current implementation the exponent is a count of
 limbs, so for example on a 32-bit system this means a range of roughly
 2^-68719476768 to 2^68719476736, or on a 64-bit system this will be
-greater.  Note however that `mpf_get_str' can only return an exponent
-which fits an `mp_exp_t' and currently `mpf_set_str' doesn't accept
-exponents bigger than a `long'.
+much greater.  Note however that `mpf_get_str' can only return an
+exponent which fits an `mp_exp_t' and currently `mpf_set_str' doesn't
+accept exponents bigger than a `long'.
-   Each variable keeps a size for the mantissa data actually in use.
+   Each variable keeps track of the mantissa data actually in use.
 This means that if a float is exactly represented in only a few bits
 then only those bits will be used in a calculation, even if the
-selected precision is high.
-   All calculations are performed to the precision of the destination
-variable.  Each function is defined to calculate with "infinite
-precision" followed by a truncation to the destination precision, but
-of course the work done is only what's needed to determine a result
-under that definition.
+variable's selected precision is high.  This is a performance
+optimization; it does not affect the numeric results.
-   The precision selected by the user for a variable is a minimum
-value, GMP may increase it to facilitate efficient calculation.
-Currently this means rounding up to a whole limb, and then sometimes
-having a further partial limb, depending on the high limb of the
-mantissa.
+   Internally, GMP sometimes calculates with higher precision than that
+of the destination variable in order to limit errors.  Final results
+are always truncated to the destination variable's precision.
    The mantissa is stored in binary.  One consequence of this is that
 decimal fractions like 0.1 cannot be represented exactly.  The same is
@@ -3594,16 +3592,15 @@ are better choices.)
    The `mpf' functions and variables have no special notion of infinity
 or not-a-number, and applications must take care not to overflow the
-exponent or results will be unpredictable.  This might change in a
-future release.
+exponent or results will be unpredictable.
    Note that the `mpf' functions are _not_ intended as a smooth
 extension to IEEE P754 arithmetic.  In particular results obtained on
 one computer often differ from the results on a computer with a
 different word size.
-   The GMP extension library MPFR (`http://mpfr.org') is an alternative
-to GMP's `mpf' functions.  MPFR provides well-defined precision and
+   New projects should consider using the GMP extension library MPFR
+(`http://mpfr.org') instead.  MPFR provides well-defined precision and
 accurate rounding, and thereby naturally extends IEEE P754.
 * Menu:
@@ -3940,6 +3937,7 @@ File: gmp.info,  Node: Float Comparison,  Next: I/O of Floats,  Prev: Float Arit
 ========================
  -- Function: int mpf_cmp (const mpf_t OP1, const mpf_t OP2)
+ -- Function: int mpf_cmp_z (const mpf_t OP1, const mpz_t OP2)
  -- Function: int mpf_cmp_d (const mpf_t OP1, double OP2)
  -- Function: int mpf_cmp_ui (const mpf_t OP1, unsigned long int OP2)
  -- Function: int mpf_cmp_si (const mpf_t OP1, signed long int OP2)
@@ -3951,16 +3949,14 @@ File: gmp.info,  Node: Float Comparison,  Next: I/O of Floats,  Prev: Float Arit
  -- Function: int mpf_eq (const mpf_t OP1, const mpf_t OP2, mp_bitcnt_t
           op3)
-     Return non-zero if the first OP3 bits of OP1 and OP2 are equal,
-     zero otherwise.  I.e., test if OP1 and OP2 are approximately equal.
-     Caution 1: All version of GMP up to version 4.2.4 compared just
-     whole limbs, meaning sometimes more than OP3 bits, sometimes fewer.
+     *This function is mathematically ill-defined and should not be
+     used.*
-     Caution 2: This function will consider XXX11...111 and XX100...000
-     different, even if ... is replaced by a semi-infinite number of
-     bits.  Such numbers are really just one ulp off, and should be
-     considered equal.
+     Return non-zero if the first OP3 bits of OP1 and OP2 are equal,
+     zero otherwise.  Note that numbers like e.g., 256 (binary
+     100000000) and 255 (binary 11111111) will never be equal by this
+     function's measure, and furthermore that 0 will only be equal to
+     itself.
  -- Function: void mpf_reldiff (mpf_t ROP, const mpf_t OP1, const mpf_t
           OP2)
@@ -3988,7 +3984,7 @@ for a STREAM argument to any of these functions will make them read from
 `stdio.h' before `gmp.h', since that will allow `gmp.h' to define
 prototypes for these functions.
-   See also *note Formatted Output:: and *note Formatted Input::.
+   See also *Note Formatted Output:: and *Note Formatted Input::.
  -- Function: size_t mpf_out_str (FILE *STREAM, int BASE, size_t
           N_DIGITS, const mpf_t OP)
@@ -4062,7 +4058,7 @@ File: gmp.info,  Node: Miscellaneous Float Functions,  Prev: I/O of Floats,  Up:
      the precision of ROP is smaller.
      The variable STATE must be initialized by calling one of the
-     `gmp_randinit' functions (*note Random State Initialization::)
+     `gmp_randinit' functions (*Note Random State Initialization::)
      before invoking this function.
  -- Function: void mpf_random2 (mpf_t ROP, mp_size_t MAX_SIZE, mp_exp_t
@@ -4228,7 +4224,8 @@ For example, {S1P, S1N}.
      Multiply {S1P, N} and S2LIMB, and add the N least significant
      limbs of the product to {RP, N} and write the result to RP.
      Return the most significant limb of the product, plus carry-out
-     from the addition.
+     from the addition.  {S1P, N} and {RP, N} are allowed to overlap
+     provided RP <= S1P.
      This is a low-level function that is a building block for general
      multiplication as well as other operations in GMP.  It is written
@@ -4239,7 +4236,8 @@ For example, {S1P, S1N}.
      Multiply {S1P, N} and S2LIMB, and subtract the N least significant
      limbs of the product from {RP, N} and write the result to RP.
      Return the most significant limb of the product, plus borrow-out
-     from the subtraction.
+     from the subtraction.  {S1P, N} and {RP, N} are allowed to overlap
+     provided RP <= S1P.
      This is a low-level function that is a building block for general
      multiplication and division as well as other operations in GMP.
@@ -4304,6 +4302,13 @@ For example, {S1P, S1N}.
      [This function is obsolete.  Please call `mpn_tdiv_qr' instead for
      best performance.]
+ -- Function: void mpn_divexact_1 (mp_limb_t * RP, const mp_limb_t *
+          SP, mp_size_t N, mp_limb_t D)
+     Divide {SP, N} by D, expecting it to divide exactly, and writing
+     the result to {RP, N}. If D doesn't divide exactly, the value
+     written to {RP, N} is undefined. The areas at RP and SP have to be
+     identical or completely separate, not partially overlapping.
  -- Macro: mp_limb_t mpn_divexact_by3 (mp_limb_t *RP, mp_limb_t *SP,
           mp_size_t N)
  -- Function: mp_limb_t mpn_divexact_by3c (mp_limb_t *RP, mp_limb_t
@@ -4326,8 +4331,8 @@ For example, {S1P, S1N}.
      c satisfy c*b^n + a-i = 3*q, where b=2^GMP_NUMB_BITS.  The return
      c is always 0, 1 or 2, and the initial carry i must also be 0, 1
      or 2 (these are both borrows really).  When c=0 clearly q=(a-i)/3.
-     When c!=0, the remainder (a-i) mod 3 is given by 3-c, because b ==
-     1 mod 3 (when `mp_bits_per_limb' is even, which is always so
+     When c!=0, the remainder (a-i) mod 3 is given by 3-c, because b
+     == 1 mod 3 (when `mp_bits_per_limb' is even, which is always so
      currently).
  -- Function: mp_limb_t mpn_mod_1 (const mp_limb_t *S1P, mp_size_t S1N,
@@ -4364,6 +4369,9 @@ For example, {S1P, S1N}.
      Compare {S1P, N} and {S2P, N} and return a positive value if S1 >
      S2, 0 if they are equal, or a negative value if S1 < S2.
+ -- Function: int mpn_zero_p (const mp_limb_t *SP, mp_size_t N)
+     Test {SP, N} and return 1 if the operand is zero, 0 otherwise.
  -- Function: mp_size_t mpn_gcd (mp_limb_t *RP, mp_limb_t *XP,
           mp_size_t XN, mp_limb_t *YP, mp_size_t YN)
      Set {RP, RETVAL} to the greatest common divisor of {XP, XN} and
@@ -4627,8 +4635,15 @@ leaky `mpn_add_n' and `mpn_sub_n'.  (3) Alpha ev6 has a leaky
      `mpn_add_1' which are O(1) on average. They require scratch space
      of `mpn_sec_add_1_itch(N)' and `mpn_sec_sub_1_itch(N)' limbs,
      respectively, to be passed in the TP parameter. The scratch space
-     requirements are guaranteed to increase monotonously in the
-     operand size.
+     requirements are guaranteed to be at most N limbs, and increase
+     monotonously in the operand size.
+ -- Function: void mpn_cnd_swap (mp_limb_t CND, volatile mp_limb_t *AP,
+          volatile mp_limb_t *BP, mp_size_t N)
+     If CND is non-zero, swaps the contents of the areas {AP,N} and
+     {BP,N}. Otherwise, the areas are left unmodified.  Implemented
+     using logical operations on the limbs, with the same memory
+     accesses independent of the value of CND.
  -- Function: void mpn_sec_mul (mp_limb_t *RP, const mp_limb_t *AP,
           mp_size_t AN, const mp_limb_t *BP, mp_size_t BN, mp_limb_t
@@ -4813,7 +4828,7 @@ one of the `gmp_randinit' functions, and can be seeded with one of the
 `gmp_randseed' functions.
    The functions actually generating random numbers are described in
-*note Integer Random Numbers::, and *note Miscellaneous Float
+*Note Integer Random Numbers::, and *Note Miscellaneous Float
 Functions::.
    The older style random number functions don't accept a
@@ -5097,7 +5112,7 @@ File: gmp.info,  Node: Formatted Output Functions,  Next: C++ Formatted Output,
 Each of the following functions is similar to the corresponding C
 library function.  The basic `printf' forms take a variable argument
-list.  The `vprintf' forms take an argument pointer, see *note Variadic
+list.  The `vprintf' forms take an argument pointer, see *Note Variadic
 Functions: (libc)Variadic Functions, or `man 3 va_start'.
    It should be emphasised that if a format string is invalid, or the
@@ -5178,7 +5193,7 @@ shouldn't normally occur.
      These functions are available only when the C library provides the
      obstack feature, which probably means only on GNU systems, see
-     *note Obstacks: (libc)Obstacks.
+     *Note Obstacks: (libc)Obstacks.
 File: gmp.info,  Node: C++ Formatted Output,  Prev: Formatted Output Functions,  Up: Formatted Output
@@ -5241,7 +5256,7 @@ way, for example,
    But note that `ostream' output (and `istream' input, *note C++
 Formatted Input::) is the only overloading available for the GMP types
 and that for instance using `+' with an `mpz_t' will have unpredictable
-results.  For classes with overloading, see *note C++ Class Interface::.
+results.  For classes with overloading, see *Note C++ Class Interface::.
 File: gmp.info,  Node: Formatted Input,  Next: C++ Class Interface,  Prev: Formatted Output,  Up: Top
@@ -5389,7 +5404,7 @@ File: gmp.info,  Node: Formatted Input Functions,  Next: C++ Formatted Input,  P
 Each of the following functions is similar to the corresponding C
 library function.  The plain `scanf' forms take a variable argument
-list.  The `vscanf' forms take an argument pointer, see *note Variadic
+list.  The `vscanf' forms take an argument pointer, see *Note Variadic
 Functions: (libc)Variadic Functions, or `man 3 va_start'.
    It should be emphasised that if a format string is invalid, or the
@@ -5489,7 +5504,7 @@ way, for example,
    But note that `istream' input (and `ostream' output, *note C++
 Formatted Output::) is the only overloading available for the GMP types
 and that for instance using `+' with an `mpz_t' will have unpredictable
-results.  For classes with overloading, see *note C++ Class Interface::.
+results.  For classes with overloading, see *Note C++ Class Interface::.
 File: gmp.info,  Node: C++ Class Interface,  Next: Custom Allocation,  Prev: Formatted Input,  Up: Top
@@ -5674,6 +5689,8 @@ File: gmp.info,  Node: C++ Interface Integers,  Next: C++ Interface Rationals,
  -- Function: int mpz_class::set_str (const string& STR, int BASE)
  -- Function: int sgn (mpz_class OP)
  -- Function: mpz_class sqrt (mpz_class OP)
+ -- Function: mpz_class gcd (mpz_class OP1, mpz_class OP2)
+ -- Function: mpz_class lcm (mpz_class OP1, mpz_class OP2)
  -- Function: void mpz_class::swap (mpz_class& OP)
  -- Function: void swap (mpz_class& OP1, mpz_class& OP2)
      These functions provide a C++ class interface to the corresponding
@@ -5737,7 +5754,7 @@ called.
      Other rationals can be built as `-1_mpq/2' or `0xb_mpq/123456_mpz'.
  -- Function: void mpq_class::canonicalize ()
-     Put an `mpq_class' into canonical form, as per *note Rational
+     Put an `mpq_class' into canonical form, as per *Note Rational
      Number Functions::.  All arithmetic operators require their
      operands in canonical form, and will return results in canonical
      form.
@@ -6695,8 +6712,8 @@ File: gmp.info,  Node: FFT Multiplication,  Next: Other Multiplication,  Prev: H
 -------------------------
 At large to very large sizes a Fermat style FFT multiplication is used,
-following Sch�nhage and Strassen (*note References::).  Descriptions of
-FFTs in various forms can be found in many textbooks, for instance
+following Scho"nhage and Strassen (*note References::).  Descriptions
+of FFTs in various forms can be found in many textbooks, for instance
 Knuth section 4.3.3 part C or Lipson chapter IX.  A brief description
 of the form used in GMP is given here.
@@ -6883,7 +6900,7 @@ low, either with a hardware divide instruction or a multiplication by
 inverse, whichever is best on a given CPU.
    The multiply by inverse follows "Improved division by invariant
-integers" by M�ller and Granlund (*note References::) and is
+integers" by Mo"ller and Granlund (*note References::) and is
 implemented as `udiv_qrnnd_preinv' in `gmp-impl.h'.  The idea is to
 have a fixed-point approximation to 1/d (see `invert_limb') and then
 multiply by the high limb (plus one bit) of the dividend to get a
@@ -6942,7 +6959,7 @@ the top end of the dividend.  With a normalized divisor (most
 significant bit set), each quotient limb can be formed with a 2x1
 division and a 1x1 multiplication plus some subtractions.  The 2x1
 division is by the high limb of the divisor and is done either with a
-hardware divide or a multiply by inverse (the same as in *note Single
+hardware divide or a multiply by inverse (the same as in *Note Single
 Limb Division::) whichever is faster.  Such a quotient is sometimes one
 too big, requiring an addback of the divisor, but that happens rarely.
@@ -7007,67 +7024,3 @@ inverse.
 plain Barrett algorithm.  For a 2n/n division, the inverse will be just
 ceil(n/2) limbs.
-File: gmp.info,  Node: Exact Division,  Next: Exact Remainder,  Prev: Block-Wise Barrett Division,  Up: Division Algorithms
-15.2.5 Exact Division
----------------------
-A so-called exact division is when the dividend is known to be an exact
-multiple of the divisor.  Jebelean's exact division algorithm uses this
-knowledge to make some significant optimizations (*note References::).
-   The idea can be illustrated in decimal for example with 368154
-divided by 543.  Because the low digit of the dividend is 4, the low
-digit of the quotient must be 8.  This is arrived at from 4*7 mod 10,
-using the fact 7 is the modular inverse of 3 (the low digit of the
-divisor), since 3*7 == 1 mod 10.  So 8*543=4344 can be subtracted from
-the dividend leaving 363810.  Notice the low digit has become zero.
-   The procedure is repeated at the second digit, with the next
-quotient digit 7 (7 == 1*7 mod 10), subtracting 7*543=3801, leaving
-325800.  And finally at the third digit with quotient digit 6 (8*7 mod
-10), subtracting 6*543=3258 leaving 0.  So the quotient is 678.
-   Notice however that the multiplies and subtractions don't need to
-extend past the low three digits of the dividend, since that's enough
-to determine the three quotient digits.  For the last quotient digit no
-subtraction is needed at all.  On a 2NxN division like this one, only
-about half the work of a normal basecase division is necessary.
-   For an NxM exact division producing Q=N-M quotient limbs, the saving
-over a normal basecase division is in two parts.  Firstly, each of the
-Q quotient limbs needs only one multiply, not a 2x1 divide and
-multiply.  Secondly, the crossproducts are reduced when Q>M to
-Q*M-M*(M+1)/2, or when Q<=M to Q*(Q-1)/2.  Notice the savings are
-complementary.  If Q is big then many divisions are saved, or if Q is
-small then the crossproducts reduce to a small number.
-   The modular inverse used is calculated efficiently by `binvert_limb'
-in `gmp-impl.h'.  This does four multiplies for a 32-bit limb, or six
-for a 64-bit limb.  `tune/modlinv.c' has some alternate implementations
-that might suit processors better at bit twiddling than multiplying.
-   The sub-quadratic exact division described by Jebelean in "Exact
-Division with Karatsuba Complexity" is not currently implemented.  It
-uses a rearrangement similar to the divide and conquer for normal
-division (*note Divide and Conquer Division::), but operating from low
-to high.  A further possibility not currently implemented is
-"Bidirectional Exact Integer Division" by Krandick and Jebelean which
-forms quotient limbs from both the high and low ends of the dividend,
-and can halve once more the number of crossproducts needed in a 2NxN
-division.
-   A special case exact division by 3 exists in `mpn_divexact_by3',
-supporting Toom-3 multiplication and `mpq' canonicalizations.  It forms
-quotient digits with a multiply by the modular inverse of 3 (which is
-`0xAA..AAB') and uses two comparisons to determine a borrow for the next
-limb.  The multiplications don't need to be on the dependent chain, as
-long as the effect of the borrows is applied, which can help chips with
-pipelined multipliers.
-Local Variables:
-coding: iso-8859-1
-End: