sci-libs/levmar: [QA] Consistent whitespace in metadata.xml
authorDavid Seifert <soap@gentoo.org>
Sat, 25 Nov 2017 16:51:03 +0000 (17:51 +0100)
committerDavid Seifert <soap@gentoo.org>
Sat, 25 Nov 2017 17:37:54 +0000 (18:37 +0100)
sci-libs/levmar/metadata.xml

index a1d97390a7a7095d1092d85e577c065ab75868b3..114a1bee0b24f542601cef12c470048480e87f84 100644 (file)
@@ -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>