Description: upstream documentation -- URL update
 Attempt to update the URL provided in the package Guides;
 meant to be submitted to the upstream maintainer team.
Origin: debian
Forwarded: no-more-maintained-by-upstream
Author: Jerome Benoit <calculus@rezozer.net>
Last-Update: 2015-05-18

--- a/mylib/gdef.tex
+++ b/mylib/gdef.tex
@@ -161,7 +161,7 @@
   is available.  GMP is a portable library written in C for arbitrary
   precision arithmetic on integers, rational numbers, and floating-point
   numbers. See the Free Software Foundation web site at
-  \url{http://www.gnu.org/software/gmp/manual}. A few random number
+  \url{https://gmplib.org/manual/}. A few random number
   generators in library TestU01 use arbitrary large integers, and they
   have been implemented with GMP functions. If one wants to use GMP, the
   GMP header file (\texttt{gmp.h}) must be in the  search path 
--- a/testu01/ugranger.tex
+++ b/testu01/ugranger.tex
@@ -3,7 +3,7 @@
 This module collects combined generators implemented by
 Jacinthe Granger-Pich\'e for her master thesis. 
 Some of the generators in this module use the GNU multiprecision package GMP. 
-%% (see the web site at \url{http://www.gnu.org/software/gmp/gmp.html}).
+%% (see the web site at \url{https://gmplib.org/}).
 The macro {\tt USE\_GMP} is defined in module {\tt gdef} in directory
 {\tt mylib}. \index{Generator!Granger-Pich\'e}%
 
--- a/testu01/ulcg.tex
+++ b/testu01/ulcg.tex
@@ -13,7 +13,7 @@
 by Wichmann and Hill \cite{rWIC82a}.
 See \cite{rLEC91b} for details.
 Some of the implementations use the GNU multiprecision package GMP. 
-%% (see the web site at \url{http://www.gnu.org/software/gmp/gmp.html}).
+%% (see the web site at \url{https://gmplib.org/}).
 The macro {\tt USE\_GMP} is defined in module {\tt gdef} in directory
 {\tt mylib}.
 
--- a/testu01/umrg.tex
+++ b/testu01/umrg.tex
@@ -17,7 +17,7 @@
 MRGs, but are implemented here nonetheless.
 
 Some of the generators in this module use the GNU multiprecision package GMP. 
-%% (see the web site at \url{http://www.gnu.org/software/gmp/gmp.html}).
+%% (see the web site at \url{https://gmplib.org/}).
 The macro {\tt USE\_GMP} is defined in module {\tt gdef} in directory
 {\tt mylib}.
 
@@ -140,7 +140,7 @@
    $k=55$, $r=24$ corresponds to $X_n = (X_{n-55} -  X_{n-24}) \bmod 2^t$,
    while $k=24$, $r=55$ corresponds to $X_n = (X_{n-24} -  X_{n-55}) \bmod 2^t$.
  \hrichard {Une r\'ef\'erence int\'eressante est: 
-   \url{http://nhse.cs.rice.edu/NHSEreview/RNG/node11.html}.}
+   \url{http://wotug.org/parallel/nhse/NHSEreview/RNG/node11.html}.}
 \iffalse  %%%%%%%%
 \begin{center}
 \begin{tabular}{|@{\qquad}c@{\qquad}@{\qquad}c@{\qquad}|}\hline
--- a/testu01/intro.tex
+++ b/testu01/intro.tex
@@ -459,7 +459,7 @@
 ciphers, block ciphers, and key generators used in cryptology
 (see \url{http://www.isrc.qut.edu.au/resource/cryptx/}).
 The GNU scientific library {\tt gsl}, currently under development
-(see \url{http://sources.redhat.com/gsl/ref/gsl-ref_10.html}),
+(see \url{https://www.gnu.org/software/gsl/manual/html_node/}),
 implements a large set of well-tested RNGs, but so far no statistical
 test per se.
 
--- a/testu01/ubrent.tex
+++ b/testu01/ubrent.tex
@@ -2,8 +2,8 @@
 
 This module implements some random number generators proposed by Richard
   P. Brent (Web pages at \index{Generator!Xorshift}%
-\url{http://web.comlab.ox.ac.uk/oucl/work/richard.brent/}
-and \url{http://wwwmaths.anu.edu.au/~brent/random.html}).
+\url{http://maths-people.anu.edu.au/~brent/}
+and \url{http://maths-people.anu.edu.au/~brent/random.html}).
 
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@@ -48,7 +48,7 @@
 %
 The following table gives parameters recommended by Brent
 for the \textit{best} 32-bit generators of this kind
-according to the criteria given in \url{ftp://ftp.comlab.ox.ac.uk/pub/Documents/techpapers/Richard.Brent/random/xortable.txt}.
+according to the criteria given in \url{http://maths-people.anu.edu.au/~brent/ftp/random/xortable.txt}.
 \endtab
 %
 \begin {table}
@@ -105,7 +105,7 @@
   and $r$ must be a power of 2.
 The following table gives parameters recommended by Brent
 for the \textit{best} generators of their kind
-according to the criteria given in \url{ftp://ftp.comlab.ox.ac.uk/pub/Documents/techpapers/Richard.Brent/random/xortable.txt}.
+according to the criteria given in \url{http://maths-people.anu.edu.au/~brent/ftp/random/xortable.txt}.
 \endtab
 %
 \begin {table}
@@ -167,7 +167,7 @@
   \tab This is the % 32-bit (on 32-bit machine) or 64-bit (on 64-bit machine)
   integer random number generator  \textit{xor4096i} with period at least
  $(2^{4096}-1)$ proposed by Brent (see 
-  \url{http://wwwmaths.anu.edu.au/~brent/random.html}).  This is the
+  \url{http://maths-people.anu.edu.au/~brent/random.html}).  This is the
    {2006 version} of the generators \textit{xor4096s} and
   \textit{xor4096l}. It has a different initialization and a slightly 
   different algorithm from the 2004 version.
@@ -179,7 +179,7 @@
 unif01_Gen* ubrent_CreateXor4096r (unsigned long seed);
 \endcode
   \tab This is the floating-point generator \textit{xor4096r} proposed by Brent
-  (see \url{http://wwwmaths.anu.edu.au/~brent/random.html}).
+  (see \url{http://maths-people.anu.edu.au/~brent/random.html}).
   This is the {2006 version} of the generators \textit{xor4096f} and
   \textit{xor4096d}. It is based on \textit{xor4096i} implemented in
   \texttt{ubrent\_CreateXor4096i} above. The initial seed is \texttt{seed}.
--- a/probdist/fdist.tex
+++ b/probdist/fdist.tex
@@ -200,7 +200,7 @@
  \texttt{ndig} is the number of decimal digits of accuracy.
   The code was translated from the Fortran program written
    by T. G. Donnelly \cite{tDON73a} and copyrighted by the ACM (see 
-  \url{http://www.acm.org/pubs/copyright_policy/#Notice}). The absolute error
+  \url{http://www.acm.org/publications/policies/copyright_policy}). The absolute error
   is expected to be smaller than $10^{-d}$, where $d={}$\texttt{ndig}.
   Restriction: \texttt{ndig}${} \le 15$.
  \endtab
--- a/testu01/usoft.tex
+++ b/testu01/usoft.tex
@@ -25,8 +25,8 @@
 \index{Generator!S-PLUS}%
     {\em S-PLUS\/} \cite{tRIP94a,tSPL00a}. It is based on Marsaglia's Super-Duper
    generator of 1973 (see the description of \texttt{SupDup73} on page
-  \pageref{gen:SupDup73} of this guide). See also the Web page at
-  \url{http://www.insightful.com/support/faqdetail.asp?FAQID=166&IsArchive=0}.
+  \pageref{gen:SupDup73} of this guide).
+%%   See also the Web page at \url{http://www.insightful.com/support/faqdetail.asp?FAQID=166&IsArchive=0}.
    The generator never returns 0.
    Restrictions: {\tt $0 <$ S1 $< 2^{31}-1$} and {\tt $0 <$ S2 $< 2^{31}-1$}.
   \endtab
@@ -118,7 +118,7 @@
   An ``approximation'' of the {RAND} generator included in
 % \index{Generator!Excel}%
   Microsoft Excel 1997, which uses the recurrence
-  (see \url{http://support.microsoft.com/directory}):
+  (see \url{https://support.microsoft.com/en-us/kb/86523/}):
 $$
    u_{i}  = (9821.0\, u_{i-1} + 0.211327) \bmod 1,
 $$
@@ -143,7 +143,7 @@
 \index{Generator!Excel} \label{gen:Excel2003}%
 \index{Generator!Wichmann-Hill}%
   Microsoft Office Excel 2003
- (see \url{http://support.microsoft.com/default.aspx?scid=kb;en-us;828795}).
+ (see \url{https://support.microsoft.com/en-us/kb/828795/}).
   It uses the Wichmann-Hill generator \cite{rWIC82a,rWIC87a}
 \begin{eqnarray*}
       x_{i} &=& 170 \, x_{i-1} \bmod 30323 \\
--- a/testu01/scomp.tex
+++ b/testu01/scomp.tex
@@ -121,7 +121,7 @@
   The statistic $T_n$ takes only integer values, with probabilities 
   given by (see \cite{rRUK01a}):
  % Nist Special publication 800-22, May 15,
- % 2001, p. 86, at \url{http://csrc.nist.gov/rng/index.html}.
+ % 2001, p. 86, at \url{http://csrc.nist.gov/rng/}.
    \begin{eqnarray*}
      P[T = k] & = & \left\{\begin{array}{ll} 
           0.5 & \mbox{ for } k=0, \\[4pt]