diff options
author | David Seifert <soap@gentoo.org> | 2017-11-25 17:49:36 +0100 |
---|---|---|
committer | David Seifert <soap@gentoo.org> | 2017-11-25 18:35:47 +0100 |
commit | 0815b76a612fb967d1c4ec5ceba322e483c7514d (patch) | |
tree | 627fb9b45371799c0a5de9d3673d6bf6e70ee2ec /sci-libs | |
parent | b884fbcf236ac15c1800192f99ec69fb40181455 (diff) | |
download | gentoo-0815b76a612fb967d1c4ec5ceba322e483c7514d.tar.gz gentoo-0815b76a612fb967d1c4ec5ceba322e483c7514d.tar.xz |
sci-libs/cminpack: [QA] Consistent whitespace in metadata.xml
Diffstat (limited to 'sci-libs')
-rw-r--r-- | sci-libs/cminpack/metadata.xml | 38 |
1 files changed, 19 insertions, 19 deletions
diff --git a/sci-libs/cminpack/metadata.xml b/sci-libs/cminpack/metadata.xml index 1e24c78f14c..c80cc08e331 100644 --- a/sci-libs/cminpack/metadata.xml +++ b/sci-libs/cminpack/metadata.xml @@ -1,23 +1,23 @@ <?xml version="1.0" encoding="UTF-8"?> <!DOCTYPE pkgmetadata SYSTEM "http://www.gentoo.org/dtd/metadata.dtd"> <pkgmetadata> -<maintainer type="project"> - <email>sci@gentoo.org</email> - <name>Gentoo Science Project</name> -</maintainer> -<longdescription lang="en"> - Minpack includes software for solving nonlinear equations and - nonlinear least squares problems. Five algorithmic paths each - include a core subroutine and an easy-to-use driver. The algorithms - proceed either from an analytic specification of the Jacobian matrix - or directly from the problem functions. The paths include facilities - for systems of equations with a banded Jacobian matrix, for least - squares problems with a large amount of data, and for checking the - consistency of the Jacobian matrix with the functions. - This is the C re-write of the original fortran minpack - implementation. -</longdescription> - <upstream> - <remote-id type="github">devernay/cminpack</remote-id> - </upstream> + <maintainer type="project"> + <email>sci@gentoo.org</email> + <name>Gentoo Science Project</name> + </maintainer> + <longdescription lang="en"> + Minpack includes software for solving nonlinear equations and + nonlinear least squares problems. Five algorithmic paths each + include a core subroutine and an easy-to-use driver. The algorithms + proceed either from an analytic specification of the Jacobian matrix + or directly from the problem functions. The paths include facilities + for systems of equations with a banded Jacobian matrix, for least + squares problems with a large amount of data, and for checking the + consistency of the Jacobian matrix with the functions. + This is the C re-write of the original fortran minpack + implementation. + </longdescription> + <upstream> + <remote-id type="github">devernay/cminpack</remote-id> + </upstream> </pkgmetadata> |