--- rpl/lapack/lapack/dlaruv.f 2012/12/14 14:22:35 1.12
+++ rpl/lapack/lapack/dlaruv.f 2017/06/17 10:53:56 1.15
@@ -2,24 +2,24 @@
*
* =========== DOCUMENTATION ===========
*
-* Online html documentation available at
-* http://www.netlib.org/lapack/explore-html/
+* Online html documentation available at
+* http://www.netlib.org/lapack/explore-html/
*
*> \htmlonly
-*> Download DLARUV + dependencies
-*>
-*> [TGZ]
-*>
-*> [ZIP]
-*>
+*> Download DLARUV + dependencies
+*>
+*> [TGZ]
+*>
+*> [ZIP]
+*>
*> [TXT]
-*> \endhtmlonly
+*> \endhtmlonly
*
* Definition:
* ===========
*
* SUBROUTINE DLARUV( ISEED, N, X )
-*
+*
* .. Scalar Arguments ..
* INTEGER N
* ..
@@ -27,7 +27,7 @@
* INTEGER ISEED( 4 )
* DOUBLE PRECISION X( N )
* ..
-*
+*
*
*> \par Purpose:
* =============
@@ -67,14 +67,14 @@
* Authors:
* ========
*
-*> \author Univ. of Tennessee
-*> \author Univ. of California Berkeley
-*> \author Univ. of Colorado Denver
-*> \author NAG Ltd.
+*> \author Univ. of Tennessee
+*> \author Univ. of California Berkeley
+*> \author Univ. of Colorado Denver
+*> \author NAG Ltd.
*
-*> \date September 2012
+*> \date December 2016
*
-*> \ingroup auxOTHERauxiliary
+*> \ingroup OTHERauxiliary
*
*> \par Further Details:
* =====================
@@ -95,10 +95,10 @@
* =====================================================================
SUBROUTINE DLARUV( ISEED, N, X )
*
-* -- LAPACK auxiliary routine (version 3.4.2) --
+* -- LAPACK auxiliary routine (version 3.7.0) --
* -- LAPACK is a software package provided by Univ. of Tennessee, --
* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
-* September 2012
+* December 2016
*
* .. Scalar Arguments ..
INTEGER N
@@ -392,7 +392,7 @@
I4 = ISEED( 4 )
*
DO 10 I = 1, MIN( N, LV )
-*
+*
20 CONTINUE
*
* Multiply the seed by i-th power of the multiplier modulo 2**48
@@ -419,11 +419,11 @@
* If a real number has n bits of precision, and the first
* n bits of the 48-bit integer above happen to be all 1 (which
* will occur about once every 2**n calls), then X( I ) will
-* be rounded to exactly 1.0.
+* be rounded to exactly 1.0.
* Since X( I ) is not supposed to return exactly 0.0 or 1.0,
* the statistically correct thing to do in this situation is
* simply to iterate again.
-* N.B. the case X( I ) = 0.0 should not be possible.
+* N.B. the case X( I ) = 0.0 should not be possible.
I1 = I1 + 2
I2 = I2 + 2
I3 = I3 + 2