[DEV] add v1.76.0

libs/integer/doc/html/index.html

@@ -1,6 +1,6 @@
 <html>
 <head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
 <title>Boost.Integer</title>
 <link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
 <meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
@@ -37,12 +37,12 @@
 <span class="firstname">John</span> <span class="surname">Maddock</span>
 </h3></div>
 </div></div>
-<div><p class="copyright">Copyright &#169; 2001-2009 Beman
+<div><p class="copyright">Copyright © 2001-2009 Beman
       Dawes, Daryle Walker, Gennaro Prota, John Maddock</p></div>
 <div><div class="legalnotice">
 <a name="boost_integer.legal"></a><p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+        file LICENSE_1_0.txt or copy at <a href="https://www.boost.org/LICENSE_1_0.txt" target="_top">https://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
 </div></div>
 </div>
@@ -56,6 +56,8 @@
 <dt><span class="section"><a href="boost_integer/integer.html">Integer Type Selection</a></span></dt>
 <dt><span class="section"><a href="boost_integer/gcd_lcm.html">Greatest Common Divisor and Least
     Common Multiple</a></span></dt>
+<dt><span class="section"><a href="boost_integer/extended_euclidean.html">Extended Euclidean Algorithm</a></span></dt>
+<dt><span class="section"><a href="boost_integer/mod_inverse.html">Modular Multiplicative Inverse</a></span></dt>
 <dt><span class="section"><a href="boost_integer/mask.html">Integer Masks</a></span></dt>
 <dt><span class="section"><a href="boost_integer/log2.html">Compile Time log2 Calculation</a></span></dt>
 <dt><span class="section"><a href="boost_integer/minmax.html">Compile time min/max calculation</a></span></dt>
@@ -237,12 +239,50 @@
               </p>
             </td>
 </tr>
+<tr>
+<td>
+              <p>
+                <a class="link" href="boost_integer/extended_euclidean.html" title="Extended Euclidean Algorithm">Extended Euclidean
+                algorithm</a>.
+              </p>
+            </td>
+<td>
+              <p>
+                <code class="literal"><a href="../../../../boost/integer/extended_euclidean.hpp" target="_top">&lt;boost/integer/extended_euclidean.hpp&gt;</a></code>
+              </p>
+            </td>
+<td>
+              <p>
+                Solves <span class="emphasis"><em>mx + ny = gcd(x,y)</em></span> for <span class="emphasis"><em>x</em></span>
+                and <span class="emphasis"><em>y</em></span>.
+              </p>
+            </td>
+</tr>
+<tr>
+<td>
+              <p>
+                <a class="link" href="boost_integer/mod_inverse.html" title="Modular Multiplicative Inverse">Modular multiplicative
+                inverse</a>.
+              </p>
+            </td>
+<td>
+              <p>
+                <code class="literal"><a href="../../../../boost/integer/mod_inverse.hpp" target="_top">&lt;boost/integer/mod_inverse.hpp&gt;</a></code>
+              </p>
+            </td>
+<td>
+              <p>
+                Given <span class="emphasis"><em>a</em></span> and <span class="emphasis"><em>m</em></span>, solves
+                <span class="emphasis"><em>ax</em></span> = 1 mod <span class="emphasis"><em>m</em></span> for <span class="emphasis"><em>x</em></span>.
+              </p>
+            </td>
+</tr>
 </tbody>
 </table></div>
 </div>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: December 14, 2017 at 00:16:53 GMT</small></p></td>
+<td align="left"><p><small>Last revised: April 13, 2021 at 16:28:01 GMT</small></p></td>
 <td align="right"><div class="copyright-footer"></div></td>
 </tr></table>
 <hr>