diff options
author | David Seifert <soap@gentoo.org> | 2017-11-25 17:51:03 +0100 |
---|---|---|
committer | David Seifert <soap@gentoo.org> | 2017-11-25 18:37:54 +0100 |
commit | 9dea069fff1708a44276553f7b1785b2bb28e0f1 (patch) | |
tree | fa3cebc5df098c083801cb36ced9f0b3795a4446 /sci-libs/levmar | |
parent | sci-libs/ldl: [QA] Consistent whitespace in metadata.xml (diff) | |
download | gentoo-9dea069fff1708a44276553f7b1785b2bb28e0f1.tar.gz gentoo-9dea069fff1708a44276553f7b1785b2bb28e0f1.tar.bz2 gentoo-9dea069fff1708a44276553f7b1785b2bb28e0f1.zip |
sci-libs/levmar: [QA] Consistent whitespace in metadata.xml
Diffstat (limited to 'sci-libs/levmar')
-rw-r--r-- | sci-libs/levmar/metadata.xml | 30 |
1 files changed, 15 insertions, 15 deletions
diff --git a/sci-libs/levmar/metadata.xml b/sci-libs/levmar/metadata.xml index a1d97390a7a7..114a1bee0b24 100644 --- a/sci-libs/levmar/metadata.xml +++ b/sci-libs/levmar/metadata.xml @@ -1,19 +1,19 @@ <?xml version="1.0" encoding="UTF-8"?> <!DOCTYPE pkgmetadata SYSTEM "http://www.gentoo.org/dtd/metadata.dtd"> <pkgmetadata> -<maintainer type="person"> - <email>amynka@gentoo.org</email> -</maintainer> -<maintainer type="project"> - <email>3dprint@gentoo.org</email> - <name>Gentoo 3D print</name> -</maintainer> -<longdescription lang="en"> - levmar is a native ANSI C implementation of the Levenberg-Marquardt - optimization algorithm. Both unconstrained and constrained (under - linear equations, inequality and box constraints) - Levenberg-Marquardt variants are included. The LM algorithm is an - iterative technique that finds a local minimum of a function that is - expressed as the sum of squares of nonlinear functions. -</longdescription> + <maintainer type="person"> + <email>amynka@gentoo.org</email> + </maintainer> + <maintainer type="project"> + <email>3dprint@gentoo.org</email> + <name>Gentoo 3D print</name> + </maintainer> + <longdescription lang="en"> + levmar is a native ANSI C implementation of the Levenberg-Marquardt + optimization algorithm. Both unconstrained and constrained (under + linear equations, inequality and box constraints) + Levenberg-Marquardt variants are included. The LM algorithm is an + iterative technique that finds a local minimum of a function that is + expressed as the sum of squares of nonlinear functions. + </longdescription> </pkgmetadata> |