[libmath-gsl-perl] 02/05: Another spelling errors
Wolfgang Fütterer
debian at wlf-online.de
Sun Mar 27 19:38:20 UTC 2016
This is an automated email from the git hooks/post-receive script.
wlfuetter-guest pushed a commit to branch master
in repository libmath-gsl-perl.
commit ebb84ed7a5dd78c74e237fd6fba1c146e36c7c64
Author: Wolfgang Fütterer <debian at wlf-online.de>
Date: Sun Mar 27 21:00:16 2016 +0200
Another spelling errors
---
debian/patches/0001-Hardening-Build-Patch.patch | 3 +-
.../0002-Fixed-spelling-errors-in-man.patch | 1999 +++++++++++++++++---
2 files changed, 1689 insertions(+), 313 deletions(-)
diff --git a/debian/patches/0001-Hardening-Build-Patch.patch b/debian/patches/0001-Hardening-Build-Patch.patch
index 67d27eb..0f60a30 100644
--- a/debian/patches/0001-Hardening-Build-Patch.patch
+++ b/debian/patches/0001-Hardening-Build-Patch.patch
@@ -2,13 +2,12 @@ Description: Add hardening flags
Forwarded; no
Author: Wolfgang Fütterer <debian at wlf-online.de>
Last-Update: 2015-11-25
-
---
Build.PL | 3 +++
1 file changed, 3 insertions(+)
diff --git a/Build.PL b/Build.PL
-index e6075d2..625bd8b 100644
+index e6075d2..7c3940a 100644
--- a/Build.PL
+++ b/Build.PL
@@ -46,6 +46,9 @@ $swig_flags = ' -I/usr/include' if $ccflags =~ /^\s*$/;
diff --git a/debian/patches/0002-Fixed-spelling-errors-in-man.patch b/debian/patches/0002-Fixed-spelling-errors-in-man.patch
index 078cdac..d122a8a 100644
--- a/debian/patches/0002-Fixed-spelling-errors-in-man.patch
+++ b/debian/patches/0002-Fixed-spelling-errors-in-man.patch
@@ -1,6 +1,7 @@
-From: =?utf-8?q?Wolfgang_F=C3=BCtterer?= <debian at wlf-online.de>
-Date: Wed, 17 Feb 2016 12:24:52 +0100
-Subject: Fixed spelling errors in man
+Description: Fixed spelling errors in man
+Forwarded; no
+Author: Wolfgang Fütterer <debian at wlf-online.de>
+Last-Update: 2016-03-27
---
lib/Math/GSL.pm | 2 +-
@@ -15,8 +16,9 @@ Subject: Fixed spelling errors in man
lib/Math/GSL/FFT.pm | 2 +-
lib/Math/GSL/Fit.pm | 2 +-
lib/Math/GSL/Heapsort.pm | 2 +-
+ lib/Math/GSL/Histogram2D.pm | 4 +--
lib/Math/GSL/Integration.pm | 2 +-
- lib/Math/GSL/Linalg.pm | 2 +-
+ lib/Math/GSL/Linalg.pm | 30 +++++++++++-----------
lib/Math/GSL/Matrix.pm | 18 ++++++-------
lib/Math/GSL/MatrixComplex.pm | 2 +-
lib/Math/GSL/Min.pm | 2 +-
@@ -31,13 +33,13 @@ Subject: Fixed spelling errors in man
lib/Math/GSL/QRNG.pm | 2 +-
lib/Math/GSL/RNG.pm | 2 +-
lib/Math/GSL/Randist.pm | 2 +-
- lib/Math/GSL/SF.pm | 2 +-
+ lib/Math/GSL/SF.pm | 4 +--
lib/Math/GSL/Siman.pm | 2 +-
lib/Math/GSL/Sort.pm | 2 +-
lib/Math/GSL/Spline.pm | 2 +-
lib/Math/GSL/Statistics.pm | 4 +--
lib/Math/GSL/Sys.pm | 2 +-
- lib/Math/GSL/Vector.pm | 2 +-
+ lib/Math/GSL/Vector.pm | 24 ++++++++---------
pm/Math/GSL/BLAS.pm.1.11 | 54 +++++++++++++++++++--------------------
pm/Math/GSL/BLAS.pm.1.12 | 54 +++++++++++++++++++--------------------
pm/Math/GSL/BLAS.pm.1.13 | 54 +++++++++++++++++++--------------------
@@ -104,18 +106,24 @@ Subject: Fixed spelling errors in man
pm/Math/GSL/Heapsort.pm.1.14 | 2 +-
pm/Math/GSL/Heapsort.pm.1.15 | 2 +-
pm/Math/GSL/Heapsort.pm.1.16 | 2 +-
+ pm/Math/GSL/Histogram2D.pm.1.11 | 4 +--
+ pm/Math/GSL/Histogram2D.pm.1.12 | 4 +--
+ pm/Math/GSL/Histogram2D.pm.1.13 | 4 +--
+ pm/Math/GSL/Histogram2D.pm.1.14 | 4 +--
+ pm/Math/GSL/Histogram2D.pm.1.15 | 4 +--
+ pm/Math/GSL/Histogram2D.pm.1.16 | 4 +--
pm/Math/GSL/Integration.pm.1.11 | 2 +-
pm/Math/GSL/Integration.pm.1.12 | 2 +-
pm/Math/GSL/Integration.pm.1.13 | 2 +-
pm/Math/GSL/Integration.pm.1.14 | 2 +-
pm/Math/GSL/Integration.pm.1.15 | 2 +-
pm/Math/GSL/Integration.pm.1.16 | 2 +-
- pm/Math/GSL/Linalg.pm.1.11 | 2 +-
- pm/Math/GSL/Linalg.pm.1.12 | 2 +-
- pm/Math/GSL/Linalg.pm.1.13 | 2 +-
- pm/Math/GSL/Linalg.pm.1.14 | 2 +-
- pm/Math/GSL/Linalg.pm.1.15 | 2 +-
- pm/Math/GSL/Linalg.pm.1.16 | 2 +-
+ pm/Math/GSL/Linalg.pm.1.11 | 30 +++++++++++-----------
+ pm/Math/GSL/Linalg.pm.1.12 | 30 +++++++++++-----------
+ pm/Math/GSL/Linalg.pm.1.13 | 30 +++++++++++-----------
+ pm/Math/GSL/Linalg.pm.1.14 | 30 +++++++++++-----------
+ pm/Math/GSL/Linalg.pm.1.15 | 30 +++++++++++-----------
+ pm/Math/GSL/Linalg.pm.1.16 | 30 +++++++++++-----------
pm/Math/GSL/Matrix.pm.1.11 | 18 ++++++-------
pm/Math/GSL/Matrix.pm.1.12 | 18 ++++++-------
pm/Math/GSL/Matrix.pm.1.13 | 18 ++++++-------
@@ -200,12 +208,12 @@ Subject: Fixed spelling errors in man
pm/Math/GSL/Randist.pm.1.14 | 2 +-
pm/Math/GSL/Randist.pm.1.15 | 2 +-
pm/Math/GSL/Randist.pm.1.16 | 2 +-
- pm/Math/GSL/SF.pm.1.11 | 2 +-
- pm/Math/GSL/SF.pm.1.12 | 2 +-
- pm/Math/GSL/SF.pm.1.13 | 2 +-
- pm/Math/GSL/SF.pm.1.14 | 2 +-
- pm/Math/GSL/SF.pm.1.15 | 2 +-
- pm/Math/GSL/SF.pm.1.16 | 2 +-
+ pm/Math/GSL/SF.pm.1.11 | 4 +--
+ pm/Math/GSL/SF.pm.1.12 | 4 +--
+ pm/Math/GSL/SF.pm.1.13 | 4 +--
+ pm/Math/GSL/SF.pm.1.14 | 4 +--
+ pm/Math/GSL/SF.pm.1.15 | 4 +--
+ pm/Math/GSL/SF.pm.1.16 | 4 +--
pm/Math/GSL/Siman.pm.1.11 | 2 +-
pm/Math/GSL/Siman.pm.1.12 | 2 +-
pm/Math/GSL/Siman.pm.1.13 | 2 +-
@@ -236,12 +244,12 @@ Subject: Fixed spelling errors in man
pm/Math/GSL/Sys.pm.1.14 | 2 +-
pm/Math/GSL/Sys.pm.1.15 | 2 +-
pm/Math/GSL/Sys.pm.1.16 | 2 +-
- pm/Math/GSL/Vector.pm.1.11 | 2 +-
- pm/Math/GSL/Vector.pm.1.12 | 2 +-
- pm/Math/GSL/Vector.pm.1.13 | 2 +-
- pm/Math/GSL/Vector.pm.1.14 | 2 +-
- pm/Math/GSL/Vector.pm.1.15 | 2 +-
- pm/Math/GSL/Vector.pm.1.16 | 2 +-
+ pm/Math/GSL/Vector.pm.1.11 | 24 ++++++++---------
+ pm/Math/GSL/Vector.pm.1.12 | 24 ++++++++---------
+ pm/Math/GSL/Vector.pm.1.13 | 24 ++++++++---------
+ pm/Math/GSL/Vector.pm.1.14 | 24 ++++++++---------
+ pm/Math/GSL/Vector.pm.1.15 | 24 ++++++++---------
+ pm/Math/GSL/Vector.pm.1.16 | 24 ++++++++---------
pod/BLAS.pod | 54 +++++++++++++++++++--------------------
pod/BSpline.pod | 2 +-
pod/CBLAS.pod | 2 +-
@@ -253,8 +261,9 @@ Subject: Fixed spelling errors in man
pod/FFT.pod | 2 +-
pod/Fit.pod | 2 +-
pod/Heapsort.pod | 2 +-
+ pod/Histogram2D.pod | 4 +--
pod/Integration.pod | 2 +-
- pod/Linalg.pod | 2 +-
+ pod/Linalg.pod | 30 +++++++++++-----------
pod/Matrix.pod | 18 ++++++-------
pod/MatrixComplex.pod | 2 +-
pod/Min.pod | 2 +-
@@ -269,17 +278,17 @@ Subject: Fixed spelling errors in man
pod/QRNG.pod | 2 +-
pod/RNG.pod | 2 +-
pod/Randist.pod | 2 +-
- pod/SF.pod | 2 +-
+ pod/SF.pod | 4 +--
pod/Siman.pod | 2 +-
pod/Sort.pod | 2 +-
pod/Spline.pod | 2 +-
pod/Statistics.pod | 4 +--
pod/Sys.pod | 2 +-
- pod/Vector.pod | 2 +-
- 273 files changed, 609 insertions(+), 609 deletions(-)
+ pod/Vector.pod | 24 ++++++++---------
+ 281 files changed, 833 insertions(+), 833 deletions(-)
diff --git a/lib/Math/GSL.pm b/lib/Math/GSL.pm
-index 249903d..366939d 100644
+index 9cee4fe..06721df 100644
--- a/lib/Math/GSL.pm
+++ b/lib/Math/GSL.pm
@@ -153,7 +153,7 @@ L<Math::GSL::Statistics> - Statistics Functions
@@ -292,7 +301,7 @@ index 249903d..366939d 100644
L<Math::GSL::Vector> - N-dimensional Vectors
diff --git a/lib/Math/GSL/BLAS.pm b/lib/Math/GSL/BLAS.pm
-index 881d7b5..d76f30e 100644
+index f581498..2c1133d 100644
--- a/lib/Math/GSL/BLAS.pm
+++ b/lib/Math/GSL/BLAS.pm
@@ -266,7 +266,7 @@ The functions of this module are divised into 3 levels:
@@ -445,7 +454,7 @@ index 881d7b5..d76f30e 100644
=head1 AUTHORS
diff --git a/lib/Math/GSL/BSpline.pm b/lib/Math/GSL/BSpline.pm
-index 3a2c67e..5e6a45b 100644
+index 70c1828..3fd15eb 100644
--- a/lib/Math/GSL/BSpline.pm
+++ b/lib/Math/GSL/BSpline.pm
@@ -241,7 +241,7 @@ gsl_bspline_ncoeffs. It is far more efficient to compute all of the basis
@@ -458,7 +467,7 @@ index 3a2c67e..5e6a45b 100644
=back
diff --git a/lib/Math/GSL/CBLAS.pm b/lib/Math/GSL/CBLAS.pm
-index da59ab1..d2dc76e 100644
+index ea3d7e2..d2b5553 100644
--- a/lib/Math/GSL/CBLAS.pm
+++ b/lib/Math/GSL/CBLAS.pm
@@ -704,7 +704,7 @@ This module also contains the following constants :
@@ -471,7 +480,7 @@ index da59ab1..d2dc76e 100644
diff --git a/lib/Math/GSL/CDF.pm b/lib/Math/GSL/CDF.pm
-index d0642e5..a7afa98 100644
+index 8286f92..227e281 100644
--- a/lib/Math/GSL/CDF.pm
+++ b/lib/Math/GSL/CDF.pm
@@ -516,7 +516,7 @@ This is the list of available import tags:
@@ -484,7 +493,7 @@ index d0642e5..a7afa98 100644
diff --git a/lib/Math/GSL/Chebyshev.pm b/lib/Math/GSL/Chebyshev.pm
-index 5cd6c45..0d0e881 100644
+index 910e9db..6b83fd7 100644
--- a/lib/Math/GSL/Chebyshev.pm
+++ b/lib/Math/GSL/Chebyshev.pm
@@ -364,7 +364,7 @@ in $deriv, which must be pre-allocated. Returns a GSL status code.
@@ -497,7 +506,7 @@ index 5cd6c45..0d0e881 100644
=head1 AUTHORS
diff --git a/lib/Math/GSL/Combination.pm b/lib/Math/GSL/Combination.pm
-index 1b82012..30497d0 100644
+index b5e7fc5..3fb52cf 100644
--- a/lib/Math/GSL/Combination.pm
+++ b/lib/Math/GSL/Combination.pm
@@ -325,7 +325,7 @@ sub prev {
@@ -510,7 +519,7 @@ index 1b82012..30497d0 100644
diff --git a/lib/Math/GSL/Deriv.pm b/lib/Math/GSL/Deriv.pm
-index 1a29db6..c3ead42 100644
+index 694ec6a..1744f54 100644
--- a/lib/Math/GSL/Deriv.pm
+++ b/lib/Math/GSL/Deriv.pm
@@ -291,7 +291,7 @@ function is evaluated at $x and $x+$h.
@@ -523,7 +532,7 @@ index 1a29db6..c3ead42 100644
=head1 AUTHORS
diff --git a/lib/Math/GSL/Eigen.pm b/lib/Math/GSL/Eigen.pm
-index facd9d4..7414b7c 100644
+index 6798161..0c2346d 100644
--- a/lib/Math/GSL/Eigen.pm
+++ b/lib/Math/GSL/Eigen.pm
@@ -1048,7 +1048,7 @@ This module also includes these constants :
@@ -536,7 +545,7 @@ index facd9d4..7414b7c 100644
diff --git a/lib/Math/GSL/FFT.pm b/lib/Math/GSL/FFT.pm
-index 8acb44a..408ff60 100644
+index be52e40..53c5f45 100644
--- a/lib/Math/GSL/FFT.pm
+++ b/lib/Math/GSL/FFT.pm
@@ -943,7 +943,7 @@ This module also includes the following constants :
@@ -549,7 +558,7 @@ index 8acb44a..408ff60 100644
diff --git a/lib/Math/GSL/Fit.pm b/lib/Math/GSL/Fit.pm
-index f2b0c53..947cae7 100644
+index af3bfbd..b63517c 100644
--- a/lib/Math/GSL/Fit.pm
+++ b/lib/Math/GSL/Fit.pm
@@ -169,7 +169,7 @@ and y_err.
@@ -562,7 +571,7 @@ index f2b0c53..947cae7 100644
diff --git a/lib/Math/GSL/Heapsort.pm b/lib/Math/GSL/Heapsort.pm
-index 31d00d8..64d7534 100644
+index 4b22a54..aa216d2 100644
--- a/lib/Math/GSL/Heapsort.pm
+++ b/lib/Math/GSL/Heapsort.pm
@@ -159,7 +159,7 @@ Here is a list of all the functions in this module :
@@ -574,8 +583,26 @@ index 31d00d8..64d7534 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+diff --git a/lib/Math/GSL/Histogram2D.pm b/lib/Math/GSL/Histogram2D.pm
+index 7365740..93a1d0c 100644
+--- a/lib/Math/GSL/Histogram2D.pm
++++ b/lib/Math/GSL/Histogram2D.pm
+@@ -334,11 +334,11 @@ C<gsl_histogram2d_set_ranges_uniform> or this function will return undef.
+
+ =item C<gsl_histogram2d_max_val($h)> - This function returns the maximum value contained in the histogram bins.
+
+-=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
++=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
+
+ =item C<gsl_histogram2d_min_val($h)> - This function returns the minimum value contained in the histogram bins.
+
+-=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
++=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
+
+ =item C<gsl_histogram2d_xmean($h)> - This function returns the mean of the histogrammed x variable, where the histogram is regarded as a probability distribution. Negative bin values are ignored for the purposes of this calculation.
+
diff --git a/lib/Math/GSL/Integration.pm b/lib/Math/GSL/Integration.pm
-index 9332455..497409c 100644
+index 9d829b5..7f447b0 100644
--- a/lib/Math/GSL/Integration.pm
+++ b/lib/Math/GSL/Integration.pm
@@ -781,7 +781,7 @@ The integral is divergent, or too slowly convergent to be integrated numerically
@@ -588,9 +615,77 @@ index 9332455..497409c 100644
=head1 AUTHORS
diff --git a/lib/Math/GSL/Linalg.pm b/lib/Math/GSL/Linalg.pm
-index f017caf..3d486a1 100644
+index 59f29f8..7d6fe33 100644
--- a/lib/Math/GSL/Linalg.pm
+++ b/lib/Math/GSL/Linalg.pm
+@@ -551,7 +551,7 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_complex_householder_transform
+
+-=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_householder_mh($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the right-hand side of the matrix $A. On output the result A P is stored in $A.
+
+@@ -565,7 +565,7 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_complex_householder_hv($tau, $v, $w) - Does the same operation than gsl_linalg_householder_hv but with the complex value $tau and the complex vectors $v and $w.
+
+-=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
++=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
+
+ =item gsl_linalg_hessenberg_unpack($H, $tau, $U) - This function constructs the orthogonal matrix $U from the information stored in the Hessenberg matrix $H along with the vector $tau. $H and $tau are outputs from gsl_linalg_hessenberg_decomp.
+
+@@ -589,9 +589,9 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_LU_decomp($a, $p) - factorize the matrix $a into the LU decomposition PA = LU. On output the diagonal and upper triangular part of the input matrix A contain the matrix U. The lower triangular part of the input matrix (excluding the diagonal) contains L. The diagonal elements of L are unity, and are not stored. The function returns two value, the first is 0 if the operation succeeded, 1 otherwise, and the second is the sign of the permutation.
+
+-=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeeded, 0 otherwise.
+
+-=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeeded, 0 otherwise.
+
+ =item gsl_linalg_LU_refine($A, $LU, $p, $b, $x, $residual) - This function apply an iterative improvement to $x, the solution of $A $x = $b, using the LU decomposition of $A into ($LU,$p). The initial residual $r = $A $x - $b (where $x and $b are vectors) is also computed and stored in the vector $residual.
+
+@@ -625,27 +625,27 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_QR_svx($QR, $tau, $x) - This function solves the square system A x = b in-place using the QR decomposition of A into the matrix $QR and the vector $tau given by gsl_linalg_QR_decomp. On input, the vector $x should contain the right-hand side b, which is replaced by the solution on output.
+
+-=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
++=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
+
+-=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_QR_Rsolve($QR, $b, $x) - This function solves the triangular system R $x = $b for $x. It may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec.
+
+-=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_QRPT_decomp($A, $tau, $p, $norm) - This function factorizes the M-by-N matrix $A into the QRP^T decomposition A = Q R P^T. On output the diagonal and upper triangular part of the input matrix contain the matrix R. The permutation matrix P is stored in the permutation $p. There's two value returned by this function : the first is 0 if the operation succeeded, 1 otherwise. The second is sign of the permutation. It has the value (-1)^n, where n is the number of interchange [...]
+
@@ -758,7 +758,7 @@ Here is a list of all the functions included in this module :
You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all avaible functions of the module.
@@ -601,7 +696,7 @@ index f017caf..3d486a1 100644
=back
diff --git a/lib/Math/GSL/Matrix.pm b/lib/Math/GSL/Matrix.pm
-index 5b83f35..1fa72f0 100644
+index 3c27f4d..7d884ef 100644
--- a/lib/Math/GSL/Matrix.pm
+++ b/lib/Math/GSL/Matrix.pm
@@ -2369,11 +2369,11 @@ Here is a list of all the functions included in this module :
@@ -633,16 +728,16 @@ index 5b83f35..1fa72f0 100644
=item C<gsl_matrix_add_diagonal($a, $x)> - Add the constant value $x to the elements of the diagonal of the matrix $a
-=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
-=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
-=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
-=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
=back
@@ -656,7 +751,7 @@ index 5b83f35..1fa72f0 100644
diff --git a/lib/Math/GSL/MatrixComplex.pm b/lib/Math/GSL/MatrixComplex.pm
-index 3b4ec33..48af7c8 100644
+index 8e82f89..72ff7b2 100644
--- a/lib/Math/GSL/MatrixComplex.pm
+++ b/lib/Math/GSL/MatrixComplex.pm
@@ -1232,7 +1232,7 @@ sub lndet($)
@@ -669,7 +764,7 @@ index 3b4ec33..48af7c8 100644
diff --git a/lib/Math/GSL/Min.pm b/lib/Math/GSL/Min.pm
-index ce5a43f..2e7f01c 100644
+index f5d5d80..9831305 100644
--- a/lib/Math/GSL/Min.pm
+++ b/lib/Math/GSL/Min.pm
@@ -441,7 +441,7 @@ This module also includes the following constants :
@@ -682,7 +777,7 @@ index ce5a43f..2e7f01c 100644
=head1 AUTHORS
diff --git a/lib/Math/GSL/Monte.pm b/lib/Math/GSL/Monte.pm
-index 4d1c795..fa84c73 100644
+index a147ea9..4ccd404 100644
--- a/lib/Math/GSL/Monte.pm
+++ b/lib/Math/GSL/Monte.pm
@@ -559,7 +559,7 @@ This module also includes the following constants :
@@ -695,7 +790,7 @@ index 4d1c795..fa84c73 100644
=head1 AUTHORS
diff --git a/lib/Math/GSL/Multifit.pm b/lib/Math/GSL/Multifit.pm
-index 75d534f..3e25c15 100644
+index ef25e4f..f191b78 100644
--- a/lib/Math/GSL/Multifit.pm
+++ b/lib/Math/GSL/Multifit.pm
@@ -772,7 +772,7 @@ The following functions are not yet implemented. Patches Welcome!
@@ -708,7 +803,7 @@ index 75d534f..3e25c15 100644
diff --git a/lib/Math/GSL/Multimin.pm b/lib/Math/GSL/Multimin.pm
-index 63c9fb1..6ab5369 100644
+index dbb0c06..805695e 100644
--- a/lib/Math/GSL/Multimin.pm
+++ b/lib/Math/GSL/Multimin.pm
@@ -516,7 +516,7 @@ This module also includes the following constants :
@@ -721,7 +816,7 @@ index 63c9fb1..6ab5369 100644
diff --git a/lib/Math/GSL/Multiroots.pm b/lib/Math/GSL/Multiroots.pm
-index 5d7fcd9..ae5bc2b 100644
+index f172322..2fe07f3 100644
--- a/lib/Math/GSL/Multiroots.pm
+++ b/lib/Math/GSL/Multiroots.pm
@@ -500,7 +500,7 @@ Here is a list of all the functions in this module :
@@ -734,7 +829,7 @@ index 5d7fcd9..ae5bc2b 100644
=head1 AUTHORS
diff --git a/lib/Math/GSL/NTuple.pm b/lib/Math/GSL/NTuple.pm
-index 78965ab..cb68618 100644
+index dc8e0e5..55be67e 100644
--- a/lib/Math/GSL/NTuple.pm
+++ b/lib/Math/GSL/NTuple.pm
@@ -407,7 +407,7 @@ memory.
@@ -747,7 +842,7 @@ index 78965ab..cb68618 100644
=head1 AUTHORS
diff --git a/lib/Math/GSL/ODEIV.pm b/lib/Math/GSL/ODEIV.pm
-index d418899..c140fb5 100644
+index 10ec745..edcbfbd 100644
--- a/lib/Math/GSL/ODEIV.pm
+++ b/lib/Math/GSL/ODEIV.pm
@@ -554,7 +554,7 @@ This module also includes the following constants :
@@ -760,7 +855,7 @@ index d418899..c140fb5 100644
diff --git a/lib/Math/GSL/Permutation.pm b/lib/Math/GSL/Permutation.pm
-index c83b255..eede16c 100644
+index 5f71f96..9e8010b 100644
--- a/lib/Math/GSL/Permutation.pm
+++ b/lib/Math/GSL/Permutation.pm
@@ -205,7 +205,7 @@ Math::GSL::Permutation - functions for creating and manipulating permutations
@@ -818,7 +913,7 @@ index c83b255..eede16c 100644
diff --git a/lib/Math/GSL/Poly.pm b/lib/Math/GSL/Poly.pm
-index 047bd2f..c687663 100644
+index f3d9d07..5c17c45 100644
--- a/lib/Math/GSL/Poly.pm
+++ b/lib/Math/GSL/Poly.pm
@@ -387,7 +387,7 @@ This function frees all the memory associated with the workspace $w.
@@ -831,7 +926,7 @@ index 047bd2f..c687663 100644
=head1 AUTHORS
diff --git a/lib/Math/GSL/QRNG.pm b/lib/Math/GSL/QRNG.pm
-index e274589..1144570 100644
+index 69cc7db..f636132 100644
--- a/lib/Math/GSL/QRNG.pm
+++ b/lib/Math/GSL/QRNG.pm
@@ -349,7 +349,7 @@ This module also contains the following constants :
@@ -844,7 +939,7 @@ index e274589..1144570 100644
diff --git a/lib/Math/GSL/RNG.pm b/lib/Math/GSL/RNG.pm
-index ad41366..e379197 100644
+index 6bcd38b..5fc1964 100644
--- a/lib/Math/GSL/RNG.pm
+++ b/lib/Math/GSL/RNG.pm
@@ -886,7 +886,7 @@ __END__
@@ -857,7 +952,7 @@ index ad41366..e379197 100644
L<http://www.gnu.org/software/gsl/manual/html_node/>
diff --git a/lib/Math/GSL/Randist.pm b/lib/Math/GSL/Randist.pm
-index 6aebd10..2b9eeed 100644
+index b97a8f4..522acdc 100644
--- a/lib/Math/GSL/Randist.pm
+++ b/lib/Math/GSL/Randist.pm
@@ -1035,7 +1035,7 @@ De-allocates the gsl_ran_discrete pointed to by g.
@@ -870,10 +965,19 @@ index 6aebd10..2b9eeed 100644
diff --git a/lib/Math/GSL/SF.pm b/lib/Math/GSL/SF.pm
-index 480d7c8..6585bdf 100644
+index 0441f70..0ba8a98 100644
--- a/lib/Math/GSL/SF.pm
+++ b/lib/Math/GSL/SF.pm
-@@ -3843,7 +3843,7 @@ This module also contains the following constants used as mode in various of tho
+@@ -2357,7 +2357,7 @@ These functions compute the incomplete elliptic integral D(\phi,k) which is defi
+
+ =over
+
+-=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
++=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
+
+ =item C<gsl_sf_erfc_e($x, $result)>
+
+@@ -3885,7 +3885,7 @@ This module also contains the following constants used as mode in various of tho
=back
@@ -883,7 +987,7 @@ index 480d7c8..6585bdf 100644
diff --git a/lib/Math/GSL/Siman.pm b/lib/Math/GSL/Siman.pm
-index 03e0f88..55e3e20 100644
+index 5e4dc1c..4dffca0 100644
--- a/lib/Math/GSL/Siman.pm
+++ b/lib/Math/GSL/Siman.pm
@@ -145,7 +145,7 @@ Here is a list of all the functions in this module :
@@ -896,7 +1000,7 @@ index 03e0f88..55e3e20 100644
diff --git a/lib/Math/GSL/Sort.pm b/lib/Math/GSL/Sort.pm
-index 133e990..dde1b56 100644
+index a1c9564..8dcebda 100644
--- a/lib/Math/GSL/Sort.pm
+++ b/lib/Math/GSL/Sort.pm
@@ -286,7 +286,7 @@ should be removed in further versions.
@@ -909,7 +1013,7 @@ index 133e990..dde1b56 100644
=head1 PERFORMANCE
diff --git a/lib/Math/GSL/Spline.pm b/lib/Math/GSL/Spline.pm
-index c3cddca..6216526 100644
+index 7915b03..44de917 100644
--- a/lib/Math/GSL/Spline.pm
+++ b/lib/Math/GSL/Spline.pm
@@ -184,7 +184,7 @@ ya as arguments on each evaluation.
@@ -922,7 +1026,7 @@ index c3cddca..6216526 100644
diff --git a/lib/Math/GSL/Statistics.pm b/lib/Math/GSL/Statistics.pm
-index 1590fa3..f7ff739 100644
+index 5e6685b..76f1ddb 100644
--- a/lib/Math/GSL/Statistics.pm
+++ b/lib/Math/GSL/Statistics.pm
@@ -364,7 +364,7 @@ These functions return the total sum of squares (TSS) of data about the mean. Fo
@@ -944,7 +1048,7 @@ index 1590fa3..f7ff739 100644
diff --git a/lib/Math/GSL/Sys.pm b/lib/Math/GSL/Sys.pm
-index f2a7bc8..00a1484 100644
+index 0fdd86f..8a12e35 100644
--- a/lib/Math/GSL/Sys.pm
+++ b/lib/Math/GSL/Sys.pm
@@ -218,7 +218,7 @@ zero. The implementation is based on the package fcmp by T.C. Belding.
@@ -957,9 +1061,85 @@ index f2a7bc8..00a1484 100644
=head1 AUTHORS
diff --git a/lib/Math/GSL/Vector.pm b/lib/Math/GSL/Vector.pm
-index 8f0723d..c4883c5 100644
+index b570be6..1dd9343 100644
--- a/lib/Math/GSL/Vector.pm
+++ b/lib/Math/GSL/Vector.pm
+@@ -1234,7 +1234,7 @@ set all the elements of $v to $x
+ =item C<gsl_vector_set_basis($v, $i)>
+
+ set all the elements of $v to 0 except for the $i-th element which is set to 1
+-and return 0 if the operation succeded, 1 otherwise.
++and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_fread($file, $v)>
+
+@@ -1271,23 +1271,23 @@ success and 1 if there was a problem writing to the file.
+ =item C<gsl_vector_memcpy($dest, $src)>
+
+ This function copies the elements of the vector $src into the vector $dest and
+-return 0 if the opertaion succeded, 1 otherwise. The two vectors must have the
++return 0 if the opertaion succeeded, 1 otherwise. The two vectors must have the
+ same length.
+
+ =item C<gsl_vector_reverse($v)>
+
+ reverse the order of the elements of the vector $v and return 0 if the
+-opertaion succeded, 1 otherwise
++opertaion succeeded, 1 otherwise
+
+ =item C<gsl_vector_swap($v, $v2)>
+
+ swap the values of the vectors $v and $v2 and return 0 if the opertaion
+-succeded, 1 otherwise
++succeeded, 1 otherwise
+
+ =item C<gsl_vector_swap_elements($v, $i, $j)>
+
+ permute the elements at position $i and $j in the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_max($v)>
+
+@@ -1318,32 +1318,32 @@ $v and the second is the position of the maximum value.
+ =item C<gsl_vector_add($v, $v2)>
+
+ add the elements of $v2 to the elements of $v, the two vectors must have the
+-same length and return 0 if the operation succeded, 1 otherwise.
++same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_sub($v, $v2)>
+
+ substract the elements of $v2 from the elements of $v, the two vectors must
+-have the same length and return 0 if the operation succeded, 1 otherwise.
++have the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_mul($v, $v2)>
+
+ multiply the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_div($v, $v2)>
+
+ divides the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_scale($v, $x)>
+
+ multiplty the elements of the vector $v by a constant $x and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_add_constant($v, $x)>
+
+ add a constant $x to the elements of the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_isnull($v)>
+
@@ -1380,7 +1380,7 @@ leaving the odd elements untouched :
=back
@@ -970,7 +1150,7 @@ index 8f0723d..c4883c5 100644
=head1 EXAMPLES
diff --git a/pm/Math/GSL/BLAS.pm.1.11 b/pm/Math/GSL/BLAS.pm.1.11
-index 881d7b5..d76f30e 100644
+index f581498..2c1133d 100644
--- a/pm/Math/GSL/BLAS.pm.1.11
+++ b/pm/Math/GSL/BLAS.pm.1.11
@@ -266,7 +266,7 @@ The functions of this module are divised into 3 levels:
@@ -1123,7 +1303,7 @@ index 881d7b5..d76f30e 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/BLAS.pm.1.12 b/pm/Math/GSL/BLAS.pm.1.12
-index 881d7b5..d76f30e 100644
+index f581498..2c1133d 100644
--- a/pm/Math/GSL/BLAS.pm.1.12
+++ b/pm/Math/GSL/BLAS.pm.1.12
@@ -266,7 +266,7 @@ The functions of this module are divised into 3 levels:
@@ -1276,7 +1456,7 @@ index 881d7b5..d76f30e 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/BLAS.pm.1.13 b/pm/Math/GSL/BLAS.pm.1.13
-index 881d7b5..d76f30e 100644
+index f581498..2c1133d 100644
--- a/pm/Math/GSL/BLAS.pm.1.13
+++ b/pm/Math/GSL/BLAS.pm.1.13
@@ -266,7 +266,7 @@ The functions of this module are divised into 3 levels:
@@ -1429,7 +1609,7 @@ index 881d7b5..d76f30e 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/BLAS.pm.1.14 b/pm/Math/GSL/BLAS.pm.1.14
-index 881d7b5..d76f30e 100644
+index f581498..2c1133d 100644
--- a/pm/Math/GSL/BLAS.pm.1.14
+++ b/pm/Math/GSL/BLAS.pm.1.14
@@ -266,7 +266,7 @@ The functions of this module are divised into 3 levels:
@@ -1582,7 +1762,7 @@ index 881d7b5..d76f30e 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/BLAS.pm.1.15 b/pm/Math/GSL/BLAS.pm.1.15
-index 881d7b5..d76f30e 100644
+index f581498..2c1133d 100644
--- a/pm/Math/GSL/BLAS.pm.1.15
+++ b/pm/Math/GSL/BLAS.pm.1.15
@@ -266,7 +266,7 @@ The functions of this module are divised into 3 levels:
@@ -1735,7 +1915,7 @@ index 881d7b5..d76f30e 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/BLAS.pm.1.16 b/pm/Math/GSL/BLAS.pm.1.16
-index 881d7b5..d76f30e 100644
+index f581498..2c1133d 100644
--- a/pm/Math/GSL/BLAS.pm.1.16
+++ b/pm/Math/GSL/BLAS.pm.1.16
@@ -266,7 +266,7 @@ The functions of this module are divised into 3 levels:
@@ -1888,7 +2068,7 @@ index 881d7b5..d76f30e 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/BSpline.pm.1.11 b/pm/Math/GSL/BSpline.pm.1.11
-index f608af2..7744689 100644
+index fdf81fc..8188943 100644
--- a/pm/Math/GSL/BSpline.pm.1.11
+++ b/pm/Math/GSL/BSpline.pm.1.11
@@ -192,7 +192,7 @@ gsl_bspline_ncoeffs. It is far more efficient to compute all of the basis
@@ -1901,7 +2081,7 @@ index f608af2..7744689 100644
=back
diff --git a/pm/Math/GSL/BSpline.pm.1.12 b/pm/Math/GSL/BSpline.pm.1.12
-index f608af2..7744689 100644
+index fdf81fc..8188943 100644
--- a/pm/Math/GSL/BSpline.pm.1.12
+++ b/pm/Math/GSL/BSpline.pm.1.12
@@ -192,7 +192,7 @@ gsl_bspline_ncoeffs. It is far more efficient to compute all of the basis
@@ -1914,7 +2094,7 @@ index f608af2..7744689 100644
=back
diff --git a/pm/Math/GSL/BSpline.pm.1.13 b/pm/Math/GSL/BSpline.pm.1.13
-index 42821f7..6b31117 100644
+index 42aa608..80ce00c 100644
--- a/pm/Math/GSL/BSpline.pm.1.13
+++ b/pm/Math/GSL/BSpline.pm.1.13
@@ -193,7 +193,7 @@ gsl_bspline_ncoeffs. It is far more efficient to compute all of the basis
@@ -1927,7 +2107,7 @@ index 42821f7..6b31117 100644
=back
diff --git a/pm/Math/GSL/BSpline.pm.1.14 b/pm/Math/GSL/BSpline.pm.1.14
-index 42821f7..6b31117 100644
+index 42aa608..80ce00c 100644
--- a/pm/Math/GSL/BSpline.pm.1.14
+++ b/pm/Math/GSL/BSpline.pm.1.14
@@ -193,7 +193,7 @@ gsl_bspline_ncoeffs. It is far more efficient to compute all of the basis
@@ -1940,7 +2120,7 @@ index 42821f7..6b31117 100644
=back
diff --git a/pm/Math/GSL/BSpline.pm.1.15 b/pm/Math/GSL/BSpline.pm.1.15
-index 3a2c67e..5e6a45b 100644
+index 70c1828..3fd15eb 100644
--- a/pm/Math/GSL/BSpline.pm.1.15
+++ b/pm/Math/GSL/BSpline.pm.1.15
@@ -241,7 +241,7 @@ gsl_bspline_ncoeffs. It is far more efficient to compute all of the basis
@@ -1953,7 +2133,7 @@ index 3a2c67e..5e6a45b 100644
=back
diff --git a/pm/Math/GSL/BSpline.pm.1.16 b/pm/Math/GSL/BSpline.pm.1.16
-index 3a2c67e..5e6a45b 100644
+index 70c1828..3fd15eb 100644
--- a/pm/Math/GSL/BSpline.pm.1.16
+++ b/pm/Math/GSL/BSpline.pm.1.16
@@ -241,7 +241,7 @@ gsl_bspline_ncoeffs. It is far more efficient to compute all of the basis
@@ -1966,7 +2146,7 @@ index 3a2c67e..5e6a45b 100644
=back
diff --git a/pm/Math/GSL/CBLAS.pm.1.11 b/pm/Math/GSL/CBLAS.pm.1.11
-index da59ab1..d2dc76e 100644
+index ea3d7e2..d2b5553 100644
--- a/pm/Math/GSL/CBLAS.pm.1.11
+++ b/pm/Math/GSL/CBLAS.pm.1.11
@@ -704,7 +704,7 @@ This module also contains the following constants :
@@ -1979,7 +2159,7 @@ index da59ab1..d2dc76e 100644
diff --git a/pm/Math/GSL/CBLAS.pm.1.12 b/pm/Math/GSL/CBLAS.pm.1.12
-index da59ab1..d2dc76e 100644
+index ea3d7e2..d2b5553 100644
--- a/pm/Math/GSL/CBLAS.pm.1.12
+++ b/pm/Math/GSL/CBLAS.pm.1.12
@@ -704,7 +704,7 @@ This module also contains the following constants :
@@ -1992,7 +2172,7 @@ index da59ab1..d2dc76e 100644
diff --git a/pm/Math/GSL/CBLAS.pm.1.13 b/pm/Math/GSL/CBLAS.pm.1.13
-index da59ab1..d2dc76e 100644
+index ea3d7e2..d2b5553 100644
--- a/pm/Math/GSL/CBLAS.pm.1.13
+++ b/pm/Math/GSL/CBLAS.pm.1.13
@@ -704,7 +704,7 @@ This module also contains the following constants :
@@ -2005,7 +2185,7 @@ index da59ab1..d2dc76e 100644
diff --git a/pm/Math/GSL/CBLAS.pm.1.14 b/pm/Math/GSL/CBLAS.pm.1.14
-index da59ab1..d2dc76e 100644
+index ea3d7e2..d2b5553 100644
--- a/pm/Math/GSL/CBLAS.pm.1.14
+++ b/pm/Math/GSL/CBLAS.pm.1.14
@@ -704,7 +704,7 @@ This module also contains the following constants :
@@ -2018,7 +2198,7 @@ index da59ab1..d2dc76e 100644
diff --git a/pm/Math/GSL/CBLAS.pm.1.15 b/pm/Math/GSL/CBLAS.pm.1.15
-index da59ab1..d2dc76e 100644
+index ea3d7e2..d2b5553 100644
--- a/pm/Math/GSL/CBLAS.pm.1.15
+++ b/pm/Math/GSL/CBLAS.pm.1.15
@@ -704,7 +704,7 @@ This module also contains the following constants :
@@ -2031,7 +2211,7 @@ index da59ab1..d2dc76e 100644
diff --git a/pm/Math/GSL/CBLAS.pm.1.16 b/pm/Math/GSL/CBLAS.pm.1.16
-index da59ab1..d2dc76e 100644
+index ea3d7e2..d2b5553 100644
--- a/pm/Math/GSL/CBLAS.pm.1.16
+++ b/pm/Math/GSL/CBLAS.pm.1.16
@@ -704,7 +704,7 @@ This module also contains the following constants :
@@ -2044,7 +2224,7 @@ index da59ab1..d2dc76e 100644
diff --git a/pm/Math/GSL/CDF.pm.1.11 b/pm/Math/GSL/CDF.pm.1.11
-index d0642e5..a7afa98 100644
+index 8286f92..227e281 100644
--- a/pm/Math/GSL/CDF.pm.1.11
+++ b/pm/Math/GSL/CDF.pm.1.11
@@ -516,7 +516,7 @@ This is the list of available import tags:
@@ -2057,7 +2237,7 @@ index d0642e5..a7afa98 100644
diff --git a/pm/Math/GSL/CDF.pm.1.12 b/pm/Math/GSL/CDF.pm.1.12
-index d0642e5..a7afa98 100644
+index 8286f92..227e281 100644
--- a/pm/Math/GSL/CDF.pm.1.12
+++ b/pm/Math/GSL/CDF.pm.1.12
@@ -516,7 +516,7 @@ This is the list of available import tags:
@@ -2070,7 +2250,7 @@ index d0642e5..a7afa98 100644
diff --git a/pm/Math/GSL/CDF.pm.1.13 b/pm/Math/GSL/CDF.pm.1.13
-index d0642e5..a7afa98 100644
+index 8286f92..227e281 100644
--- a/pm/Math/GSL/CDF.pm.1.13
+++ b/pm/Math/GSL/CDF.pm.1.13
@@ -516,7 +516,7 @@ This is the list of available import tags:
@@ -2083,7 +2263,7 @@ index d0642e5..a7afa98 100644
diff --git a/pm/Math/GSL/CDF.pm.1.14 b/pm/Math/GSL/CDF.pm.1.14
-index d0642e5..a7afa98 100644
+index 8286f92..227e281 100644
--- a/pm/Math/GSL/CDF.pm.1.14
+++ b/pm/Math/GSL/CDF.pm.1.14
@@ -516,7 +516,7 @@ This is the list of available import tags:
@@ -2096,7 +2276,7 @@ index d0642e5..a7afa98 100644
diff --git a/pm/Math/GSL/CDF.pm.1.15 b/pm/Math/GSL/CDF.pm.1.15
-index d0642e5..a7afa98 100644
+index 8286f92..227e281 100644
--- a/pm/Math/GSL/CDF.pm.1.15
+++ b/pm/Math/GSL/CDF.pm.1.15
@@ -516,7 +516,7 @@ This is the list of available import tags:
@@ -2109,7 +2289,7 @@ index d0642e5..a7afa98 100644
diff --git a/pm/Math/GSL/CDF.pm.1.16 b/pm/Math/GSL/CDF.pm.1.16
-index d0642e5..a7afa98 100644
+index 8286f92..227e281 100644
--- a/pm/Math/GSL/CDF.pm.1.16
+++ b/pm/Math/GSL/CDF.pm.1.16
@@ -516,7 +516,7 @@ This is the list of available import tags:
@@ -2122,7 +2302,7 @@ index d0642e5..a7afa98 100644
diff --git a/pm/Math/GSL/Chebyshev.pm.1.11 b/pm/Math/GSL/Chebyshev.pm.1.11
-index 2dc42c2..b7066e6 100644
+index 6346cbb..8c151b2 100644
--- a/pm/Math/GSL/Chebyshev.pm.1.11
+++ b/pm/Math/GSL/Chebyshev.pm.1.11
@@ -361,7 +361,7 @@ in $deriv, which must be pre-allocated. Returns a GSL status code.
@@ -2135,7 +2315,7 @@ index 2dc42c2..b7066e6 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Chebyshev.pm.1.12 b/pm/Math/GSL/Chebyshev.pm.1.12
-index 2dc42c2..b7066e6 100644
+index 6346cbb..8c151b2 100644
--- a/pm/Math/GSL/Chebyshev.pm.1.12
+++ b/pm/Math/GSL/Chebyshev.pm.1.12
@@ -361,7 +361,7 @@ in $deriv, which must be pre-allocated. Returns a GSL status code.
@@ -2148,7 +2328,7 @@ index 2dc42c2..b7066e6 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Chebyshev.pm.1.13 b/pm/Math/GSL/Chebyshev.pm.1.13
-index 2dc42c2..b7066e6 100644
+index 6346cbb..8c151b2 100644
--- a/pm/Math/GSL/Chebyshev.pm.1.13
+++ b/pm/Math/GSL/Chebyshev.pm.1.13
@@ -361,7 +361,7 @@ in $deriv, which must be pre-allocated. Returns a GSL status code.
@@ -2161,7 +2341,7 @@ index 2dc42c2..b7066e6 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Chebyshev.pm.1.14 b/pm/Math/GSL/Chebyshev.pm.1.14
-index 2dc42c2..b7066e6 100644
+index 6346cbb..8c151b2 100644
--- a/pm/Math/GSL/Chebyshev.pm.1.14
+++ b/pm/Math/GSL/Chebyshev.pm.1.14
@@ -361,7 +361,7 @@ in $deriv, which must be pre-allocated. Returns a GSL status code.
@@ -2174,7 +2354,7 @@ index 2dc42c2..b7066e6 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Chebyshev.pm.1.15 b/pm/Math/GSL/Chebyshev.pm.1.15
-index 5cd6c45..0d0e881 100644
+index 910e9db..6b83fd7 100644
--- a/pm/Math/GSL/Chebyshev.pm.1.15
+++ b/pm/Math/GSL/Chebyshev.pm.1.15
@@ -364,7 +364,7 @@ in $deriv, which must be pre-allocated. Returns a GSL status code.
@@ -2187,7 +2367,7 @@ index 5cd6c45..0d0e881 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Chebyshev.pm.1.16 b/pm/Math/GSL/Chebyshev.pm.1.16
-index 5cd6c45..0d0e881 100644
+index 910e9db..6b83fd7 100644
--- a/pm/Math/GSL/Chebyshev.pm.1.16
+++ b/pm/Math/GSL/Chebyshev.pm.1.16
@@ -364,7 +364,7 @@ in $deriv, which must be pre-allocated. Returns a GSL status code.
@@ -2200,7 +2380,7 @@ index 5cd6c45..0d0e881 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Combination.pm.1.11 b/pm/Math/GSL/Combination.pm.1.11
-index 1b82012..30497d0 100644
+index b5e7fc5..3fb52cf 100644
--- a/pm/Math/GSL/Combination.pm.1.11
+++ b/pm/Math/GSL/Combination.pm.1.11
@@ -325,7 +325,7 @@ sub prev {
@@ -2213,7 +2393,7 @@ index 1b82012..30497d0 100644
diff --git a/pm/Math/GSL/Combination.pm.1.12 b/pm/Math/GSL/Combination.pm.1.12
-index 1b82012..30497d0 100644
+index b5e7fc5..3fb52cf 100644
--- a/pm/Math/GSL/Combination.pm.1.12
+++ b/pm/Math/GSL/Combination.pm.1.12
@@ -325,7 +325,7 @@ sub prev {
@@ -2226,7 +2406,7 @@ index 1b82012..30497d0 100644
diff --git a/pm/Math/GSL/Combination.pm.1.13 b/pm/Math/GSL/Combination.pm.1.13
-index 1b82012..30497d0 100644
+index b5e7fc5..3fb52cf 100644
--- a/pm/Math/GSL/Combination.pm.1.13
+++ b/pm/Math/GSL/Combination.pm.1.13
@@ -325,7 +325,7 @@ sub prev {
@@ -2239,7 +2419,7 @@ index 1b82012..30497d0 100644
diff --git a/pm/Math/GSL/Combination.pm.1.14 b/pm/Math/GSL/Combination.pm.1.14
-index 1b82012..30497d0 100644
+index b5e7fc5..3fb52cf 100644
--- a/pm/Math/GSL/Combination.pm.1.14
+++ b/pm/Math/GSL/Combination.pm.1.14
@@ -325,7 +325,7 @@ sub prev {
@@ -2252,7 +2432,7 @@ index 1b82012..30497d0 100644
diff --git a/pm/Math/GSL/Combination.pm.1.15 b/pm/Math/GSL/Combination.pm.1.15
-index 1b82012..30497d0 100644
+index b5e7fc5..3fb52cf 100644
--- a/pm/Math/GSL/Combination.pm.1.15
+++ b/pm/Math/GSL/Combination.pm.1.15
@@ -325,7 +325,7 @@ sub prev {
@@ -2265,7 +2445,7 @@ index 1b82012..30497d0 100644
diff --git a/pm/Math/GSL/Combination.pm.1.16 b/pm/Math/GSL/Combination.pm.1.16
-index 1b82012..30497d0 100644
+index b5e7fc5..3fb52cf 100644
--- a/pm/Math/GSL/Combination.pm.1.16
+++ b/pm/Math/GSL/Combination.pm.1.16
@@ -325,7 +325,7 @@ sub prev {
@@ -2278,7 +2458,7 @@ index 1b82012..30497d0 100644
diff --git a/pm/Math/GSL/Deriv.pm.1.11 b/pm/Math/GSL/Deriv.pm.1.11
-index 1a29db6..c3ead42 100644
+index 694ec6a..1744f54 100644
--- a/pm/Math/GSL/Deriv.pm.1.11
+++ b/pm/Math/GSL/Deriv.pm.1.11
@@ -291,7 +291,7 @@ function is evaluated at $x and $x+$h.
@@ -2291,7 +2471,7 @@ index 1a29db6..c3ead42 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Deriv.pm.1.12 b/pm/Math/GSL/Deriv.pm.1.12
-index 1a29db6..c3ead42 100644
+index 694ec6a..1744f54 100644
--- a/pm/Math/GSL/Deriv.pm.1.12
+++ b/pm/Math/GSL/Deriv.pm.1.12
@@ -291,7 +291,7 @@ function is evaluated at $x and $x+$h.
@@ -2304,7 +2484,7 @@ index 1a29db6..c3ead42 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Deriv.pm.1.13 b/pm/Math/GSL/Deriv.pm.1.13
-index 1a29db6..c3ead42 100644
+index 694ec6a..1744f54 100644
--- a/pm/Math/GSL/Deriv.pm.1.13
+++ b/pm/Math/GSL/Deriv.pm.1.13
@@ -291,7 +291,7 @@ function is evaluated at $x and $x+$h.
@@ -2317,7 +2497,7 @@ index 1a29db6..c3ead42 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Deriv.pm.1.14 b/pm/Math/GSL/Deriv.pm.1.14
-index 1a29db6..c3ead42 100644
+index 694ec6a..1744f54 100644
--- a/pm/Math/GSL/Deriv.pm.1.14
+++ b/pm/Math/GSL/Deriv.pm.1.14
@@ -291,7 +291,7 @@ function is evaluated at $x and $x+$h.
@@ -2330,7 +2510,7 @@ index 1a29db6..c3ead42 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Deriv.pm.1.15 b/pm/Math/GSL/Deriv.pm.1.15
-index 1a29db6..c3ead42 100644
+index 694ec6a..1744f54 100644
--- a/pm/Math/GSL/Deriv.pm.1.15
+++ b/pm/Math/GSL/Deriv.pm.1.15
@@ -291,7 +291,7 @@ function is evaluated at $x and $x+$h.
@@ -2343,7 +2523,7 @@ index 1a29db6..c3ead42 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Deriv.pm.1.16 b/pm/Math/GSL/Deriv.pm.1.16
-index 1a29db6..c3ead42 100644
+index 694ec6a..1744f54 100644
--- a/pm/Math/GSL/Deriv.pm.1.16
+++ b/pm/Math/GSL/Deriv.pm.1.16
@@ -291,7 +291,7 @@ function is evaluated at $x and $x+$h.
@@ -2356,7 +2536,7 @@ index 1a29db6..c3ead42 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Eigen.pm.1.11 b/pm/Math/GSL/Eigen.pm.1.11
-index 9d4a436..4fed7e0 100644
+index b903d09..c682a32 100644
--- a/pm/Math/GSL/Eigen.pm.1.11
+++ b/pm/Math/GSL/Eigen.pm.1.11
@@ -1047,7 +1047,7 @@ This module also includes these constants :
@@ -2369,7 +2549,7 @@ index 9d4a436..4fed7e0 100644
diff --git a/pm/Math/GSL/Eigen.pm.1.12 b/pm/Math/GSL/Eigen.pm.1.12
-index 9d4a436..4fed7e0 100644
+index b903d09..c682a32 100644
--- a/pm/Math/GSL/Eigen.pm.1.12
+++ b/pm/Math/GSL/Eigen.pm.1.12
@@ -1047,7 +1047,7 @@ This module also includes these constants :
@@ -2382,7 +2562,7 @@ index 9d4a436..4fed7e0 100644
diff --git a/pm/Math/GSL/Eigen.pm.1.13 b/pm/Math/GSL/Eigen.pm.1.13
-index 9d4a436..4fed7e0 100644
+index b903d09..c682a32 100644
--- a/pm/Math/GSL/Eigen.pm.1.13
+++ b/pm/Math/GSL/Eigen.pm.1.13
@@ -1047,7 +1047,7 @@ This module also includes these constants :
@@ -2395,7 +2575,7 @@ index 9d4a436..4fed7e0 100644
diff --git a/pm/Math/GSL/Eigen.pm.1.14 b/pm/Math/GSL/Eigen.pm.1.14
-index 9d4a436..4fed7e0 100644
+index b903d09..c682a32 100644
--- a/pm/Math/GSL/Eigen.pm.1.14
+++ b/pm/Math/GSL/Eigen.pm.1.14
@@ -1047,7 +1047,7 @@ This module also includes these constants :
@@ -2408,7 +2588,7 @@ index 9d4a436..4fed7e0 100644
diff --git a/pm/Math/GSL/Eigen.pm.1.15 b/pm/Math/GSL/Eigen.pm.1.15
-index facd9d4..7414b7c 100644
+index 6798161..0c2346d 100644
--- a/pm/Math/GSL/Eigen.pm.1.15
+++ b/pm/Math/GSL/Eigen.pm.1.15
@@ -1048,7 +1048,7 @@ This module also includes these constants :
@@ -2421,7 +2601,7 @@ index facd9d4..7414b7c 100644
diff --git a/pm/Math/GSL/Eigen.pm.1.16 b/pm/Math/GSL/Eigen.pm.1.16
-index facd9d4..7414b7c 100644
+index 6798161..0c2346d 100644
--- a/pm/Math/GSL/Eigen.pm.1.16
+++ b/pm/Math/GSL/Eigen.pm.1.16
@@ -1048,7 +1048,7 @@ This module also includes these constants :
@@ -2434,7 +2614,7 @@ index facd9d4..7414b7c 100644
diff --git a/pm/Math/GSL/FFT.pm.1.11 b/pm/Math/GSL/FFT.pm.1.11
-index a70df43..417f8aa 100644
+index 83bb55d..b5174d7 100644
--- a/pm/Math/GSL/FFT.pm.1.11
+++ b/pm/Math/GSL/FFT.pm.1.11
@@ -942,7 +942,7 @@ This module also includes the following constants :
@@ -2447,7 +2627,7 @@ index a70df43..417f8aa 100644
diff --git a/pm/Math/GSL/FFT.pm.1.12 b/pm/Math/GSL/FFT.pm.1.12
-index a70df43..417f8aa 100644
+index 83bb55d..b5174d7 100644
--- a/pm/Math/GSL/FFT.pm.1.12
+++ b/pm/Math/GSL/FFT.pm.1.12
@@ -942,7 +942,7 @@ This module also includes the following constants :
@@ -2460,7 +2640,7 @@ index a70df43..417f8aa 100644
diff --git a/pm/Math/GSL/FFT.pm.1.13 b/pm/Math/GSL/FFT.pm.1.13
-index a70df43..417f8aa 100644
+index 83bb55d..b5174d7 100644
--- a/pm/Math/GSL/FFT.pm.1.13
+++ b/pm/Math/GSL/FFT.pm.1.13
@@ -942,7 +942,7 @@ This module also includes the following constants :
@@ -2473,7 +2653,7 @@ index a70df43..417f8aa 100644
diff --git a/pm/Math/GSL/FFT.pm.1.14 b/pm/Math/GSL/FFT.pm.1.14
-index a70df43..417f8aa 100644
+index 83bb55d..b5174d7 100644
--- a/pm/Math/GSL/FFT.pm.1.14
+++ b/pm/Math/GSL/FFT.pm.1.14
@@ -942,7 +942,7 @@ This module also includes the following constants :
@@ -2486,7 +2666,7 @@ index a70df43..417f8aa 100644
diff --git a/pm/Math/GSL/FFT.pm.1.15 b/pm/Math/GSL/FFT.pm.1.15
-index 8acb44a..408ff60 100644
+index be52e40..53c5f45 100644
--- a/pm/Math/GSL/FFT.pm.1.15
+++ b/pm/Math/GSL/FFT.pm.1.15
@@ -943,7 +943,7 @@ This module also includes the following constants :
@@ -2499,7 +2679,7 @@ index 8acb44a..408ff60 100644
diff --git a/pm/Math/GSL/FFT.pm.1.16 b/pm/Math/GSL/FFT.pm.1.16
-index 8acb44a..408ff60 100644
+index be52e40..53c5f45 100644
--- a/pm/Math/GSL/FFT.pm.1.16
+++ b/pm/Math/GSL/FFT.pm.1.16
@@ -943,7 +943,7 @@ This module also includes the following constants :
@@ -2512,7 +2692,7 @@ index 8acb44a..408ff60 100644
diff --git a/pm/Math/GSL/Fit.pm.1.11 b/pm/Math/GSL/Fit.pm.1.11
-index f2b0c53..947cae7 100644
+index af3bfbd..b63517c 100644
--- a/pm/Math/GSL/Fit.pm.1.11
+++ b/pm/Math/GSL/Fit.pm.1.11
@@ -169,7 +169,7 @@ and y_err.
@@ -2525,7 +2705,7 @@ index f2b0c53..947cae7 100644
diff --git a/pm/Math/GSL/Fit.pm.1.12 b/pm/Math/GSL/Fit.pm.1.12
-index f2b0c53..947cae7 100644
+index af3bfbd..b63517c 100644
--- a/pm/Math/GSL/Fit.pm.1.12
+++ b/pm/Math/GSL/Fit.pm.1.12
@@ -169,7 +169,7 @@ and y_err.
@@ -2538,7 +2718,7 @@ index f2b0c53..947cae7 100644
diff --git a/pm/Math/GSL/Fit.pm.1.13 b/pm/Math/GSL/Fit.pm.1.13
-index f2b0c53..947cae7 100644
+index af3bfbd..b63517c 100644
--- a/pm/Math/GSL/Fit.pm.1.13
+++ b/pm/Math/GSL/Fit.pm.1.13
@@ -169,7 +169,7 @@ and y_err.
@@ -2551,7 +2731,7 @@ index f2b0c53..947cae7 100644
diff --git a/pm/Math/GSL/Fit.pm.1.14 b/pm/Math/GSL/Fit.pm.1.14
-index f2b0c53..947cae7 100644
+index af3bfbd..b63517c 100644
--- a/pm/Math/GSL/Fit.pm.1.14
+++ b/pm/Math/GSL/Fit.pm.1.14
@@ -169,7 +169,7 @@ and y_err.
@@ -2564,7 +2744,7 @@ index f2b0c53..947cae7 100644
diff --git a/pm/Math/GSL/Fit.pm.1.15 b/pm/Math/GSL/Fit.pm.1.15
-index f2b0c53..947cae7 100644
+index af3bfbd..b63517c 100644
--- a/pm/Math/GSL/Fit.pm.1.15
+++ b/pm/Math/GSL/Fit.pm.1.15
@@ -169,7 +169,7 @@ and y_err.
@@ -2577,7 +2757,7 @@ index f2b0c53..947cae7 100644
diff --git a/pm/Math/GSL/Fit.pm.1.16 b/pm/Math/GSL/Fit.pm.1.16
-index f2b0c53..947cae7 100644
+index af3bfbd..b63517c 100644
--- a/pm/Math/GSL/Fit.pm.1.16
+++ b/pm/Math/GSL/Fit.pm.1.16
@@ -169,7 +169,7 @@ and y_err.
@@ -2590,7 +2770,7 @@ index f2b0c53..947cae7 100644
diff --git a/pm/Math/GSL/Heapsort.pm.1.11 b/pm/Math/GSL/Heapsort.pm.1.11
-index 31d00d8..64d7534 100644
+index 4b22a54..aa216d2 100644
--- a/pm/Math/GSL/Heapsort.pm.1.11
+++ b/pm/Math/GSL/Heapsort.pm.1.11
@@ -159,7 +159,7 @@ Here is a list of all the functions in this module :
@@ -2603,7 +2783,7 @@ index 31d00d8..64d7534 100644
diff --git a/pm/Math/GSL/Heapsort.pm.1.12 b/pm/Math/GSL/Heapsort.pm.1.12
-index 31d00d8..64d7534 100644
+index 4b22a54..aa216d2 100644
--- a/pm/Math/GSL/Heapsort.pm.1.12
+++ b/pm/Math/GSL/Heapsort.pm.1.12
@@ -159,7 +159,7 @@ Here is a list of all the functions in this module :
@@ -2616,7 +2796,7 @@ index 31d00d8..64d7534 100644
diff --git a/pm/Math/GSL/Heapsort.pm.1.13 b/pm/Math/GSL/Heapsort.pm.1.13
-index 31d00d8..64d7534 100644
+index 4b22a54..aa216d2 100644
--- a/pm/Math/GSL/Heapsort.pm.1.13
+++ b/pm/Math/GSL/Heapsort.pm.1.13
@@ -159,7 +159,7 @@ Here is a list of all the functions in this module :
@@ -2629,7 +2809,7 @@ index 31d00d8..64d7534 100644
diff --git a/pm/Math/GSL/Heapsort.pm.1.14 b/pm/Math/GSL/Heapsort.pm.1.14
-index 31d00d8..64d7534 100644
+index 4b22a54..aa216d2 100644
--- a/pm/Math/GSL/Heapsort.pm.1.14
+++ b/pm/Math/GSL/Heapsort.pm.1.14
@@ -159,7 +159,7 @@ Here is a list of all the functions in this module :
@@ -2642,7 +2822,7 @@ index 31d00d8..64d7534 100644
diff --git a/pm/Math/GSL/Heapsort.pm.1.15 b/pm/Math/GSL/Heapsort.pm.1.15
-index 31d00d8..64d7534 100644
+index 4b22a54..aa216d2 100644
--- a/pm/Math/GSL/Heapsort.pm.1.15
+++ b/pm/Math/GSL/Heapsort.pm.1.15
@@ -159,7 +159,7 @@ Here is a list of all the functions in this module :
@@ -2655,7 +2835,7 @@ index 31d00d8..64d7534 100644
diff --git a/pm/Math/GSL/Heapsort.pm.1.16 b/pm/Math/GSL/Heapsort.pm.1.16
-index 31d00d8..64d7534 100644
+index 4b22a54..aa216d2 100644
--- a/pm/Math/GSL/Heapsort.pm.1.16
+++ b/pm/Math/GSL/Heapsort.pm.1.16
@@ -159,7 +159,7 @@ Here is a list of all the functions in this module :
@@ -2667,8 +2847,116 @@ index 31d00d8..64d7534 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+diff --git a/pm/Math/GSL/Histogram2D.pm.1.11 b/pm/Math/GSL/Histogram2D.pm.1.11
+index 7365740..93a1d0c 100644
+--- a/pm/Math/GSL/Histogram2D.pm.1.11
++++ b/pm/Math/GSL/Histogram2D.pm.1.11
+@@ -334,11 +334,11 @@ C<gsl_histogram2d_set_ranges_uniform> or this function will return undef.
+
+ =item C<gsl_histogram2d_max_val($h)> - This function returns the maximum value contained in the histogram bins.
+
+-=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
++=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
+
+ =item C<gsl_histogram2d_min_val($h)> - This function returns the minimum value contained in the histogram bins.
+
+-=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
++=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
+
+ =item C<gsl_histogram2d_xmean($h)> - This function returns the mean of the histogrammed x variable, where the histogram is regarded as a probability distribution. Negative bin values are ignored for the purposes of this calculation.
+
+diff --git a/pm/Math/GSL/Histogram2D.pm.1.12 b/pm/Math/GSL/Histogram2D.pm.1.12
+index 7365740..93a1d0c 100644
+--- a/pm/Math/GSL/Histogram2D.pm.1.12
++++ b/pm/Math/GSL/Histogram2D.pm.1.12
+@@ -334,11 +334,11 @@ C<gsl_histogram2d_set_ranges_uniform> or this function will return undef.
+
+ =item C<gsl_histogram2d_max_val($h)> - This function returns the maximum value contained in the histogram bins.
+
+-=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
++=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
+
+ =item C<gsl_histogram2d_min_val($h)> - This function returns the minimum value contained in the histogram bins.
+
+-=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
++=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
+
+ =item C<gsl_histogram2d_xmean($h)> - This function returns the mean of the histogrammed x variable, where the histogram is regarded as a probability distribution. Negative bin values are ignored for the purposes of this calculation.
+
+diff --git a/pm/Math/GSL/Histogram2D.pm.1.13 b/pm/Math/GSL/Histogram2D.pm.1.13
+index 7365740..93a1d0c 100644
+--- a/pm/Math/GSL/Histogram2D.pm.1.13
++++ b/pm/Math/GSL/Histogram2D.pm.1.13
+@@ -334,11 +334,11 @@ C<gsl_histogram2d_set_ranges_uniform> or this function will return undef.
+
+ =item C<gsl_histogram2d_max_val($h)> - This function returns the maximum value contained in the histogram bins.
+
+-=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
++=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
+
+ =item C<gsl_histogram2d_min_val($h)> - This function returns the minimum value contained in the histogram bins.
+
+-=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
++=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
+
+ =item C<gsl_histogram2d_xmean($h)> - This function returns the mean of the histogrammed x variable, where the histogram is regarded as a probability distribution. Negative bin values are ignored for the purposes of this calculation.
+
+diff --git a/pm/Math/GSL/Histogram2D.pm.1.14 b/pm/Math/GSL/Histogram2D.pm.1.14
+index 7365740..93a1d0c 100644
+--- a/pm/Math/GSL/Histogram2D.pm.1.14
++++ b/pm/Math/GSL/Histogram2D.pm.1.14
+@@ -334,11 +334,11 @@ C<gsl_histogram2d_set_ranges_uniform> or this function will return undef.
+
+ =item C<gsl_histogram2d_max_val($h)> - This function returns the maximum value contained in the histogram bins.
+
+-=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
++=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
+
+ =item C<gsl_histogram2d_min_val($h)> - This function returns the minimum value contained in the histogram bins.
+
+-=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
++=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
+
+ =item C<gsl_histogram2d_xmean($h)> - This function returns the mean of the histogrammed x variable, where the histogram is regarded as a probability distribution. Negative bin values are ignored for the purposes of this calculation.
+
+diff --git a/pm/Math/GSL/Histogram2D.pm.1.15 b/pm/Math/GSL/Histogram2D.pm.1.15
+index 7365740..93a1d0c 100644
+--- a/pm/Math/GSL/Histogram2D.pm.1.15
++++ b/pm/Math/GSL/Histogram2D.pm.1.15
+@@ -334,11 +334,11 @@ C<gsl_histogram2d_set_ranges_uniform> or this function will return undef.
+
+ =item C<gsl_histogram2d_max_val($h)> - This function returns the maximum value contained in the histogram bins.
+
+-=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
++=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
+
+ =item C<gsl_histogram2d_min_val($h)> - This function returns the minimum value contained in the histogram bins.
+
+-=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
++=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
+
+ =item C<gsl_histogram2d_xmean($h)> - This function returns the mean of the histogrammed x variable, where the histogram is regarded as a probability distribution. Negative bin values are ignored for the purposes of this calculation.
+
+diff --git a/pm/Math/GSL/Histogram2D.pm.1.16 b/pm/Math/GSL/Histogram2D.pm.1.16
+index 7365740..93a1d0c 100644
+--- a/pm/Math/GSL/Histogram2D.pm.1.16
++++ b/pm/Math/GSL/Histogram2D.pm.1.16
+@@ -334,11 +334,11 @@ C<gsl_histogram2d_set_ranges_uniform> or this function will return undef.
+
+ =item C<gsl_histogram2d_max_val($h)> - This function returns the maximum value contained in the histogram bins.
+
+-=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
++=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
+
+ =item C<gsl_histogram2d_min_val($h)> - This function returns the minimum value contained in the histogram bins.
+
+-=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
++=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
+
+ =item C<gsl_histogram2d_xmean($h)> - This function returns the mean of the histogrammed x variable, where the histogram is regarded as a probability distribution. Negative bin values are ignored for the purposes of this calculation.
+
diff --git a/pm/Math/GSL/Integration.pm.1.11 b/pm/Math/GSL/Integration.pm.1.11
-index d10fcb3..494f27a 100644
+index 3f46f18..3924b1a 100644
--- a/pm/Math/GSL/Integration.pm.1.11
+++ b/pm/Math/GSL/Integration.pm.1.11
@@ -631,7 +631,7 @@ The integral is divergent, or too slowly convergent to be integrated numerically
@@ -2681,7 +2969,7 @@ index d10fcb3..494f27a 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Integration.pm.1.12 b/pm/Math/GSL/Integration.pm.1.12
-index d10fcb3..494f27a 100644
+index 3f46f18..3924b1a 100644
--- a/pm/Math/GSL/Integration.pm.1.12
+++ b/pm/Math/GSL/Integration.pm.1.12
@@ -631,7 +631,7 @@ The integral is divergent, or too slowly convergent to be integrated numerically
@@ -2694,7 +2982,7 @@ index d10fcb3..494f27a 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Integration.pm.1.13 b/pm/Math/GSL/Integration.pm.1.13
-index d10fcb3..494f27a 100644
+index 3f46f18..3924b1a 100644
--- a/pm/Math/GSL/Integration.pm.1.13
+++ b/pm/Math/GSL/Integration.pm.1.13
@@ -631,7 +631,7 @@ The integral is divergent, or too slowly convergent to be integrated numerically
@@ -2707,7 +2995,7 @@ index d10fcb3..494f27a 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Integration.pm.1.14 b/pm/Math/GSL/Integration.pm.1.14
-index 28b1da7..f2cfb1a 100644
+index 7eda36d..060ccc7 100644
--- a/pm/Math/GSL/Integration.pm.1.14
+++ b/pm/Math/GSL/Integration.pm.1.14
@@ -679,7 +679,7 @@ The integral is divergent, or too slowly convergent to be integrated numerically
@@ -2720,7 +3008,7 @@ index 28b1da7..f2cfb1a 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Integration.pm.1.15 b/pm/Math/GSL/Integration.pm.1.15
-index 9332455..497409c 100644
+index 9d829b5..7f447b0 100644
--- a/pm/Math/GSL/Integration.pm.1.15
+++ b/pm/Math/GSL/Integration.pm.1.15
@@ -781,7 +781,7 @@ The integral is divergent, or too slowly convergent to be integrated numerically
@@ -2733,7 +3021,7 @@ index 9332455..497409c 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Integration.pm.1.16 b/pm/Math/GSL/Integration.pm.1.16
-index 9332455..497409c 100644
+index 9d829b5..7f447b0 100644
--- a/pm/Math/GSL/Integration.pm.1.16
+++ b/pm/Math/GSL/Integration.pm.1.16
@@ -781,7 +781,7 @@ The integral is divergent, or too slowly convergent to be integrated numerically
@@ -2746,9 +3034,77 @@ index 9332455..497409c 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Linalg.pm.1.11 b/pm/Math/GSL/Linalg.pm.1.11
-index 07e58e5..88e76a9 100644
+index b216d28..1f27f36 100644
--- a/pm/Math/GSL/Linalg.pm.1.11
+++ b/pm/Math/GSL/Linalg.pm.1.11
+@@ -549,7 +549,7 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_complex_householder_transform
+
+-=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_householder_mh($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the right-hand side of the matrix $A. On output the result A P is stored in $A.
+
+@@ -563,7 +563,7 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_complex_householder_hv($tau, $v, $w) - Does the same operation than gsl_linalg_householder_hv but with the complex value $tau and the complex vectors $v and $w.
+
+-=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
++=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
+
+ =item gsl_linalg_hessenberg_unpack($H, $tau, $U) - This function constructs the orthogonal matrix $U from the information stored in the Hessenberg matrix $H along with the vector $tau. $H and $tau are outputs from gsl_linalg_hessenberg_decomp.
+
+@@ -587,9 +587,9 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_LU_decomp($a, $p) - factorize the matrix $a into the LU decomposition PA = LU. On output the diagonal and upper triangular part of the input matrix A contain the matrix U. The lower triangular part of the input matrix (excluding the diagonal) contains L. The diagonal elements of L are unity, and are not stored. The function returns two value, the first is 0 if the operation succeeded, 1 otherwise, and the second is the sign of the permutation.
+
+-=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeeded, 0 otherwise.
+
+-=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeeded, 0 otherwise.
+
+ =item gsl_linalg_LU_refine($A, $LU, $p, $b, $x, $residual) - This function apply an iterative improvement to $x, the solution of $A $x = $b, using the LU decomposition of $A into ($LU,$p). The initial residual $r = $A $x - $b (where $x and $b are vectors) is also computed and stored in the vector $residual.
+
+@@ -623,27 +623,27 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_QR_svx($QR, $tau, $x) - This function solves the square system A x = b in-place using the QR decomposition of A into the matrix $QR and the vector $tau given by gsl_linalg_QR_decomp. On input, the vector $x should contain the right-hand side b, which is replaced by the solution on output.
+
+-=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
++=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
+
+-=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_QR_Rsolve($QR, $b, $x) - This function solves the triangular system R $x = $b for $x. It may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec.
+
+-=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_QRPT_decomp($A, $tau, $p, $norm) - This function factorizes the M-by-N matrix $A into the QRP^T decomposition A = Q R P^T. On output the diagonal and upper triangular part of the input matrix contain the matrix R. The permutation matrix P is stored in the permutation $p. There's two value returned by this function : the first is 0 if the operation succeeded, 1 otherwise. The second is sign of the permutation. It has the value (-1)^n, where n is the number of interchange [...]
+
@@ -756,7 +756,7 @@ Here is a list of all the functions included in this module :
You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all avaible functions of the module.
@@ -2759,9 +3115,77 @@ index 07e58e5..88e76a9 100644
=back
diff --git a/pm/Math/GSL/Linalg.pm.1.12 b/pm/Math/GSL/Linalg.pm.1.12
-index cef0d0f..858e077 100644
+index a0060ee..8763587 100644
--- a/pm/Math/GSL/Linalg.pm.1.12
+++ b/pm/Math/GSL/Linalg.pm.1.12
+@@ -550,7 +550,7 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_complex_householder_transform
+
+-=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_householder_mh($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the right-hand side of the matrix $A. On output the result A P is stored in $A.
+
+@@ -564,7 +564,7 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_complex_householder_hv($tau, $v, $w) - Does the same operation than gsl_linalg_householder_hv but with the complex value $tau and the complex vectors $v and $w.
+
+-=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
++=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
+
+ =item gsl_linalg_hessenberg_unpack($H, $tau, $U) - This function constructs the orthogonal matrix $U from the information stored in the Hessenberg matrix $H along with the vector $tau. $H and $tau are outputs from gsl_linalg_hessenberg_decomp.
+
+@@ -588,9 +588,9 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_LU_decomp($a, $p) - factorize the matrix $a into the LU decomposition PA = LU. On output the diagonal and upper triangular part of the input matrix A contain the matrix U. The lower triangular part of the input matrix (excluding the diagonal) contains L. The diagonal elements of L are unity, and are not stored. The function returns two value, the first is 0 if the operation succeeded, 1 otherwise, and the second is the sign of the permutation.
+
+-=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeeded, 0 otherwise.
+
+-=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeeded, 0 otherwise.
+
+ =item gsl_linalg_LU_refine($A, $LU, $p, $b, $x, $residual) - This function apply an iterative improvement to $x, the solution of $A $x = $b, using the LU decomposition of $A into ($LU,$p). The initial residual $r = $A $x - $b (where $x and $b are vectors) is also computed and stored in the vector $residual.
+
+@@ -624,27 +624,27 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_QR_svx($QR, $tau, $x) - This function solves the square system A x = b in-place using the QR decomposition of A into the matrix $QR and the vector $tau given by gsl_linalg_QR_decomp. On input, the vector $x should contain the right-hand side b, which is replaced by the solution on output.
+
+-=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
++=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
+
+-=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_QR_Rsolve($QR, $b, $x) - This function solves the triangular system R $x = $b for $x. It may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec.
+
+-=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_QRPT_decomp($A, $tau, $p, $norm) - This function factorizes the M-by-N matrix $A into the QRP^T decomposition A = Q R P^T. On output the diagonal and upper triangular part of the input matrix contain the matrix R. The permutation matrix P is stored in the permutation $p. There's two value returned by this function : the first is 0 if the operation succeeded, 1 otherwise. The second is sign of the permutation. It has the value (-1)^n, where n is the number of interchange [...]
+
@@ -757,7 +757,7 @@ Here is a list of all the functions included in this module :
You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all avaible functions of the module.
@@ -2772,9 +3196,77 @@ index cef0d0f..858e077 100644
=back
diff --git a/pm/Math/GSL/Linalg.pm.1.13 b/pm/Math/GSL/Linalg.pm.1.13
-index cef0d0f..858e077 100644
+index a0060ee..8763587 100644
--- a/pm/Math/GSL/Linalg.pm.1.13
+++ b/pm/Math/GSL/Linalg.pm.1.13
+@@ -550,7 +550,7 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_complex_householder_transform
+
+-=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_householder_mh($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the right-hand side of the matrix $A. On output the result A P is stored in $A.
+
+@@ -564,7 +564,7 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_complex_householder_hv($tau, $v, $w) - Does the same operation than gsl_linalg_householder_hv but with the complex value $tau and the complex vectors $v and $w.
+
+-=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
++=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
+
+ =item gsl_linalg_hessenberg_unpack($H, $tau, $U) - This function constructs the orthogonal matrix $U from the information stored in the Hessenberg matrix $H along with the vector $tau. $H and $tau are outputs from gsl_linalg_hessenberg_decomp.
+
+@@ -588,9 +588,9 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_LU_decomp($a, $p) - factorize the matrix $a into the LU decomposition PA = LU. On output the diagonal and upper triangular part of the input matrix A contain the matrix U. The lower triangular part of the input matrix (excluding the diagonal) contains L. The diagonal elements of L are unity, and are not stored. The function returns two value, the first is 0 if the operation succeeded, 1 otherwise, and the second is the sign of the permutation.
+
+-=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeeded, 0 otherwise.
+
+-=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeeded, 0 otherwise.
+
+ =item gsl_linalg_LU_refine($A, $LU, $p, $b, $x, $residual) - This function apply an iterative improvement to $x, the solution of $A $x = $b, using the LU decomposition of $A into ($LU,$p). The initial residual $r = $A $x - $b (where $x and $b are vectors) is also computed and stored in the vector $residual.
+
+@@ -624,27 +624,27 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_QR_svx($QR, $tau, $x) - This function solves the square system A x = b in-place using the QR decomposition of A into the matrix $QR and the vector $tau given by gsl_linalg_QR_decomp. On input, the vector $x should contain the right-hand side b, which is replaced by the solution on output.
+
+-=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
++=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
+
+-=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_QR_Rsolve($QR, $b, $x) - This function solves the triangular system R $x = $b for $x. It may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec.
+
+-=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_QRPT_decomp($A, $tau, $p, $norm) - This function factorizes the M-by-N matrix $A into the QRP^T decomposition A = Q R P^T. On output the diagonal and upper triangular part of the input matrix contain the matrix R. The permutation matrix P is stored in the permutation $p. There's two value returned by this function : the first is 0 if the operation succeeded, 1 otherwise. The second is sign of the permutation. It has the value (-1)^n, where n is the number of interchange [...]
+
@@ -757,7 +757,7 @@ Here is a list of all the functions included in this module :
You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all avaible functions of the module.
@@ -2785,9 +3277,77 @@ index cef0d0f..858e077 100644
=back
diff --git a/pm/Math/GSL/Linalg.pm.1.14 b/pm/Math/GSL/Linalg.pm.1.14
-index cef0d0f..858e077 100644
+index a0060ee..8763587 100644
--- a/pm/Math/GSL/Linalg.pm.1.14
+++ b/pm/Math/GSL/Linalg.pm.1.14
+@@ -550,7 +550,7 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_complex_householder_transform
+
+-=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_householder_mh($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the right-hand side of the matrix $A. On output the result A P is stored in $A.
+
+@@ -564,7 +564,7 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_complex_householder_hv($tau, $v, $w) - Does the same operation than gsl_linalg_householder_hv but with the complex value $tau and the complex vectors $v and $w.
+
+-=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
++=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
+
+ =item gsl_linalg_hessenberg_unpack($H, $tau, $U) - This function constructs the orthogonal matrix $U from the information stored in the Hessenberg matrix $H along with the vector $tau. $H and $tau are outputs from gsl_linalg_hessenberg_decomp.
+
+@@ -588,9 +588,9 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_LU_decomp($a, $p) - factorize the matrix $a into the LU decomposition PA = LU. On output the diagonal and upper triangular part of the input matrix A contain the matrix U. The lower triangular part of the input matrix (excluding the diagonal) contains L. The diagonal elements of L are unity, and are not stored. The function returns two value, the first is 0 if the operation succeeded, 1 otherwise, and the second is the sign of the permutation.
+
+-=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeeded, 0 otherwise.
+
+-=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeeded, 0 otherwise.
+
+ =item gsl_linalg_LU_refine($A, $LU, $p, $b, $x, $residual) - This function apply an iterative improvement to $x, the solution of $A $x = $b, using the LU decomposition of $A into ($LU,$p). The initial residual $r = $A $x - $b (where $x and $b are vectors) is also computed and stored in the vector $residual.
+
+@@ -624,27 +624,27 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_QR_svx($QR, $tau, $x) - This function solves the square system A x = b in-place using the QR decomposition of A into the matrix $QR and the vector $tau given by gsl_linalg_QR_decomp. On input, the vector $x should contain the right-hand side b, which is replaced by the solution on output.
+
+-=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
++=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
+
+-=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_QR_Rsolve($QR, $b, $x) - This function solves the triangular system R $x = $b for $x. It may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec.
+
+-=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_QRPT_decomp($A, $tau, $p, $norm) - This function factorizes the M-by-N matrix $A into the QRP^T decomposition A = Q R P^T. On output the diagonal and upper triangular part of the input matrix contain the matrix R. The permutation matrix P is stored in the permutation $p. There's two value returned by this function : the first is 0 if the operation succeeded, 1 otherwise. The second is sign of the permutation. It has the value (-1)^n, where n is the number of interchange [...]
+
@@ -757,7 +757,7 @@ Here is a list of all the functions included in this module :
You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all avaible functions of the module.
@@ -2798,9 +3358,77 @@ index cef0d0f..858e077 100644
=back
diff --git a/pm/Math/GSL/Linalg.pm.1.15 b/pm/Math/GSL/Linalg.pm.1.15
-index f017caf..3d486a1 100644
+index 59f29f8..7d6fe33 100644
--- a/pm/Math/GSL/Linalg.pm.1.15
+++ b/pm/Math/GSL/Linalg.pm.1.15
+@@ -551,7 +551,7 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_complex_householder_transform
+
+-=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_householder_mh($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the right-hand side of the matrix $A. On output the result A P is stored in $A.
+
+@@ -565,7 +565,7 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_complex_householder_hv($tau, $v, $w) - Does the same operation than gsl_linalg_householder_hv but with the complex value $tau and the complex vectors $v and $w.
+
+-=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
++=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
+
+ =item gsl_linalg_hessenberg_unpack($H, $tau, $U) - This function constructs the orthogonal matrix $U from the information stored in the Hessenberg matrix $H along with the vector $tau. $H and $tau are outputs from gsl_linalg_hessenberg_decomp.
+
+@@ -589,9 +589,9 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_LU_decomp($a, $p) - factorize the matrix $a into the LU decomposition PA = LU. On output the diagonal and upper triangular part of the input matrix A contain the matrix U. The lower triangular part of the input matrix (excluding the diagonal) contains L. The diagonal elements of L are unity, and are not stored. The function returns two value, the first is 0 if the operation succeeded, 1 otherwise, and the second is the sign of the permutation.
+
+-=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeeded, 0 otherwise.
+
+-=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeeded, 0 otherwise.
+
+ =item gsl_linalg_LU_refine($A, $LU, $p, $b, $x, $residual) - This function apply an iterative improvement to $x, the solution of $A $x = $b, using the LU decomposition of $A into ($LU,$p). The initial residual $r = $A $x - $b (where $x and $b are vectors) is also computed and stored in the vector $residual.
+
+@@ -625,27 +625,27 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_QR_svx($QR, $tau, $x) - This function solves the square system A x = b in-place using the QR decomposition of A into the matrix $QR and the vector $tau given by gsl_linalg_QR_decomp. On input, the vector $x should contain the right-hand side b, which is replaced by the solution on output.
+
+-=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
++=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
+
+-=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_QR_Rsolve($QR, $b, $x) - This function solves the triangular system R $x = $b for $x. It may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec.
+
+-=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_QRPT_decomp($A, $tau, $p, $norm) - This function factorizes the M-by-N matrix $A into the QRP^T decomposition A = Q R P^T. On output the diagonal and upper triangular part of the input matrix contain the matrix R. The permutation matrix P is stored in the permutation $p. There's two value returned by this function : the first is 0 if the operation succeeded, 1 otherwise. The second is sign of the permutation. It has the value (-1)^n, where n is the number of interchange [...]
+
@@ -758,7 +758,7 @@ Here is a list of all the functions included in this module :
You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all avaible functions of the module.
@@ -2811,9 +3439,77 @@ index f017caf..3d486a1 100644
=back
diff --git a/pm/Math/GSL/Linalg.pm.1.16 b/pm/Math/GSL/Linalg.pm.1.16
-index f017caf..3d486a1 100644
+index 59f29f8..7d6fe33 100644
--- a/pm/Math/GSL/Linalg.pm.1.16
+++ b/pm/Math/GSL/Linalg.pm.1.16
+@@ -551,7 +551,7 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_complex_householder_transform
+
+-=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_householder_mh($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the right-hand side of the matrix $A. On output the result A P is stored in $A.
+
+@@ -565,7 +565,7 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_complex_householder_hv($tau, $v, $w) - Does the same operation than gsl_linalg_householder_hv but with the complex value $tau and the complex vectors $v and $w.
+
+-=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
++=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
+
+ =item gsl_linalg_hessenberg_unpack($H, $tau, $U) - This function constructs the orthogonal matrix $U from the information stored in the Hessenberg matrix $H along with the vector $tau. $H and $tau are outputs from gsl_linalg_hessenberg_decomp.
+
+@@ -589,9 +589,9 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_LU_decomp($a, $p) - factorize the matrix $a into the LU decomposition PA = LU. On output the diagonal and upper triangular part of the input matrix A contain the matrix U. The lower triangular part of the input matrix (excluding the diagonal) contains L. The diagonal elements of L are unity, and are not stored. The function returns two value, the first is 0 if the operation succeeded, 1 otherwise, and the second is the sign of the permutation.
+
+-=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeeded, 0 otherwise.
+
+-=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeeded, 0 otherwise.
+
+ =item gsl_linalg_LU_refine($A, $LU, $p, $b, $x, $residual) - This function apply an iterative improvement to $x, the solution of $A $x = $b, using the LU decomposition of $A into ($LU,$p). The initial residual $r = $A $x - $b (where $x and $b are vectors) is also computed and stored in the vector $residual.
+
+@@ -625,27 +625,27 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_QR_svx($QR, $tau, $x) - This function solves the square system A x = b in-place using the QR decomposition of A into the matrix $QR and the vector $tau given by gsl_linalg_QR_decomp. On input, the vector $x should contain the right-hand side b, which is replaced by the solution on output.
+
+-=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
++=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
+
+-=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_QR_Rsolve($QR, $b, $x) - This function solves the triangular system R $x = $b for $x. It may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec.
+
+-=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_QRPT_decomp($A, $tau, $p, $norm) - This function factorizes the M-by-N matrix $A into the QRP^T decomposition A = Q R P^T. On output the diagonal and upper triangular part of the input matrix contain the matrix R. The permutation matrix P is stored in the permutation $p. There's two value returned by this function : the first is 0 if the operation succeeded, 1 otherwise. The second is sign of the permutation. It has the value (-1)^n, where n is the number of interchange [...]
+
@@ -758,7 +758,7 @@ Here is a list of all the functions included in this module :
You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all avaible functions of the module.
@@ -2824,7 +3520,7 @@ index f017caf..3d486a1 100644
=back
diff --git a/pm/Math/GSL/Matrix.pm.1.11 b/pm/Math/GSL/Matrix.pm.1.11
-index 7e142c6..d031421 100644
+index 177efd9..e9ca947 100644
--- a/pm/Math/GSL/Matrix.pm.1.11
+++ b/pm/Math/GSL/Matrix.pm.1.11
@@ -2363,11 +2363,11 @@ Here is a list of all the functions included in this module :
@@ -2856,16 +3552,16 @@ index 7e142c6..d031421 100644
=item C<gsl_matrix_add_diagonal($a, $x)> - Add the constant value $x to the elements of the diagonal of the matrix $a
-=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
-=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
-=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
-=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
=back
@@ -2879,7 +3575,7 @@ index 7e142c6..d031421 100644
diff --git a/pm/Math/GSL/Matrix.pm.1.12 b/pm/Math/GSL/Matrix.pm.1.12
-index eebb1be..55f99e5 100644
+index 90cb486..6673f47 100644
--- a/pm/Math/GSL/Matrix.pm.1.12
+++ b/pm/Math/GSL/Matrix.pm.1.12
@@ -2364,11 +2364,11 @@ Here is a list of all the functions included in this module :
@@ -2911,16 +3607,16 @@ index eebb1be..55f99e5 100644
=item C<gsl_matrix_add_diagonal($a, $x)> - Add the constant value $x to the elements of the diagonal of the matrix $a
-=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
-=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
-=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
-=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
=back
@@ -2934,7 +3630,7 @@ index eebb1be..55f99e5 100644
diff --git a/pm/Math/GSL/Matrix.pm.1.13 b/pm/Math/GSL/Matrix.pm.1.13
-index eebb1be..55f99e5 100644
+index 90cb486..6673f47 100644
--- a/pm/Math/GSL/Matrix.pm.1.13
+++ b/pm/Math/GSL/Matrix.pm.1.13
@@ -2364,11 +2364,11 @@ Here is a list of all the functions included in this module :
@@ -2966,16 +3662,16 @@ index eebb1be..55f99e5 100644
=item C<gsl_matrix_add_diagonal($a, $x)> - Add the constant value $x to the elements of the diagonal of the matrix $a
-=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
-=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
-=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
-=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
=back
@@ -2989,7 +3685,7 @@ index eebb1be..55f99e5 100644
diff --git a/pm/Math/GSL/Matrix.pm.1.14 b/pm/Math/GSL/Matrix.pm.1.14
-index eebb1be..55f99e5 100644
+index 90cb486..6673f47 100644
--- a/pm/Math/GSL/Matrix.pm.1.14
+++ b/pm/Math/GSL/Matrix.pm.1.14
@@ -2364,11 +2364,11 @@ Here is a list of all the functions included in this module :
@@ -3021,16 +3717,16 @@ index eebb1be..55f99e5 100644
=item C<gsl_matrix_add_diagonal($a, $x)> - Add the constant value $x to the elements of the diagonal of the matrix $a
-=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
-=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
-=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
-=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
=back
@@ -3044,7 +3740,7 @@ index eebb1be..55f99e5 100644
diff --git a/pm/Math/GSL/Matrix.pm.1.15 b/pm/Math/GSL/Matrix.pm.1.15
-index 5b83f35..1fa72f0 100644
+index 3c27f4d..7d884ef 100644
--- a/pm/Math/GSL/Matrix.pm.1.15
+++ b/pm/Math/GSL/Matrix.pm.1.15
@@ -2369,11 +2369,11 @@ Here is a list of all the functions included in this module :
@@ -3076,16 +3772,16 @@ index 5b83f35..1fa72f0 100644
=item C<gsl_matrix_add_diagonal($a, $x)> - Add the constant value $x to the elements of the diagonal of the matrix $a
-=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
-=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
-=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
-=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
=back
@@ -3099,7 +3795,7 @@ index 5b83f35..1fa72f0 100644
diff --git a/pm/Math/GSL/Matrix.pm.1.16 b/pm/Math/GSL/Matrix.pm.1.16
-index 5b83f35..1fa72f0 100644
+index 3c27f4d..7d884ef 100644
--- a/pm/Math/GSL/Matrix.pm.1.16
+++ b/pm/Math/GSL/Matrix.pm.1.16
@@ -2369,11 +2369,11 @@ Here is a list of all the functions included in this module :
@@ -3131,16 +3827,16 @@ index 5b83f35..1fa72f0 100644
=item C<gsl_matrix_add_diagonal($a, $x)> - Add the constant value $x to the elements of the diagonal of the matrix $a
-=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
-=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
-=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
-=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
=back
@@ -3154,7 +3850,7 @@ index 5b83f35..1fa72f0 100644
diff --git a/pm/Math/GSL/MatrixComplex.pm.1.11 b/pm/Math/GSL/MatrixComplex.pm.1.11
-index f87a130..b112aa9 100644
+index 4d7c85c..f1affc0 100644
--- a/pm/Math/GSL/MatrixComplex.pm.1.11
+++ b/pm/Math/GSL/MatrixComplex.pm.1.11
@@ -1229,7 +1229,7 @@ sub lndet($)
@@ -3167,7 +3863,7 @@ index f87a130..b112aa9 100644
diff --git a/pm/Math/GSL/MatrixComplex.pm.1.12 b/pm/Math/GSL/MatrixComplex.pm.1.12
-index 66ac9dd..6def949 100644
+index e79e827..651373d 100644
--- a/pm/Math/GSL/MatrixComplex.pm.1.12
+++ b/pm/Math/GSL/MatrixComplex.pm.1.12
@@ -1230,7 +1230,7 @@ sub lndet($)
@@ -3180,7 +3876,7 @@ index 66ac9dd..6def949 100644
diff --git a/pm/Math/GSL/MatrixComplex.pm.1.13 b/pm/Math/GSL/MatrixComplex.pm.1.13
-index 66ac9dd..6def949 100644
+index e79e827..651373d 100644
--- a/pm/Math/GSL/MatrixComplex.pm.1.13
+++ b/pm/Math/GSL/MatrixComplex.pm.1.13
@@ -1230,7 +1230,7 @@ sub lndet($)
@@ -3193,7 +3889,7 @@ index 66ac9dd..6def949 100644
diff --git a/pm/Math/GSL/MatrixComplex.pm.1.14 b/pm/Math/GSL/MatrixComplex.pm.1.14
-index 66ac9dd..6def949 100644
+index e79e827..651373d 100644
--- a/pm/Math/GSL/MatrixComplex.pm.1.14
+++ b/pm/Math/GSL/MatrixComplex.pm.1.14
@@ -1230,7 +1230,7 @@ sub lndet($)
@@ -3206,7 +3902,7 @@ index 66ac9dd..6def949 100644
diff --git a/pm/Math/GSL/MatrixComplex.pm.1.15 b/pm/Math/GSL/MatrixComplex.pm.1.15
-index 3b4ec33..48af7c8 100644
+index 8e82f89..72ff7b2 100644
--- a/pm/Math/GSL/MatrixComplex.pm.1.15
+++ b/pm/Math/GSL/MatrixComplex.pm.1.15
@@ -1232,7 +1232,7 @@ sub lndet($)
@@ -3219,7 +3915,7 @@ index 3b4ec33..48af7c8 100644
diff --git a/pm/Math/GSL/MatrixComplex.pm.1.16 b/pm/Math/GSL/MatrixComplex.pm.1.16
-index 3b4ec33..48af7c8 100644
+index 8e82f89..72ff7b2 100644
--- a/pm/Math/GSL/MatrixComplex.pm.1.16
+++ b/pm/Math/GSL/MatrixComplex.pm.1.16
@@ -1232,7 +1232,7 @@ sub lndet($)
@@ -3232,7 +3928,7 @@ index 3b4ec33..48af7c8 100644
diff --git a/pm/Math/GSL/Min.pm.1.11 b/pm/Math/GSL/Min.pm.1.11
-index 18baaba..5a6afb9 100644
+index f0bd185..1c715e6 100644
--- a/pm/Math/GSL/Min.pm.1.11
+++ b/pm/Math/GSL/Min.pm.1.11
@@ -436,7 +436,7 @@ This module also includes the following constants :
@@ -3245,7 +3941,7 @@ index 18baaba..5a6afb9 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Min.pm.1.12 b/pm/Math/GSL/Min.pm.1.12
-index 18baaba..5a6afb9 100644
+index f0bd185..1c715e6 100644
--- a/pm/Math/GSL/Min.pm.1.12
+++ b/pm/Math/GSL/Min.pm.1.12
@@ -436,7 +436,7 @@ This module also includes the following constants :
@@ -3258,7 +3954,7 @@ index 18baaba..5a6afb9 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Min.pm.1.13 b/pm/Math/GSL/Min.pm.1.13
-index ce5a43f..2e7f01c 100644
+index f5d5d80..9831305 100644
--- a/pm/Math/GSL/Min.pm.1.13
+++ b/pm/Math/GSL/Min.pm.1.13
@@ -441,7 +441,7 @@ This module also includes the following constants :
@@ -3271,7 +3967,7 @@ index ce5a43f..2e7f01c 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Min.pm.1.14 b/pm/Math/GSL/Min.pm.1.14
-index ce5a43f..2e7f01c 100644
+index f5d5d80..9831305 100644
--- a/pm/Math/GSL/Min.pm.1.14
+++ b/pm/Math/GSL/Min.pm.1.14
@@ -441,7 +441,7 @@ This module also includes the following constants :
@@ -3284,7 +3980,7 @@ index ce5a43f..2e7f01c 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Min.pm.1.15 b/pm/Math/GSL/Min.pm.1.15
-index ce5a43f..2e7f01c 100644
+index f5d5d80..9831305 100644
--- a/pm/Math/GSL/Min.pm.1.15
+++ b/pm/Math/GSL/Min.pm.1.15
@@ -441,7 +441,7 @@ This module also includes the following constants :
@@ -3297,7 +3993,7 @@ index ce5a43f..2e7f01c 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Min.pm.1.16 b/pm/Math/GSL/Min.pm.1.16
-index ce5a43f..2e7f01c 100644
+index f5d5d80..9831305 100644
--- a/pm/Math/GSL/Min.pm.1.16
+++ b/pm/Math/GSL/Min.pm.1.16
@@ -441,7 +441,7 @@ This module also includes the following constants :
@@ -3310,7 +4006,7 @@ index ce5a43f..2e7f01c 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Monte.pm.1.11 b/pm/Math/GSL/Monte.pm.1.11
-index 5f3a1d0..bc63767 100644
+index 786f6e0..fb10d93 100644
--- a/pm/Math/GSL/Monte.pm.1.11
+++ b/pm/Math/GSL/Monte.pm.1.11
@@ -457,7 +457,7 @@ This module also includes the following constants :
@@ -3323,7 +4019,7 @@ index 5f3a1d0..bc63767 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Monte.pm.1.12 b/pm/Math/GSL/Monte.pm.1.12
-index 5f3a1d0..bc63767 100644
+index 786f6e0..fb10d93 100644
--- a/pm/Math/GSL/Monte.pm.1.12
+++ b/pm/Math/GSL/Monte.pm.1.12
@@ -457,7 +457,7 @@ This module also includes the following constants :
@@ -3336,7 +4032,7 @@ index 5f3a1d0..bc63767 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Monte.pm.1.13 b/pm/Math/GSL/Monte.pm.1.13
-index 4d1c795..fa84c73 100644
+index a147ea9..4ccd404 100644
--- a/pm/Math/GSL/Monte.pm.1.13
+++ b/pm/Math/GSL/Monte.pm.1.13
@@ -559,7 +559,7 @@ This module also includes the following constants :
@@ -3349,7 +4045,7 @@ index 4d1c795..fa84c73 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Monte.pm.1.14 b/pm/Math/GSL/Monte.pm.1.14
-index 4d1c795..fa84c73 100644
+index a147ea9..4ccd404 100644
--- a/pm/Math/GSL/Monte.pm.1.14
+++ b/pm/Math/GSL/Monte.pm.1.14
@@ -559,7 +559,7 @@ This module also includes the following constants :
@@ -3362,7 +4058,7 @@ index 4d1c795..fa84c73 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Monte.pm.1.15 b/pm/Math/GSL/Monte.pm.1.15
-index 4d1c795..fa84c73 100644
+index a147ea9..4ccd404 100644
--- a/pm/Math/GSL/Monte.pm.1.15
+++ b/pm/Math/GSL/Monte.pm.1.15
@@ -559,7 +559,7 @@ This module also includes the following constants :
@@ -3375,7 +4071,7 @@ index 4d1c795..fa84c73 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Monte.pm.1.16 b/pm/Math/GSL/Monte.pm.1.16
-index 4d1c795..fa84c73 100644
+index a147ea9..4ccd404 100644
--- a/pm/Math/GSL/Monte.pm.1.16
+++ b/pm/Math/GSL/Monte.pm.1.16
@@ -559,7 +559,7 @@ This module also includes the following constants :
@@ -3388,7 +4084,7 @@ index 4d1c795..fa84c73 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Multifit.pm.1.11 b/pm/Math/GSL/Multifit.pm.1.11
-index f55aa3e..ccd92bc 100644
+index b0edca2..2c78b65 100644
--- a/pm/Math/GSL/Multifit.pm.1.11
+++ b/pm/Math/GSL/Multifit.pm.1.11
@@ -547,7 +547,7 @@ The following functions are not yet implemented. Patches Welcome!
@@ -3401,7 +4097,7 @@ index f55aa3e..ccd92bc 100644
diff --git a/pm/Math/GSL/Multifit.pm.1.12 b/pm/Math/GSL/Multifit.pm.1.12
-index f55aa3e..ccd92bc 100644
+index b0edca2..2c78b65 100644
--- a/pm/Math/GSL/Multifit.pm.1.12
+++ b/pm/Math/GSL/Multifit.pm.1.12
@@ -547,7 +547,7 @@ The following functions are not yet implemented. Patches Welcome!
@@ -3414,7 +4110,7 @@ index f55aa3e..ccd92bc 100644
diff --git a/pm/Math/GSL/Multifit.pm.1.13 b/pm/Math/GSL/Multifit.pm.1.13
-index f55aa3e..ccd92bc 100644
+index b0edca2..2c78b65 100644
--- a/pm/Math/GSL/Multifit.pm.1.13
+++ b/pm/Math/GSL/Multifit.pm.1.13
@@ -547,7 +547,7 @@ The following functions are not yet implemented. Patches Welcome!
@@ -3427,7 +4123,7 @@ index f55aa3e..ccd92bc 100644
diff --git a/pm/Math/GSL/Multifit.pm.1.14 b/pm/Math/GSL/Multifit.pm.1.14
-index c835441..d97ab70 100644
+index 254647e..30257f7 100644
--- a/pm/Math/GSL/Multifit.pm.1.14
+++ b/pm/Math/GSL/Multifit.pm.1.14
@@ -549,7 +549,7 @@ The following functions are not yet implemented. Patches Welcome!
@@ -3440,7 +4136,7 @@ index c835441..d97ab70 100644
diff --git a/pm/Math/GSL/Multifit.pm.1.15 b/pm/Math/GSL/Multifit.pm.1.15
-index c835441..d97ab70 100644
+index 254647e..30257f7 100644
--- a/pm/Math/GSL/Multifit.pm.1.15
+++ b/pm/Math/GSL/Multifit.pm.1.15
@@ -549,7 +549,7 @@ The following functions are not yet implemented. Patches Welcome!
@@ -3453,7 +4149,7 @@ index c835441..d97ab70 100644
diff --git a/pm/Math/GSL/Multifit.pm.1.16 b/pm/Math/GSL/Multifit.pm.1.16
-index 75d534f..3e25c15 100644
+index ef25e4f..f191b78 100644
--- a/pm/Math/GSL/Multifit.pm.1.16
+++ b/pm/Math/GSL/Multifit.pm.1.16
@@ -772,7 +772,7 @@ The following functions are not yet implemented. Patches Welcome!
@@ -3466,7 +4162,7 @@ index 75d534f..3e25c15 100644
diff --git a/pm/Math/GSL/Multimin.pm.1.11 b/pm/Math/GSL/Multimin.pm.1.11
-index 45ad4b6..59f0609 100644
+index 3f125cb..78ec58f 100644
--- a/pm/Math/GSL/Multimin.pm.1.11
+++ b/pm/Math/GSL/Multimin.pm.1.11
@@ -506,7 +506,7 @@ This module also includes the following constants :
@@ -3479,7 +4175,7 @@ index 45ad4b6..59f0609 100644
diff --git a/pm/Math/GSL/Multimin.pm.1.12 b/pm/Math/GSL/Multimin.pm.1.12
-index 63c9fb1..6ab5369 100644
+index dbb0c06..805695e 100644
--- a/pm/Math/GSL/Multimin.pm.1.12
+++ b/pm/Math/GSL/Multimin.pm.1.12
@@ -516,7 +516,7 @@ This module also includes the following constants :
@@ -3492,7 +4188,7 @@ index 63c9fb1..6ab5369 100644
diff --git a/pm/Math/GSL/Multimin.pm.1.13 b/pm/Math/GSL/Multimin.pm.1.13
-index 63c9fb1..6ab5369 100644
+index dbb0c06..805695e 100644
--- a/pm/Math/GSL/Multimin.pm.1.13
+++ b/pm/Math/GSL/Multimin.pm.1.13
@@ -516,7 +516,7 @@ This module also includes the following constants :
@@ -3505,7 +4201,7 @@ index 63c9fb1..6ab5369 100644
diff --git a/pm/Math/GSL/Multimin.pm.1.14 b/pm/Math/GSL/Multimin.pm.1.14
-index 63c9fb1..6ab5369 100644
+index dbb0c06..805695e 100644
--- a/pm/Math/GSL/Multimin.pm.1.14
+++ b/pm/Math/GSL/Multimin.pm.1.14
@@ -516,7 +516,7 @@ This module also includes the following constants :
@@ -3518,7 +4214,7 @@ index 63c9fb1..6ab5369 100644
diff --git a/pm/Math/GSL/Multimin.pm.1.15 b/pm/Math/GSL/Multimin.pm.1.15
-index 63c9fb1..6ab5369 100644
+index dbb0c06..805695e 100644
--- a/pm/Math/GSL/Multimin.pm.1.15
+++ b/pm/Math/GSL/Multimin.pm.1.15
@@ -516,7 +516,7 @@ This module also includes the following constants :
@@ -3531,7 +4227,7 @@ index 63c9fb1..6ab5369 100644
diff --git a/pm/Math/GSL/Multimin.pm.1.16 b/pm/Math/GSL/Multimin.pm.1.16
-index 63c9fb1..6ab5369 100644
+index dbb0c06..805695e 100644
--- a/pm/Math/GSL/Multimin.pm.1.16
+++ b/pm/Math/GSL/Multimin.pm.1.16
@@ -516,7 +516,7 @@ This module also includes the following constants :
@@ -3544,7 +4240,7 @@ index 63c9fb1..6ab5369 100644
diff --git a/pm/Math/GSL/Multiroots.pm.1.11 b/pm/Math/GSL/Multiroots.pm.1.11
-index 5d7fcd9..ae5bc2b 100644
+index f172322..2fe07f3 100644
--- a/pm/Math/GSL/Multiroots.pm.1.11
+++ b/pm/Math/GSL/Multiroots.pm.1.11
@@ -500,7 +500,7 @@ Here is a list of all the functions in this module :
@@ -3557,7 +4253,7 @@ index 5d7fcd9..ae5bc2b 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Multiroots.pm.1.12 b/pm/Math/GSL/Multiroots.pm.1.12
-index 5d7fcd9..ae5bc2b 100644
+index f172322..2fe07f3 100644
--- a/pm/Math/GSL/Multiroots.pm.1.12
+++ b/pm/Math/GSL/Multiroots.pm.1.12
@@ -500,7 +500,7 @@ Here is a list of all the functions in this module :
@@ -3570,7 +4266,7 @@ index 5d7fcd9..ae5bc2b 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Multiroots.pm.1.13 b/pm/Math/GSL/Multiroots.pm.1.13
-index 5d7fcd9..ae5bc2b 100644
+index f172322..2fe07f3 100644
--- a/pm/Math/GSL/Multiroots.pm.1.13
+++ b/pm/Math/GSL/Multiroots.pm.1.13
@@ -500,7 +500,7 @@ Here is a list of all the functions in this module :
@@ -3583,7 +4279,7 @@ index 5d7fcd9..ae5bc2b 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Multiroots.pm.1.14 b/pm/Math/GSL/Multiroots.pm.1.14
-index 5d7fcd9..ae5bc2b 100644
+index f172322..2fe07f3 100644
--- a/pm/Math/GSL/Multiroots.pm.1.14
+++ b/pm/Math/GSL/Multiroots.pm.1.14
@@ -500,7 +500,7 @@ Here is a list of all the functions in this module :
@@ -3596,7 +4292,7 @@ index 5d7fcd9..ae5bc2b 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Multiroots.pm.1.15 b/pm/Math/GSL/Multiroots.pm.1.15
-index 5d7fcd9..ae5bc2b 100644
+index f172322..2fe07f3 100644
--- a/pm/Math/GSL/Multiroots.pm.1.15
+++ b/pm/Math/GSL/Multiroots.pm.1.15
@@ -500,7 +500,7 @@ Here is a list of all the functions in this module :
@@ -3609,7 +4305,7 @@ index 5d7fcd9..ae5bc2b 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Multiroots.pm.1.16 b/pm/Math/GSL/Multiroots.pm.1.16
-index 5d7fcd9..ae5bc2b 100644
+index f172322..2fe07f3 100644
--- a/pm/Math/GSL/Multiroots.pm.1.16
+++ b/pm/Math/GSL/Multiroots.pm.1.16
@@ -500,7 +500,7 @@ Here is a list of all the functions in this module :
@@ -3622,7 +4318,7 @@ index 5d7fcd9..ae5bc2b 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/NTuple.pm.1.11 b/pm/Math/GSL/NTuple.pm.1.11
-index 78965ab..cb68618 100644
+index dc8e0e5..55be67e 100644
--- a/pm/Math/GSL/NTuple.pm.1.11
+++ b/pm/Math/GSL/NTuple.pm.1.11
@@ -407,7 +407,7 @@ memory.
@@ -3635,7 +4331,7 @@ index 78965ab..cb68618 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/NTuple.pm.1.12 b/pm/Math/GSL/NTuple.pm.1.12
-index 78965ab..cb68618 100644
+index dc8e0e5..55be67e 100644
--- a/pm/Math/GSL/NTuple.pm.1.12
+++ b/pm/Math/GSL/NTuple.pm.1.12
@@ -407,7 +407,7 @@ memory.
@@ -3648,7 +4344,7 @@ index 78965ab..cb68618 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/NTuple.pm.1.13 b/pm/Math/GSL/NTuple.pm.1.13
-index 78965ab..cb68618 100644
+index dc8e0e5..55be67e 100644
--- a/pm/Math/GSL/NTuple.pm.1.13
+++ b/pm/Math/GSL/NTuple.pm.1.13
@@ -407,7 +407,7 @@ memory.
@@ -3661,7 +4357,7 @@ index 78965ab..cb68618 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/NTuple.pm.1.14 b/pm/Math/GSL/NTuple.pm.1.14
-index 78965ab..cb68618 100644
+index dc8e0e5..55be67e 100644
--- a/pm/Math/GSL/NTuple.pm.1.14
+++ b/pm/Math/GSL/NTuple.pm.1.14
@@ -407,7 +407,7 @@ memory.
@@ -3674,7 +4370,7 @@ index 78965ab..cb68618 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/NTuple.pm.1.15 b/pm/Math/GSL/NTuple.pm.1.15
-index 78965ab..cb68618 100644
+index dc8e0e5..55be67e 100644
--- a/pm/Math/GSL/NTuple.pm.1.15
+++ b/pm/Math/GSL/NTuple.pm.1.15
@@ -407,7 +407,7 @@ memory.
@@ -3687,7 +4383,7 @@ index 78965ab..cb68618 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/NTuple.pm.1.16 b/pm/Math/GSL/NTuple.pm.1.16
-index 78965ab..cb68618 100644
+index dc8e0e5..55be67e 100644
--- a/pm/Math/GSL/NTuple.pm.1.16
+++ b/pm/Math/GSL/NTuple.pm.1.16
@@ -407,7 +407,7 @@ memory.
@@ -3700,7 +4396,7 @@ index 78965ab..cb68618 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/ODEIV.pm.1.11 b/pm/Math/GSL/ODEIV.pm.1.11
-index d418899..c140fb5 100644
+index 10ec745..edcbfbd 100644
--- a/pm/Math/GSL/ODEIV.pm.1.11
+++ b/pm/Math/GSL/ODEIV.pm.1.11
@@ -554,7 +554,7 @@ This module also includes the following constants :
@@ -3713,7 +4409,7 @@ index d418899..c140fb5 100644
diff --git a/pm/Math/GSL/ODEIV.pm.1.12 b/pm/Math/GSL/ODEIV.pm.1.12
-index d418899..c140fb5 100644
+index 10ec745..edcbfbd 100644
--- a/pm/Math/GSL/ODEIV.pm.1.12
+++ b/pm/Math/GSL/ODEIV.pm.1.12
@@ -554,7 +554,7 @@ This module also includes the following constants :
@@ -3726,7 +4422,7 @@ index d418899..c140fb5 100644
diff --git a/pm/Math/GSL/ODEIV.pm.1.13 b/pm/Math/GSL/ODEIV.pm.1.13
-index d418899..c140fb5 100644
+index 10ec745..edcbfbd 100644
--- a/pm/Math/GSL/ODEIV.pm.1.13
+++ b/pm/Math/GSL/ODEIV.pm.1.13
@@ -554,7 +554,7 @@ This module also includes the following constants :
@@ -3739,7 +4435,7 @@ index d418899..c140fb5 100644
diff --git a/pm/Math/GSL/ODEIV.pm.1.14 b/pm/Math/GSL/ODEIV.pm.1.14
-index d418899..c140fb5 100644
+index 10ec745..edcbfbd 100644
--- a/pm/Math/GSL/ODEIV.pm.1.14
+++ b/pm/Math/GSL/ODEIV.pm.1.14
@@ -554,7 +554,7 @@ This module also includes the following constants :
@@ -3752,7 +4448,7 @@ index d418899..c140fb5 100644
diff --git a/pm/Math/GSL/ODEIV.pm.1.15 b/pm/Math/GSL/ODEIV.pm.1.15
-index d418899..c140fb5 100644
+index 10ec745..edcbfbd 100644
--- a/pm/Math/GSL/ODEIV.pm.1.15
+++ b/pm/Math/GSL/ODEIV.pm.1.15
@@ -554,7 +554,7 @@ This module also includes the following constants :
@@ -3765,7 +4461,7 @@ index d418899..c140fb5 100644
diff --git a/pm/Math/GSL/ODEIV.pm.1.16 b/pm/Math/GSL/ODEIV.pm.1.16
-index d418899..c140fb5 100644
+index 10ec745..edcbfbd 100644
--- a/pm/Math/GSL/ODEIV.pm.1.16
+++ b/pm/Math/GSL/ODEIV.pm.1.16
@@ -554,7 +554,7 @@ This module also includes the following constants :
@@ -3778,7 +4474,7 @@ index d418899..c140fb5 100644
diff --git a/pm/Math/GSL/Permutation.pm.1.11 b/pm/Math/GSL/Permutation.pm.1.11
-index c83b255..eede16c 100644
+index 5f71f96..9e8010b 100644
--- a/pm/Math/GSL/Permutation.pm.1.11
+++ b/pm/Math/GSL/Permutation.pm.1.11
@@ -205,7 +205,7 @@ Math::GSL::Permutation - functions for creating and manipulating permutations
@@ -3836,7 +4532,7 @@ index c83b255..eede16c 100644
diff --git a/pm/Math/GSL/Permutation.pm.1.12 b/pm/Math/GSL/Permutation.pm.1.12
-index c83b255..eede16c 100644
+index 5f71f96..9e8010b 100644
--- a/pm/Math/GSL/Permutation.pm.1.12
+++ b/pm/Math/GSL/Permutation.pm.1.12
@@ -205,7 +205,7 @@ Math::GSL::Permutation - functions for creating and manipulating permutations
@@ -3894,7 +4590,7 @@ index c83b255..eede16c 100644
diff --git a/pm/Math/GSL/Permutation.pm.1.13 b/pm/Math/GSL/Permutation.pm.1.13
-index c83b255..eede16c 100644
+index 5f71f96..9e8010b 100644
--- a/pm/Math/GSL/Permutation.pm.1.13
+++ b/pm/Math/GSL/Permutation.pm.1.13
@@ -205,7 +205,7 @@ Math::GSL::Permutation - functions for creating and manipulating permutations
@@ -3952,7 +4648,7 @@ index c83b255..eede16c 100644
diff --git a/pm/Math/GSL/Permutation.pm.1.14 b/pm/Math/GSL/Permutation.pm.1.14
-index c83b255..eede16c 100644
+index 5f71f96..9e8010b 100644
--- a/pm/Math/GSL/Permutation.pm.1.14
+++ b/pm/Math/GSL/Permutation.pm.1.14
@@ -205,7 +205,7 @@ Math::GSL::Permutation - functions for creating and manipulating permutations
@@ -4010,7 +4706,7 @@ index c83b255..eede16c 100644
diff --git a/pm/Math/GSL/Permutation.pm.1.15 b/pm/Math/GSL/Permutation.pm.1.15
-index c83b255..eede16c 100644
+index 5f71f96..9e8010b 100644
--- a/pm/Math/GSL/Permutation.pm.1.15
+++ b/pm/Math/GSL/Permutation.pm.1.15
@@ -205,7 +205,7 @@ Math::GSL::Permutation - functions for creating and manipulating permutations
@@ -4068,7 +4764,7 @@ index c83b255..eede16c 100644
diff --git a/pm/Math/GSL/Permutation.pm.1.16 b/pm/Math/GSL/Permutation.pm.1.16
-index c83b255..eede16c 100644
+index 5f71f96..9e8010b 100644
--- a/pm/Math/GSL/Permutation.pm.1.16
+++ b/pm/Math/GSL/Permutation.pm.1.16
@@ -205,7 +205,7 @@ Math::GSL::Permutation - functions for creating and manipulating permutations
@@ -4126,7 +4822,7 @@ index c83b255..eede16c 100644
diff --git a/pm/Math/GSL/Poly.pm.1.11 b/pm/Math/GSL/Poly.pm.1.11
-index 1bdffb2..2aa4dad 100644
+index b20b782..9a998bf 100644
--- a/pm/Math/GSL/Poly.pm.1.11
+++ b/pm/Math/GSL/Poly.pm.1.11
@@ -385,7 +385,7 @@ This function frees all the memory associated with the workspace $w.
@@ -4139,7 +4835,7 @@ index 1bdffb2..2aa4dad 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Poly.pm.1.12 b/pm/Math/GSL/Poly.pm.1.12
-index 1bdffb2..2aa4dad 100644
+index b20b782..9a998bf 100644
--- a/pm/Math/GSL/Poly.pm.1.12
+++ b/pm/Math/GSL/Poly.pm.1.12
@@ -385,7 +385,7 @@ This function frees all the memory associated with the workspace $w.
@@ -4152,7 +4848,7 @@ index 1bdffb2..2aa4dad 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Poly.pm.1.13 b/pm/Math/GSL/Poly.pm.1.13
-index ed08042..994d82b 100644
+index 1aa30ac..c71bbec 100644
--- a/pm/Math/GSL/Poly.pm.1.13
+++ b/pm/Math/GSL/Poly.pm.1.13
@@ -386,7 +386,7 @@ This function frees all the memory associated with the workspace $w.
@@ -4165,7 +4861,7 @@ index ed08042..994d82b 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Poly.pm.1.14 b/pm/Math/GSL/Poly.pm.1.14
-index ed08042..994d82b 100644
+index 1aa30ac..c71bbec 100644
--- a/pm/Math/GSL/Poly.pm.1.14
+++ b/pm/Math/GSL/Poly.pm.1.14
@@ -386,7 +386,7 @@ This function frees all the memory associated with the workspace $w.
@@ -4178,7 +4874,7 @@ index ed08042..994d82b 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Poly.pm.1.15 b/pm/Math/GSL/Poly.pm.1.15
-index ed08042..994d82b 100644
+index 1aa30ac..c71bbec 100644
--- a/pm/Math/GSL/Poly.pm.1.15
+++ b/pm/Math/GSL/Poly.pm.1.15
@@ -386,7 +386,7 @@ This function frees all the memory associated with the workspace $w.
@@ -4191,7 +4887,7 @@ index ed08042..994d82b 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Poly.pm.1.16 b/pm/Math/GSL/Poly.pm.1.16
-index 047bd2f..c687663 100644
+index f3d9d07..5c17c45 100644
--- a/pm/Math/GSL/Poly.pm.1.16
+++ b/pm/Math/GSL/Poly.pm.1.16
@@ -387,7 +387,7 @@ This function frees all the memory associated with the workspace $w.
@@ -4204,7 +4900,7 @@ index 047bd2f..c687663 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/QRNG.pm.1.11 b/pm/Math/GSL/QRNG.pm.1.11
-index e274589..1144570 100644
+index 69cc7db..f636132 100644
--- a/pm/Math/GSL/QRNG.pm.1.11
+++ b/pm/Math/GSL/QRNG.pm.1.11
@@ -349,7 +349,7 @@ This module also contains the following constants :
@@ -4217,7 +4913,7 @@ index e274589..1144570 100644
diff --git a/pm/Math/GSL/QRNG.pm.1.12 b/pm/Math/GSL/QRNG.pm.1.12
-index e274589..1144570 100644
+index 69cc7db..f636132 100644
--- a/pm/Math/GSL/QRNG.pm.1.12
+++ b/pm/Math/GSL/QRNG.pm.1.12
@@ -349,7 +349,7 @@ This module also contains the following constants :
@@ -4230,7 +4926,7 @@ index e274589..1144570 100644
diff --git a/pm/Math/GSL/QRNG.pm.1.13 b/pm/Math/GSL/QRNG.pm.1.13
-index e274589..1144570 100644
+index 69cc7db..f636132 100644
--- a/pm/Math/GSL/QRNG.pm.1.13
+++ b/pm/Math/GSL/QRNG.pm.1.13
@@ -349,7 +349,7 @@ This module also contains the following constants :
@@ -4243,7 +4939,7 @@ index e274589..1144570 100644
diff --git a/pm/Math/GSL/QRNG.pm.1.14 b/pm/Math/GSL/QRNG.pm.1.14
-index e274589..1144570 100644
+index 69cc7db..f636132 100644
--- a/pm/Math/GSL/QRNG.pm.1.14
+++ b/pm/Math/GSL/QRNG.pm.1.14
@@ -349,7 +349,7 @@ This module also contains the following constants :
@@ -4256,7 +4952,7 @@ index e274589..1144570 100644
diff --git a/pm/Math/GSL/QRNG.pm.1.15 b/pm/Math/GSL/QRNG.pm.1.15
-index e274589..1144570 100644
+index 69cc7db..f636132 100644
--- a/pm/Math/GSL/QRNG.pm.1.15
+++ b/pm/Math/GSL/QRNG.pm.1.15
@@ -349,7 +349,7 @@ This module also contains the following constants :
@@ -4269,7 +4965,7 @@ index e274589..1144570 100644
diff --git a/pm/Math/GSL/QRNG.pm.1.16 b/pm/Math/GSL/QRNG.pm.1.16
-index e274589..1144570 100644
+index 69cc7db..f636132 100644
--- a/pm/Math/GSL/QRNG.pm.1.16
+++ b/pm/Math/GSL/QRNG.pm.1.16
@@ -349,7 +349,7 @@ This module also contains the following constants :
@@ -4282,7 +4978,7 @@ index e274589..1144570 100644
diff --git a/pm/Math/GSL/RNG.pm.1.11 b/pm/Math/GSL/RNG.pm.1.11
-index ad41366..e379197 100644
+index 6bcd38b..5fc1964 100644
--- a/pm/Math/GSL/RNG.pm.1.11
+++ b/pm/Math/GSL/RNG.pm.1.11
@@ -886,7 +886,7 @@ __END__
@@ -4295,7 +4991,7 @@ index ad41366..e379197 100644
L<http://www.gnu.org/software/gsl/manual/html_node/>
diff --git a/pm/Math/GSL/RNG.pm.1.12 b/pm/Math/GSL/RNG.pm.1.12
-index ad41366..e379197 100644
+index 6bcd38b..5fc1964 100644
--- a/pm/Math/GSL/RNG.pm.1.12
+++ b/pm/Math/GSL/RNG.pm.1.12
@@ -886,7 +886,7 @@ __END__
@@ -4308,7 +5004,7 @@ index ad41366..e379197 100644
L<http://www.gnu.org/software/gsl/manual/html_node/>
diff --git a/pm/Math/GSL/RNG.pm.1.13 b/pm/Math/GSL/RNG.pm.1.13
-index ad41366..e379197 100644
+index 6bcd38b..5fc1964 100644
--- a/pm/Math/GSL/RNG.pm.1.13
+++ b/pm/Math/GSL/RNG.pm.1.13
@@ -886,7 +886,7 @@ __END__
@@ -4321,7 +5017,7 @@ index ad41366..e379197 100644
L<http://www.gnu.org/software/gsl/manual/html_node/>
diff --git a/pm/Math/GSL/RNG.pm.1.14 b/pm/Math/GSL/RNG.pm.1.14
-index ad41366..e379197 100644
+index 6bcd38b..5fc1964 100644
--- a/pm/Math/GSL/RNG.pm.1.14
+++ b/pm/Math/GSL/RNG.pm.1.14
@@ -886,7 +886,7 @@ __END__
@@ -4334,7 +5030,7 @@ index ad41366..e379197 100644
L<http://www.gnu.org/software/gsl/manual/html_node/>
diff --git a/pm/Math/GSL/RNG.pm.1.15 b/pm/Math/GSL/RNG.pm.1.15
-index ad41366..e379197 100644
+index 6bcd38b..5fc1964 100644
--- a/pm/Math/GSL/RNG.pm.1.15
+++ b/pm/Math/GSL/RNG.pm.1.15
@@ -886,7 +886,7 @@ __END__
@@ -4347,7 +5043,7 @@ index ad41366..e379197 100644
L<http://www.gnu.org/software/gsl/manual/html_node/>
diff --git a/pm/Math/GSL/RNG.pm.1.16 b/pm/Math/GSL/RNG.pm.1.16
-index ad41366..e379197 100644
+index 6bcd38b..5fc1964 100644
--- a/pm/Math/GSL/RNG.pm.1.16
+++ b/pm/Math/GSL/RNG.pm.1.16
@@ -886,7 +886,7 @@ __END__
@@ -4360,7 +5056,7 @@ index ad41366..e379197 100644
L<http://www.gnu.org/software/gsl/manual/html_node/>
diff --git a/pm/Math/GSL/Randist.pm.1.11 b/pm/Math/GSL/Randist.pm.1.11
-index 6aebd10..2b9eeed 100644
+index b97a8f4..522acdc 100644
--- a/pm/Math/GSL/Randist.pm.1.11
+++ b/pm/Math/GSL/Randist.pm.1.11
@@ -1035,7 +1035,7 @@ De-allocates the gsl_ran_discrete pointed to by g.
@@ -4373,7 +5069,7 @@ index 6aebd10..2b9eeed 100644
diff --git a/pm/Math/GSL/Randist.pm.1.12 b/pm/Math/GSL/Randist.pm.1.12
-index 6aebd10..2b9eeed 100644
+index b97a8f4..522acdc 100644
--- a/pm/Math/GSL/Randist.pm.1.12
+++ b/pm/Math/GSL/Randist.pm.1.12
@@ -1035,7 +1035,7 @@ De-allocates the gsl_ran_discrete pointed to by g.
@@ -4386,7 +5082,7 @@ index 6aebd10..2b9eeed 100644
diff --git a/pm/Math/GSL/Randist.pm.1.13 b/pm/Math/GSL/Randist.pm.1.13
-index 6aebd10..2b9eeed 100644
+index b97a8f4..522acdc 100644
--- a/pm/Math/GSL/Randist.pm.1.13
+++ b/pm/Math/GSL/Randist.pm.1.13
@@ -1035,7 +1035,7 @@ De-allocates the gsl_ran_discrete pointed to by g.
@@ -4399,7 +5095,7 @@ index 6aebd10..2b9eeed 100644
diff --git a/pm/Math/GSL/Randist.pm.1.14 b/pm/Math/GSL/Randist.pm.1.14
-index 6aebd10..2b9eeed 100644
+index b97a8f4..522acdc 100644
--- a/pm/Math/GSL/Randist.pm.1.14
+++ b/pm/Math/GSL/Randist.pm.1.14
@@ -1035,7 +1035,7 @@ De-allocates the gsl_ran_discrete pointed to by g.
@@ -4412,7 +5108,7 @@ index 6aebd10..2b9eeed 100644
diff --git a/pm/Math/GSL/Randist.pm.1.15 b/pm/Math/GSL/Randist.pm.1.15
-index 6aebd10..2b9eeed 100644
+index b97a8f4..522acdc 100644
--- a/pm/Math/GSL/Randist.pm.1.15
+++ b/pm/Math/GSL/Randist.pm.1.15
@@ -1035,7 +1035,7 @@ De-allocates the gsl_ran_discrete pointed to by g.
@@ -4425,7 +5121,7 @@ index 6aebd10..2b9eeed 100644
diff --git a/pm/Math/GSL/Randist.pm.1.16 b/pm/Math/GSL/Randist.pm.1.16
-index 6aebd10..2b9eeed 100644
+index b97a8f4..522acdc 100644
--- a/pm/Math/GSL/Randist.pm.1.16
+++ b/pm/Math/GSL/Randist.pm.1.16
@@ -1035,7 +1035,7 @@ De-allocates the gsl_ran_discrete pointed to by g.
@@ -4438,10 +5134,19 @@ index 6aebd10..2b9eeed 100644
diff --git a/pm/Math/GSL/SF.pm.1.11 b/pm/Math/GSL/SF.pm.1.11
-index 8258713..b2b619e 100644
+index 6859d17..2df74f1 100644
--- a/pm/Math/GSL/SF.pm.1.11
+++ b/pm/Math/GSL/SF.pm.1.11
-@@ -3841,7 +3841,7 @@ This module also contains the following constants used as mode in various of tho
+@@ -2355,7 +2355,7 @@ These functions compute the incomplete elliptic integral D(\phi,k) which is defi
+
+ =over
+
+-=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
++=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
+
+ =item C<gsl_sf_erfc_e($x, $result)>
+
+@@ -3883,7 +3883,7 @@ This module also contains the following constants used as mode in various of tho
=back
@@ -4451,10 +5156,19 @@ index 8258713..b2b619e 100644
diff --git a/pm/Math/GSL/SF.pm.1.12 b/pm/Math/GSL/SF.pm.1.12
-index 0ea978a..8bc5cb3 100644
+index db604a0..600fedd 100644
--- a/pm/Math/GSL/SF.pm.1.12
+++ b/pm/Math/GSL/SF.pm.1.12
-@@ -3842,7 +3842,7 @@ This module also contains the following constants used as mode in various of tho
+@@ -2356,7 +2356,7 @@ These functions compute the incomplete elliptic integral D(\phi,k) which is defi
+
+ =over
+
+-=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
++=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
+
+ =item C<gsl_sf_erfc_e($x, $result)>
+
+@@ -3884,7 +3884,7 @@ This module also contains the following constants used as mode in various of tho
=back
@@ -4464,10 +5178,19 @@ index 0ea978a..8bc5cb3 100644
diff --git a/pm/Math/GSL/SF.pm.1.13 b/pm/Math/GSL/SF.pm.1.13
-index 0ea978a..8bc5cb3 100644
+index db604a0..600fedd 100644
--- a/pm/Math/GSL/SF.pm.1.13
+++ b/pm/Math/GSL/SF.pm.1.13
-@@ -3842,7 +3842,7 @@ This module also contains the following constants used as mode in various of tho
+@@ -2356,7 +2356,7 @@ These functions compute the incomplete elliptic integral D(\phi,k) which is defi
+
+ =over
+
+-=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
++=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
+
+ =item C<gsl_sf_erfc_e($x, $result)>
+
+@@ -3884,7 +3884,7 @@ This module also contains the following constants used as mode in various of tho
=back
@@ -4477,10 +5200,19 @@ index 0ea978a..8bc5cb3 100644
diff --git a/pm/Math/GSL/SF.pm.1.14 b/pm/Math/GSL/SF.pm.1.14
-index 0ea978a..8bc5cb3 100644
+index db604a0..600fedd 100644
--- a/pm/Math/GSL/SF.pm.1.14
+++ b/pm/Math/GSL/SF.pm.1.14
-@@ -3842,7 +3842,7 @@ This module also contains the following constants used as mode in various of tho
+@@ -2356,7 +2356,7 @@ These functions compute the incomplete elliptic integral D(\phi,k) which is defi
+
+ =over
+
+-=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
++=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
+
+ =item C<gsl_sf_erfc_e($x, $result)>
+
+@@ -3884,7 +3884,7 @@ This module also contains the following constants used as mode in various of tho
=back
@@ -4490,10 +5222,19 @@ index 0ea978a..8bc5cb3 100644
diff --git a/pm/Math/GSL/SF.pm.1.15 b/pm/Math/GSL/SF.pm.1.15
-index 480d7c8..6585bdf 100644
+index 0441f70..0ba8a98 100644
--- a/pm/Math/GSL/SF.pm.1.15
+++ b/pm/Math/GSL/SF.pm.1.15
-@@ -3843,7 +3843,7 @@ This module also contains the following constants used as mode in various of tho
+@@ -2357,7 +2357,7 @@ These functions compute the incomplete elliptic integral D(\phi,k) which is defi
+
+ =over
+
+-=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
++=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
+
+ =item C<gsl_sf_erfc_e($x, $result)>
+
+@@ -3885,7 +3885,7 @@ This module also contains the following constants used as mode in various of tho
=back
@@ -4503,10 +5244,19 @@ index 480d7c8..6585bdf 100644
diff --git a/pm/Math/GSL/SF.pm.1.16 b/pm/Math/GSL/SF.pm.1.16
-index 480d7c8..6585bdf 100644
+index 0441f70..0ba8a98 100644
--- a/pm/Math/GSL/SF.pm.1.16
+++ b/pm/Math/GSL/SF.pm.1.16
-@@ -3843,7 +3843,7 @@ This module also contains the following constants used as mode in various of tho
+@@ -2357,7 +2357,7 @@ These functions compute the incomplete elliptic integral D(\phi,k) which is defi
+
+ =over
+
+-=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
++=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
+
+ =item C<gsl_sf_erfc_e($x, $result)>
+
+@@ -3885,7 +3885,7 @@ This module also contains the following constants used as mode in various of tho
=back
@@ -4516,7 +5266,7 @@ index 480d7c8..6585bdf 100644
diff --git a/pm/Math/GSL/Siman.pm.1.11 b/pm/Math/GSL/Siman.pm.1.11
-index 03e0f88..55e3e20 100644
+index 5e4dc1c..4dffca0 100644
--- a/pm/Math/GSL/Siman.pm.1.11
+++ b/pm/Math/GSL/Siman.pm.1.11
@@ -145,7 +145,7 @@ Here is a list of all the functions in this module :
@@ -4529,7 +5279,7 @@ index 03e0f88..55e3e20 100644
diff --git a/pm/Math/GSL/Siman.pm.1.12 b/pm/Math/GSL/Siman.pm.1.12
-index 03e0f88..55e3e20 100644
+index 5e4dc1c..4dffca0 100644
--- a/pm/Math/GSL/Siman.pm.1.12
+++ b/pm/Math/GSL/Siman.pm.1.12
@@ -145,7 +145,7 @@ Here is a list of all the functions in this module :
@@ -4542,7 +5292,7 @@ index 03e0f88..55e3e20 100644
diff --git a/pm/Math/GSL/Siman.pm.1.13 b/pm/Math/GSL/Siman.pm.1.13
-index 03e0f88..55e3e20 100644
+index 5e4dc1c..4dffca0 100644
--- a/pm/Math/GSL/Siman.pm.1.13
+++ b/pm/Math/GSL/Siman.pm.1.13
@@ -145,7 +145,7 @@ Here is a list of all the functions in this module :
@@ -4555,7 +5305,7 @@ index 03e0f88..55e3e20 100644
diff --git a/pm/Math/GSL/Siman.pm.1.14 b/pm/Math/GSL/Siman.pm.1.14
-index 03e0f88..55e3e20 100644
+index 5e4dc1c..4dffca0 100644
--- a/pm/Math/GSL/Siman.pm.1.14
+++ b/pm/Math/GSL/Siman.pm.1.14
@@ -145,7 +145,7 @@ Here is a list of all the functions in this module :
@@ -4568,7 +5318,7 @@ index 03e0f88..55e3e20 100644
diff --git a/pm/Math/GSL/Siman.pm.1.15 b/pm/Math/GSL/Siman.pm.1.15
-index 03e0f88..55e3e20 100644
+index 5e4dc1c..4dffca0 100644
--- a/pm/Math/GSL/Siman.pm.1.15
+++ b/pm/Math/GSL/Siman.pm.1.15
@@ -145,7 +145,7 @@ Here is a list of all the functions in this module :
@@ -4581,7 +5331,7 @@ index 03e0f88..55e3e20 100644
diff --git a/pm/Math/GSL/Siman.pm.1.16 b/pm/Math/GSL/Siman.pm.1.16
-index 03e0f88..55e3e20 100644
+index 5e4dc1c..4dffca0 100644
--- a/pm/Math/GSL/Siman.pm.1.16
+++ b/pm/Math/GSL/Siman.pm.1.16
@@ -145,7 +145,7 @@ Here is a list of all the functions in this module :
@@ -4594,7 +5344,7 @@ index 03e0f88..55e3e20 100644
diff --git a/pm/Math/GSL/Sort.pm.1.11 b/pm/Math/GSL/Sort.pm.1.11
-index 83ff39b..43298d6 100644
+index 347942c..8a540f1 100644
--- a/pm/Math/GSL/Sort.pm.1.11
+++ b/pm/Math/GSL/Sort.pm.1.11
@@ -285,7 +285,7 @@ should be removed in further versions.
@@ -4607,7 +5357,7 @@ index 83ff39b..43298d6 100644
=head1 PERFORMANCE
diff --git a/pm/Math/GSL/Sort.pm.1.12 b/pm/Math/GSL/Sort.pm.1.12
-index 83ff39b..43298d6 100644
+index 347942c..8a540f1 100644
--- a/pm/Math/GSL/Sort.pm.1.12
+++ b/pm/Math/GSL/Sort.pm.1.12
@@ -285,7 +285,7 @@ should be removed in further versions.
@@ -4620,7 +5370,7 @@ index 83ff39b..43298d6 100644
=head1 PERFORMANCE
diff --git a/pm/Math/GSL/Sort.pm.1.13 b/pm/Math/GSL/Sort.pm.1.13
-index 83ff39b..43298d6 100644
+index 347942c..8a540f1 100644
--- a/pm/Math/GSL/Sort.pm.1.13
+++ b/pm/Math/GSL/Sort.pm.1.13
@@ -285,7 +285,7 @@ should be removed in further versions.
@@ -4633,7 +5383,7 @@ index 83ff39b..43298d6 100644
=head1 PERFORMANCE
diff --git a/pm/Math/GSL/Sort.pm.1.14 b/pm/Math/GSL/Sort.pm.1.14
-index 83ff39b..43298d6 100644
+index 347942c..8a540f1 100644
--- a/pm/Math/GSL/Sort.pm.1.14
+++ b/pm/Math/GSL/Sort.pm.1.14
@@ -285,7 +285,7 @@ should be removed in further versions.
@@ -4646,7 +5396,7 @@ index 83ff39b..43298d6 100644
=head1 PERFORMANCE
diff --git a/pm/Math/GSL/Sort.pm.1.15 b/pm/Math/GSL/Sort.pm.1.15
-index 83ff39b..43298d6 100644
+index 347942c..8a540f1 100644
--- a/pm/Math/GSL/Sort.pm.1.15
+++ b/pm/Math/GSL/Sort.pm.1.15
@@ -285,7 +285,7 @@ should be removed in further versions.
@@ -4659,7 +5409,7 @@ index 83ff39b..43298d6 100644
=head1 PERFORMANCE
diff --git a/pm/Math/GSL/Sort.pm.1.16 b/pm/Math/GSL/Sort.pm.1.16
-index 133e990..dde1b56 100644
+index a1c9564..8dcebda 100644
--- a/pm/Math/GSL/Sort.pm.1.16
+++ b/pm/Math/GSL/Sort.pm.1.16
@@ -286,7 +286,7 @@ should be removed in further versions.
@@ -4672,7 +5422,7 @@ index 133e990..dde1b56 100644
=head1 PERFORMANCE
diff --git a/pm/Math/GSL/Spline.pm.1.11 b/pm/Math/GSL/Spline.pm.1.11
-index c3cddca..6216526 100644
+index 7915b03..44de917 100644
--- a/pm/Math/GSL/Spline.pm.1.11
+++ b/pm/Math/GSL/Spline.pm.1.11
@@ -184,7 +184,7 @@ ya as arguments on each evaluation.
@@ -4685,7 +5435,7 @@ index c3cddca..6216526 100644
diff --git a/pm/Math/GSL/Spline.pm.1.12 b/pm/Math/GSL/Spline.pm.1.12
-index c3cddca..6216526 100644
+index 7915b03..44de917 100644
--- a/pm/Math/GSL/Spline.pm.1.12
+++ b/pm/Math/GSL/Spline.pm.1.12
@@ -184,7 +184,7 @@ ya as arguments on each evaluation.
@@ -4698,7 +5448,7 @@ index c3cddca..6216526 100644
diff --git a/pm/Math/GSL/Spline.pm.1.13 b/pm/Math/GSL/Spline.pm.1.13
-index c3cddca..6216526 100644
+index 7915b03..44de917 100644
--- a/pm/Math/GSL/Spline.pm.1.13
+++ b/pm/Math/GSL/Spline.pm.1.13
@@ -184,7 +184,7 @@ ya as arguments on each evaluation.
@@ -4711,7 +5461,7 @@ index c3cddca..6216526 100644
diff --git a/pm/Math/GSL/Spline.pm.1.14 b/pm/Math/GSL/Spline.pm.1.14
-index c3cddca..6216526 100644
+index 7915b03..44de917 100644
--- a/pm/Math/GSL/Spline.pm.1.14
+++ b/pm/Math/GSL/Spline.pm.1.14
@@ -184,7 +184,7 @@ ya as arguments on each evaluation.
@@ -4724,7 +5474,7 @@ index c3cddca..6216526 100644
diff --git a/pm/Math/GSL/Spline.pm.1.15 b/pm/Math/GSL/Spline.pm.1.15
-index c3cddca..6216526 100644
+index 7915b03..44de917 100644
--- a/pm/Math/GSL/Spline.pm.1.15
+++ b/pm/Math/GSL/Spline.pm.1.15
@@ -184,7 +184,7 @@ ya as arguments on each evaluation.
@@ -4737,7 +5487,7 @@ index c3cddca..6216526 100644
diff --git a/pm/Math/GSL/Spline.pm.1.16 b/pm/Math/GSL/Spline.pm.1.16
-index c3cddca..6216526 100644
+index 7915b03..44de917 100644
--- a/pm/Math/GSL/Spline.pm.1.16
+++ b/pm/Math/GSL/Spline.pm.1.16
@@ -184,7 +184,7 @@ ya as arguments on each evaluation.
@@ -4750,7 +5500,7 @@ index c3cddca..6216526 100644
diff --git a/pm/Math/GSL/Statistics.pm.1.11 b/pm/Math/GSL/Statistics.pm.1.11
-index 088dcf0..369962e 100644
+index df4f66e..80b0d96 100644
--- a/pm/Math/GSL/Statistics.pm.1.11
+++ b/pm/Math/GSL/Statistics.pm.1.11
@@ -363,7 +363,7 @@ These functions return the total sum of squares (TSS) of data about the mean. Fo
@@ -4772,7 +5522,7 @@ index 088dcf0..369962e 100644
diff --git a/pm/Math/GSL/Statistics.pm.1.12 b/pm/Math/GSL/Statistics.pm.1.12
-index 088dcf0..369962e 100644
+index df4f66e..80b0d96 100644
--- a/pm/Math/GSL/Statistics.pm.1.12
+++ b/pm/Math/GSL/Statistics.pm.1.12
@@ -363,7 +363,7 @@ These functions return the total sum of squares (TSS) of data about the mean. Fo
@@ -4794,7 +5544,7 @@ index 088dcf0..369962e 100644
diff --git a/pm/Math/GSL/Statistics.pm.1.13 b/pm/Math/GSL/Statistics.pm.1.13
-index 088dcf0..369962e 100644
+index df4f66e..80b0d96 100644
--- a/pm/Math/GSL/Statistics.pm.1.13
+++ b/pm/Math/GSL/Statistics.pm.1.13
@@ -363,7 +363,7 @@ These functions return the total sum of squares (TSS) of data about the mean. Fo
@@ -4816,7 +5566,7 @@ index 088dcf0..369962e 100644
diff --git a/pm/Math/GSL/Statistics.pm.1.14 b/pm/Math/GSL/Statistics.pm.1.14
-index 088dcf0..369962e 100644
+index df4f66e..80b0d96 100644
--- a/pm/Math/GSL/Statistics.pm.1.14
+++ b/pm/Math/GSL/Statistics.pm.1.14
@@ -363,7 +363,7 @@ These functions return the total sum of squares (TSS) of data about the mean. Fo
@@ -4838,7 +5588,7 @@ index 088dcf0..369962e 100644
diff --git a/pm/Math/GSL/Statistics.pm.1.15 b/pm/Math/GSL/Statistics.pm.1.15
-index 088dcf0..369962e 100644
+index df4f66e..80b0d96 100644
--- a/pm/Math/GSL/Statistics.pm.1.15
+++ b/pm/Math/GSL/Statistics.pm.1.15
@@ -363,7 +363,7 @@ These functions return the total sum of squares (TSS) of data about the mean. Fo
@@ -4860,7 +5610,7 @@ index 088dcf0..369962e 100644
diff --git a/pm/Math/GSL/Statistics.pm.1.16 b/pm/Math/GSL/Statistics.pm.1.16
-index 1590fa3..f7ff739 100644
+index 5e6685b..76f1ddb 100644
--- a/pm/Math/GSL/Statistics.pm.1.16
+++ b/pm/Math/GSL/Statistics.pm.1.16
@@ -364,7 +364,7 @@ These functions return the total sum of squares (TSS) of data about the mean. Fo
@@ -4882,7 +5632,7 @@ index 1590fa3..f7ff739 100644
diff --git a/pm/Math/GSL/Sys.pm.1.11 b/pm/Math/GSL/Sys.pm.1.11
-index f2a7bc8..00a1484 100644
+index 0fdd86f..8a12e35 100644
--- a/pm/Math/GSL/Sys.pm.1.11
+++ b/pm/Math/GSL/Sys.pm.1.11
@@ -218,7 +218,7 @@ zero. The implementation is based on the package fcmp by T.C. Belding.
@@ -4895,7 +5645,7 @@ index f2a7bc8..00a1484 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Sys.pm.1.12 b/pm/Math/GSL/Sys.pm.1.12
-index f2a7bc8..00a1484 100644
+index 0fdd86f..8a12e35 100644
--- a/pm/Math/GSL/Sys.pm.1.12
+++ b/pm/Math/GSL/Sys.pm.1.12
@@ -218,7 +218,7 @@ zero. The implementation is based on the package fcmp by T.C. Belding.
@@ -4908,7 +5658,7 @@ index f2a7bc8..00a1484 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Sys.pm.1.13 b/pm/Math/GSL/Sys.pm.1.13
-index f2a7bc8..00a1484 100644
+index 0fdd86f..8a12e35 100644
--- a/pm/Math/GSL/Sys.pm.1.13
+++ b/pm/Math/GSL/Sys.pm.1.13
@@ -218,7 +218,7 @@ zero. The implementation is based on the package fcmp by T.C. Belding.
@@ -4921,7 +5671,7 @@ index f2a7bc8..00a1484 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Sys.pm.1.14 b/pm/Math/GSL/Sys.pm.1.14
-index f2a7bc8..00a1484 100644
+index 0fdd86f..8a12e35 100644
--- a/pm/Math/GSL/Sys.pm.1.14
+++ b/pm/Math/GSL/Sys.pm.1.14
@@ -218,7 +218,7 @@ zero. The implementation is based on the package fcmp by T.C. Belding.
@@ -4934,7 +5684,7 @@ index f2a7bc8..00a1484 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Sys.pm.1.15 b/pm/Math/GSL/Sys.pm.1.15
-index f2a7bc8..00a1484 100644
+index 0fdd86f..8a12e35 100644
--- a/pm/Math/GSL/Sys.pm.1.15
+++ b/pm/Math/GSL/Sys.pm.1.15
@@ -218,7 +218,7 @@ zero. The implementation is based on the package fcmp by T.C. Belding.
@@ -4947,7 +5697,7 @@ index f2a7bc8..00a1484 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Sys.pm.1.16 b/pm/Math/GSL/Sys.pm.1.16
-index f2a7bc8..00a1484 100644
+index 0fdd86f..8a12e35 100644
--- a/pm/Math/GSL/Sys.pm.1.16
+++ b/pm/Math/GSL/Sys.pm.1.16
@@ -218,7 +218,7 @@ zero. The implementation is based on the package fcmp by T.C. Belding.
@@ -4960,9 +5710,85 @@ index f2a7bc8..00a1484 100644
=head1 AUTHORS
diff --git a/pm/Math/GSL/Vector.pm.1.11 b/pm/Math/GSL/Vector.pm.1.11
-index fe52b0f..dfeb145 100644
+index b02dbad..c3513d1 100644
--- a/pm/Math/GSL/Vector.pm.1.11
+++ b/pm/Math/GSL/Vector.pm.1.11
+@@ -1223,7 +1223,7 @@ set all the elements of $v to $x
+ =item C<gsl_vector_set_basis($v, $i)>
+
+ set all the elements of $v to 0 except for the $i-th element which is set to 1
+-and return 0 if the operation succeded, 1 otherwise.
++and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_fread($file, $v)>
+
+@@ -1260,23 +1260,23 @@ success and 1 if there was a problem writing to the file.
+ =item C<gsl_vector_memcpy($dest, $src)>
+
+ This function copies the elements of the vector $src into the vector $dest and
+-return 0 if the opertaion succeded, 1 otherwise. The two vectors must have the
++return 0 if the opertaion succeeded, 1 otherwise. The two vectors must have the
+ same length.
+
+ =item C<gsl_vector_reverse($v)>
+
+ reverse the order of the elements of the vector $v and return 0 if the
+-opertaion succeded, 1 otherwise
++opertaion succeeded, 1 otherwise
+
+ =item C<gsl_vector_swap($v, $v2)>
+
+ swap the values of the vectors $v and $v2 and return 0 if the opertaion
+-succeded, 1 otherwise
++succeeded, 1 otherwise
+
+ =item C<gsl_vector_swap_elements($v, $i, $j)>
+
+ permute the elements at position $i and $j in the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_max($v)>
+
+@@ -1307,32 +1307,32 @@ $v and the second is the position of the maximum value.
+ =item C<gsl_vector_add($v, $v2)>
+
+ add the elements of $v2 to the elements of $v, the two vectors must have the
+-same length and return 0 if the operation succeded, 1 otherwise.
++same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_sub($v, $v2)>
+
+ substract the elements of $v2 from the elements of $v, the two vectors must
+-have the same length and return 0 if the operation succeded, 1 otherwise.
++have the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_mul($v, $v2)>
+
+ multiply the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_div($v, $v2)>
+
+ divides the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_scale($v, $x)>
+
+ multiplty the elements of the vector $v by a constant $x and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_add_constant($v, $x)>
+
+ add a constant $x to the elements of the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_isnull($v)>
+
@@ -1369,7 +1369,7 @@ leaving the odd elements untouched :
=back
@@ -4973,9 +5799,85 @@ index fe52b0f..dfeb145 100644
=head1 EXAMPLES
diff --git a/pm/Math/GSL/Vector.pm.1.12 b/pm/Math/GSL/Vector.pm.1.12
-index 1af232d..7a93080 100644
+index c490438..5579c36 100644
--- a/pm/Math/GSL/Vector.pm.1.12
+++ b/pm/Math/GSL/Vector.pm.1.12
+@@ -1230,7 +1230,7 @@ set all the elements of $v to $x
+ =item C<gsl_vector_set_basis($v, $i)>
+
+ set all the elements of $v to 0 except for the $i-th element which is set to 1
+-and return 0 if the operation succeded, 1 otherwise.
++and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_fread($file, $v)>
+
+@@ -1267,23 +1267,23 @@ success and 1 if there was a problem writing to the file.
+ =item C<gsl_vector_memcpy($dest, $src)>
+
+ This function copies the elements of the vector $src into the vector $dest and
+-return 0 if the opertaion succeded, 1 otherwise. The two vectors must have the
++return 0 if the opertaion succeeded, 1 otherwise. The two vectors must have the
+ same length.
+
+ =item C<gsl_vector_reverse($v)>
+
+ reverse the order of the elements of the vector $v and return 0 if the
+-opertaion succeded, 1 otherwise
++opertaion succeeded, 1 otherwise
+
+ =item C<gsl_vector_swap($v, $v2)>
+
+ swap the values of the vectors $v and $v2 and return 0 if the opertaion
+-succeded, 1 otherwise
++succeeded, 1 otherwise
+
+ =item C<gsl_vector_swap_elements($v, $i, $j)>
+
+ permute the elements at position $i and $j in the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_max($v)>
+
+@@ -1314,32 +1314,32 @@ $v and the second is the position of the maximum value.
+ =item C<gsl_vector_add($v, $v2)>
+
+ add the elements of $v2 to the elements of $v, the two vectors must have the
+-same length and return 0 if the operation succeded, 1 otherwise.
++same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_sub($v, $v2)>
+
+ substract the elements of $v2 from the elements of $v, the two vectors must
+-have the same length and return 0 if the operation succeded, 1 otherwise.
++have the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_mul($v, $v2)>
+
+ multiply the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_div($v, $v2)>
+
+ divides the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_scale($v, $x)>
+
+ multiplty the elements of the vector $v by a constant $x and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_add_constant($v, $x)>
+
+ add a constant $x to the elements of the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_isnull($v)>
+
@@ -1376,7 +1376,7 @@ leaving the odd elements untouched :
=back
@@ -4986,9 +5888,85 @@ index 1af232d..7a93080 100644
=head1 EXAMPLES
diff --git a/pm/Math/GSL/Vector.pm.1.13 b/pm/Math/GSL/Vector.pm.1.13
-index 1af232d..7a93080 100644
+index c490438..5579c36 100644
--- a/pm/Math/GSL/Vector.pm.1.13
+++ b/pm/Math/GSL/Vector.pm.1.13
+@@ -1230,7 +1230,7 @@ set all the elements of $v to $x
+ =item C<gsl_vector_set_basis($v, $i)>
+
+ set all the elements of $v to 0 except for the $i-th element which is set to 1
+-and return 0 if the operation succeded, 1 otherwise.
++and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_fread($file, $v)>
+
+@@ -1267,23 +1267,23 @@ success and 1 if there was a problem writing to the file.
+ =item C<gsl_vector_memcpy($dest, $src)>
+
+ This function copies the elements of the vector $src into the vector $dest and
+-return 0 if the opertaion succeded, 1 otherwise. The two vectors must have the
++return 0 if the opertaion succeeded, 1 otherwise. The two vectors must have the
+ same length.
+
+ =item C<gsl_vector_reverse($v)>
+
+ reverse the order of the elements of the vector $v and return 0 if the
+-opertaion succeded, 1 otherwise
++opertaion succeeded, 1 otherwise
+
+ =item C<gsl_vector_swap($v, $v2)>
+
+ swap the values of the vectors $v and $v2 and return 0 if the opertaion
+-succeded, 1 otherwise
++succeeded, 1 otherwise
+
+ =item C<gsl_vector_swap_elements($v, $i, $j)>
+
+ permute the elements at position $i and $j in the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_max($v)>
+
+@@ -1314,32 +1314,32 @@ $v and the second is the position of the maximum value.
+ =item C<gsl_vector_add($v, $v2)>
+
+ add the elements of $v2 to the elements of $v, the two vectors must have the
+-same length and return 0 if the operation succeded, 1 otherwise.
++same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_sub($v, $v2)>
+
+ substract the elements of $v2 from the elements of $v, the two vectors must
+-have the same length and return 0 if the operation succeded, 1 otherwise.
++have the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_mul($v, $v2)>
+
+ multiply the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_div($v, $v2)>
+
+ divides the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_scale($v, $x)>
+
+ multiplty the elements of the vector $v by a constant $x and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_add_constant($v, $x)>
+
+ add a constant $x to the elements of the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_isnull($v)>
+
@@ -1376,7 +1376,7 @@ leaving the odd elements untouched :
=back
@@ -4999,9 +5977,85 @@ index 1af232d..7a93080 100644
=head1 EXAMPLES
diff --git a/pm/Math/GSL/Vector.pm.1.14 b/pm/Math/GSL/Vector.pm.1.14
-index 1af232d..7a93080 100644
+index c490438..5579c36 100644
--- a/pm/Math/GSL/Vector.pm.1.14
+++ b/pm/Math/GSL/Vector.pm.1.14
+@@ -1230,7 +1230,7 @@ set all the elements of $v to $x
+ =item C<gsl_vector_set_basis($v, $i)>
+
+ set all the elements of $v to 0 except for the $i-th element which is set to 1
+-and return 0 if the operation succeded, 1 otherwise.
++and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_fread($file, $v)>
+
+@@ -1267,23 +1267,23 @@ success and 1 if there was a problem writing to the file.
+ =item C<gsl_vector_memcpy($dest, $src)>
+
+ This function copies the elements of the vector $src into the vector $dest and
+-return 0 if the opertaion succeded, 1 otherwise. The two vectors must have the
++return 0 if the opertaion succeeded, 1 otherwise. The two vectors must have the
+ same length.
+
+ =item C<gsl_vector_reverse($v)>
+
+ reverse the order of the elements of the vector $v and return 0 if the
+-opertaion succeded, 1 otherwise
++opertaion succeeded, 1 otherwise
+
+ =item C<gsl_vector_swap($v, $v2)>
+
+ swap the values of the vectors $v and $v2 and return 0 if the opertaion
+-succeded, 1 otherwise
++succeeded, 1 otherwise
+
+ =item C<gsl_vector_swap_elements($v, $i, $j)>
+
+ permute the elements at position $i and $j in the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_max($v)>
+
+@@ -1314,32 +1314,32 @@ $v and the second is the position of the maximum value.
+ =item C<gsl_vector_add($v, $v2)>
+
+ add the elements of $v2 to the elements of $v, the two vectors must have the
+-same length and return 0 if the operation succeded, 1 otherwise.
++same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_sub($v, $v2)>
+
+ substract the elements of $v2 from the elements of $v, the two vectors must
+-have the same length and return 0 if the operation succeded, 1 otherwise.
++have the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_mul($v, $v2)>
+
+ multiply the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_div($v, $v2)>
+
+ divides the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_scale($v, $x)>
+
+ multiplty the elements of the vector $v by a constant $x and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_add_constant($v, $x)>
+
+ add a constant $x to the elements of the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_isnull($v)>
+
@@ -1376,7 +1376,7 @@ leaving the odd elements untouched :
=back
@@ -5012,9 +6066,85 @@ index 1af232d..7a93080 100644
=head1 EXAMPLES
diff --git a/pm/Math/GSL/Vector.pm.1.15 b/pm/Math/GSL/Vector.pm.1.15
-index 8f0723d..c4883c5 100644
+index b570be6..1dd9343 100644
--- a/pm/Math/GSL/Vector.pm.1.15
+++ b/pm/Math/GSL/Vector.pm.1.15
+@@ -1234,7 +1234,7 @@ set all the elements of $v to $x
+ =item C<gsl_vector_set_basis($v, $i)>
+
+ set all the elements of $v to 0 except for the $i-th element which is set to 1
+-and return 0 if the operation succeded, 1 otherwise.
++and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_fread($file, $v)>
+
+@@ -1271,23 +1271,23 @@ success and 1 if there was a problem writing to the file.
+ =item C<gsl_vector_memcpy($dest, $src)>
+
+ This function copies the elements of the vector $src into the vector $dest and
+-return 0 if the opertaion succeded, 1 otherwise. The two vectors must have the
++return 0 if the opertaion succeeded, 1 otherwise. The two vectors must have the
+ same length.
+
+ =item C<gsl_vector_reverse($v)>
+
+ reverse the order of the elements of the vector $v and return 0 if the
+-opertaion succeded, 1 otherwise
++opertaion succeeded, 1 otherwise
+
+ =item C<gsl_vector_swap($v, $v2)>
+
+ swap the values of the vectors $v and $v2 and return 0 if the opertaion
+-succeded, 1 otherwise
++succeeded, 1 otherwise
+
+ =item C<gsl_vector_swap_elements($v, $i, $j)>
+
+ permute the elements at position $i and $j in the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_max($v)>
+
+@@ -1318,32 +1318,32 @@ $v and the second is the position of the maximum value.
+ =item C<gsl_vector_add($v, $v2)>
+
+ add the elements of $v2 to the elements of $v, the two vectors must have the
+-same length and return 0 if the operation succeded, 1 otherwise.
++same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_sub($v, $v2)>
+
+ substract the elements of $v2 from the elements of $v, the two vectors must
+-have the same length and return 0 if the operation succeded, 1 otherwise.
++have the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_mul($v, $v2)>
+
+ multiply the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_div($v, $v2)>
+
+ divides the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_scale($v, $x)>
+
+ multiplty the elements of the vector $v by a constant $x and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_add_constant($v, $x)>
+
+ add a constant $x to the elements of the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_isnull($v)>
+
@@ -1380,7 +1380,7 @@ leaving the odd elements untouched :
=back
@@ -5025,9 +6155,85 @@ index 8f0723d..c4883c5 100644
=head1 EXAMPLES
diff --git a/pm/Math/GSL/Vector.pm.1.16 b/pm/Math/GSL/Vector.pm.1.16
-index 8f0723d..c4883c5 100644
+index b570be6..1dd9343 100644
--- a/pm/Math/GSL/Vector.pm.1.16
+++ b/pm/Math/GSL/Vector.pm.1.16
+@@ -1234,7 +1234,7 @@ set all the elements of $v to $x
+ =item C<gsl_vector_set_basis($v, $i)>
+
+ set all the elements of $v to 0 except for the $i-th element which is set to 1
+-and return 0 if the operation succeded, 1 otherwise.
++and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_fread($file, $v)>
+
+@@ -1271,23 +1271,23 @@ success and 1 if there was a problem writing to the file.
+ =item C<gsl_vector_memcpy($dest, $src)>
+
+ This function copies the elements of the vector $src into the vector $dest and
+-return 0 if the opertaion succeded, 1 otherwise. The two vectors must have the
++return 0 if the opertaion succeeded, 1 otherwise. The two vectors must have the
+ same length.
+
+ =item C<gsl_vector_reverse($v)>
+
+ reverse the order of the elements of the vector $v and return 0 if the
+-opertaion succeded, 1 otherwise
++opertaion succeeded, 1 otherwise
+
+ =item C<gsl_vector_swap($v, $v2)>
+
+ swap the values of the vectors $v and $v2 and return 0 if the opertaion
+-succeded, 1 otherwise
++succeeded, 1 otherwise
+
+ =item C<gsl_vector_swap_elements($v, $i, $j)>
+
+ permute the elements at position $i and $j in the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_max($v)>
+
+@@ -1318,32 +1318,32 @@ $v and the second is the position of the maximum value.
+ =item C<gsl_vector_add($v, $v2)>
+
+ add the elements of $v2 to the elements of $v, the two vectors must have the
+-same length and return 0 if the operation succeded, 1 otherwise.
++same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_sub($v, $v2)>
+
+ substract the elements of $v2 from the elements of $v, the two vectors must
+-have the same length and return 0 if the operation succeded, 1 otherwise.
++have the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_mul($v, $v2)>
+
+ multiply the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_div($v, $v2)>
+
+ divides the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_scale($v, $x)>
+
+ multiplty the elements of the vector $v by a constant $x and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_add_constant($v, $x)>
+
+ add a constant $x to the elements of the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_isnull($v)>
+
@@ -1380,7 +1380,7 @@ leaving the odd elements untouched :
=back
@@ -5320,6 +6526,24 @@ index c744018..d00a6b9 100644
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
+diff --git a/pod/Histogram2D.pod b/pod/Histogram2D.pod
+index 7acdfec..00eb49f 100644
+--- a/pod/Histogram2D.pod
++++ b/pod/Histogram2D.pod
+@@ -133,11 +133,11 @@ C<gsl_histogram2d_set_ranges_uniform> or this function will return undef.
+
+ =item C<gsl_histogram2d_max_val($h)> - This function returns the maximum value contained in the histogram bins.
+
+-=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
++=item C<gsl_histogram2d_max_bin($h)> - This function finds the indices of the bin containing the maximum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same maximum value the first bin found is returned.
+
+ =item C<gsl_histogram2d_min_val($h)> - This function returns the minimum value contained in the histogram bins.
+
+-=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
++=item C<gsl_histogram2d_min_bin($h)> - This function finds the indices of the bin containing the minimum value in the histogram $h and returns the result in this order : 0 if the operation succeeded, 1 otherwise, i and j. In the case where several bins contain the same minimum value the first bin found is returned.
+
+ =item C<gsl_histogram2d_xmean($h)> - This function returns the mean of the histogrammed x variable, where the histogram is regarded as a probability distribution. Negative bin values are ignored for the purposes of this calculation.
+
diff --git a/pod/Integration.pod b/pod/Integration.pod
index 08f594f..a85c476 100644
--- a/pod/Integration.pod
@@ -5334,9 +6558,77 @@ index 08f594f..a85c476 100644
=head1 AUTHORS
diff --git a/pod/Linalg.pod b/pod/Linalg.pod
-index 92e66cc..eb02090 100644
+index 92e66cc..acb1fa4 100644
--- a/pod/Linalg.pod
+++ b/pod/Linalg.pod
+@@ -138,7 +138,7 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_complex_householder_transform
+
+-=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_householder_hm($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the left-hand side of the matrix $A. On output the result P A is stored in $A. The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_householder_mh($tau, $v, $A) - This function applies the Householder matrix P defined by the scalar $tau and the vector $v to the right-hand side of the matrix $A. On output the result A P is stored in $A.
+
+@@ -152,7 +152,7 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_complex_householder_hv($tau, $v, $w) - Does the same operation than gsl_linalg_householder_hv but with the complex value $tau and the complex vectors $v and $w.
+
+-=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
++=item gsl_linalg_hessenberg_decomp($A, $tau) - This function computes the Hessenberg decomposition of the matrix $A by applying the similarity transformation H = U^T A U. On output, H is stored in the upper portion of $A. The information required to construct the matrix U is stored in the lower triangular portion of $A. U is a product of N - 2 Householder matrices. The Householder vectors are stored in the lower portion of $A (below the subdiagonal) and the Householder coefficients are [...]
+
+ =item gsl_linalg_hessenberg_unpack($H, $tau, $U) - This function constructs the orthogonal matrix $U from the information stored in the Hessenberg matrix $H along with the vector $tau. $H and $tau are outputs from gsl_linalg_hessenberg_decomp.
+
+@@ -176,9 +176,9 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_LU_decomp($a, $p) - factorize the matrix $a into the LU decomposition PA = LU. On output the diagonal and upper triangular part of the input matrix A contain the matrix U. The lower triangular part of the input matrix (excluding the diagonal) contains L. The diagonal elements of L are unity, and are not stored. The function returns two value, the first is 0 if the operation succeeded, 1 otherwise, and the second is the sign of the permutation.
+
+-=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_solve($LU, $p, $b, $x) - This function solves the square system A x = b using the LU decomposition of the matrix A into (LU, p) given by gsl_linalg_LU_decomp. $LU is a matrix, $p a permutation and $b and $x are vectors. The function returns 1 if the operation succeeded, 0 otherwise.
+
+-=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeded, 0 otherwise.
++=item gsl_linalg_LU_svx($LU, $p, $x) - This function solves the square system A x = b in-place using the LU decomposition of A into (LU,p). On input $x should contain the right-hand side b, which is replaced by the solution on output. $LU is a matrix, $p a permutation and $x is a vector. The function returns 1 if the operation succeeded, 0 otherwise.
+
+ =item gsl_linalg_LU_refine($A, $LU, $p, $b, $x, $residual) - This function apply an iterative improvement to $x, the solution of $A $x = $b, using the LU decomposition of $A into ($LU,$p). The initial residual $r = $A $x - $b (where $x and $b are vectors) is also computed and stored in the vector $residual.
+
+@@ -212,27 +212,27 @@ Here is a list of all the functions included in this module :
+
+ =item gsl_linalg_QR_svx($QR, $tau, $x) - This function solves the square system A x = b in-place using the QR decomposition of A into the matrix $QR and the vector $tau given by gsl_linalg_QR_decomp. On input, the vector $x should contain the right-hand side b, which is replaced by the solution on output.
+
+-=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
++=item gsl_linalg_QR_lssolve($QR, $tau, $b, $x, $residual) - This function finds the least squares solution to the overdetermined system $A $x = $b where the matrix $A has more rows than columns. The least squares solution minimizes the Euclidean norm of the residual, ||Ax - b||.The routine uses the $QR decomposition of $A into ($QR, $tau) given by gsl_linalg_QR_decomp. The solution is returned in $x. The residual is computed as a by-product and stored in residual. The function returns 0 [...]
+
+-=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QRsolve($Q, $R, $b, $x) - This function solves the system $R $x = $Q**T $b for $x. It can be used when the $QR decomposition of a matrix is available in unpacked form as ($Q, $R). The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_QR_Rsolve($QR, $b, $x) - This function solves the triangular system R $x = $b for $x. It may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec.
+
+-=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Rsvx($QR, $x) - This function solves the triangular system R $x = b for $x in-place. On input $x should contain the right-hand side b and is replaced by the solution on output. This function may be useful if the product b' = Q^T b has already been computed using gsl_linalg_QR_QTvec. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_update($Q, $R, $b, $x) - This function performs a rank-1 update $w $v**T of the QR decomposition ($Q, $R). The update is given by Q'R' = Q R + w v^T where the output matrices Q' and R' are also orthogonal and right triangular. Note that w is destroyed by the update. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTvec($QR, $tau, $v) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q^T v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_Qvec($QR, $tau, $v) - This function applies the matrix Q encoded in the decomposition ($QR,$tau) to the vector $v, storing the result Q v in $v. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_QTmat($QR, $tau, $A) - This function applies the matrix Q^T encoded in the decomposition ($QR,$tau) to the matrix $A, storing the result Q^T A in $A. The matrix multiplication is carried out directly using the encoding of the Householder vectors without needing to form the full matrix Q^T. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_QR_unpack($QR, $tau, $Q, $R) - This function unpacks the encoded QR decomposition ($QR,$tau) into the matrices $Q and $R, where $Q is M-by-M and $R is M-by-N. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_solve($R, $b, $x) - This function solves the triangular system $R $x = $b for the N-by-N matrix $R. The function returns 0 if it succeeded, 1 otherwise.
+
+-=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeded, 1 otherwise.
++=item gsl_linalg_R_svx($R, $x) - This function solves the triangular system $R $x = b in-place. On input $x should contain the right-hand side b, which is replaced by the solution on output. The function returns 0 if it succeeded, 1 otherwise.
+
+ =item gsl_linalg_QRPT_decomp($A, $tau, $p, $norm) - This function factorizes the M-by-N matrix $A into the QRP^T decomposition A = Q R P^T. On output the diagonal and upper triangular part of the input matrix contain the matrix R. The permutation matrix P is stored in the permutation $p. There's two value returned by this function : the first is 0 if the operation succeeded, 1 otherwise. The second is sign of the permutation. It has the value (-1)^n, where n is the number of interchange [...]
+
@@ -345,7 +345,7 @@ Here is a list of all the functions included in this module :
You have to add the functions you want to use inside the qw /put_funtion_here / with spaces between each function. You can also write use Math::GSL::Complex qw/:all/ to use all avaible functions of the module.
@@ -5347,7 +6639,7 @@ index 92e66cc..eb02090 100644
=back
diff --git a/pod/Matrix.pod b/pod/Matrix.pod
-index 52d3ec1..16b41fc 100644
+index 1a22cd3..0036d1b 100644
--- a/pod/Matrix.pod
+++ b/pod/Matrix.pod
@@ -1234,11 +1234,11 @@ Here is a list of all the functions included in this module :
@@ -5379,16 +6671,16 @@ index 52d3ec1..16b41fc 100644
=item C<gsl_matrix_add_diagonal($a, $x)> - Add the constant value $x to the elements of the diagonal of the matrix $a
-=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_row($v, $m, $i)> - Copy the elements of the $i-th row of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
-=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_get_col($v, $m, $i)> - Copy the elements of the $j-th column of the matrix $m into the vector $v. The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
-=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the row. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_row($m, $i, $v)> - Copy the elements of vector $v into the $i-th row of the matrix $m The length of the vector must be of the same as the length of the row. The function returns 0 if it succeeded, 1 otherwise.
-=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The lenght of the vector must be of the same as the lenght of the column. The function returns 0 if it succeded, 1 otherwise.
-+=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeded, 1 otherwise.
++=item C<gsl_matrix_set_col($m, $j, $v)> - Copy the elements of vector $v into the $j-th row of the matrix $m The length of the vector must be of the same as the length of the column. The function returns 0 if it succeeded, 1 otherwise.
=back
@@ -5616,10 +6908,19 @@ index e0893e2..44b1e8d 100644
diff --git a/pod/SF.pod b/pod/SF.pod
-index f113fdc..2f9ed28 100644
+index fed7905..0cf5119 100644
--- a/pod/SF.pod
+++ b/pod/SF.pod
-@@ -3125,7 +3125,7 @@ This module also contains the following constants used as mode in various of tho
+@@ -1640,7 +1640,7 @@ These functions compute the incomplete elliptic integral D(\phi,k) which is defi
+
+ =over
+
+-=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
++=item C<gsl_sf_elljac_e($u, $m)> - This function computes the Jacobian elliptic functions sn(u|m), cn(u|m), dn(u|m) by descending Landen transformations. The function returns 0 if the operation succeeded, 1 otherwise and then returns the result of sn, cn and dn in this order.
+
+ =item C<gsl_sf_erfc_e($x, $result)>
+
+@@ -3168,7 +3168,7 @@ This module also contains the following constants used as mode in various of tho
=back
@@ -5703,9 +7004,85 @@ index 34bcd6d..10e1f76 100644
=head1 AUTHORS
diff --git a/pod/Vector.pod b/pod/Vector.pod
-index bd43832..8c38090 100644
+index bd43832..94a1f7e 100644
--- a/pod/Vector.pod
+++ b/pod/Vector.pod
+@@ -494,7 +494,7 @@ set all the elements of $v to $x
+ =item C<gsl_vector_set_basis($v, $i)>
+
+ set all the elements of $v to 0 except for the $i-th element which is set to 1
+-and return 0 if the operation succeded, 1 otherwise.
++and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_fread($file, $v)>
+
+@@ -531,23 +531,23 @@ success and 1 if there was a problem writing to the file.
+ =item C<gsl_vector_memcpy($dest, $src)>
+
+ This function copies the elements of the vector $src into the vector $dest and
+-return 0 if the opertaion succeded, 1 otherwise. The two vectors must have the
++return 0 if the opertaion succeeded, 1 otherwise. The two vectors must have the
+ same length.
+
+ =item C<gsl_vector_reverse($v)>
+
+ reverse the order of the elements of the vector $v and return 0 if the
+-opertaion succeded, 1 otherwise
++opertaion succeeded, 1 otherwise
+
+ =item C<gsl_vector_swap($v, $v2)>
+
+ swap the values of the vectors $v and $v2 and return 0 if the opertaion
+-succeded, 1 otherwise
++succeeded, 1 otherwise
+
+ =item C<gsl_vector_swap_elements($v, $i, $j)>
+
+ permute the elements at position $i and $j in the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_max($v)>
+
+@@ -578,32 +578,32 @@ $v and the second is the position of the maximum value.
+ =item C<gsl_vector_add($v, $v2)>
+
+ add the elements of $v2 to the elements of $v, the two vectors must have the
+-same length and return 0 if the operation succeded, 1 otherwise.
++same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_sub($v, $v2)>
+
+ substract the elements of $v2 from the elements of $v, the two vectors must
+-have the same length and return 0 if the operation succeded, 1 otherwise.
++have the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_mul($v, $v2)>
+
+ multiply the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_div($v, $v2)>
+
+ divides the elements of $v by the elements of $v2, the two vectors must have
+-the same length and return 0 if the operation succeded, 1 otherwise.
++the same length and return 0 if the operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_scale($v, $x)>
+
+ multiplty the elements of the vector $v by a constant $x and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_add_constant($v, $x)>
+
+ add a constant $x to the elements of the vector $v and return 0 if the
+-operation succeded, 1 otherwise.
++operation succeeded, 1 otherwise.
+
+ =item C<gsl_vector_isnull($v)>
+
@@ -640,7 +640,7 @@ leaving the odd elements untouched :
=back
--
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/pkg-perl/packages/libmath-gsl-perl.git
More information about the Pkg-perl-cvs-commits
mailing list