app-crypt/rainbowcrack: [QA] Consistent whitespace in metadata.xml

diff --git a/app-crypt/rainbowcrack/metadata.xml b/app-crypt/rainbowcrack/metadata.xml
index 861e967436b69730b45c39c7a17115aacb30e4ee..dba1a3e1b1d74991444f0aec640c124a27a56fb5 100644 (file)
--- a/app-crypt/rainbowcrack/metadata.xml
+++ b/app-crypt/rainbowcrack/metadata.xml
@@ -1,17 +1,17 @@
 <?xml version="1.0" encoding="UTF-8"?>
 <!DOCTYPE pkgmetadata SYSTEM "http://www.gentoo.org/dtd/metadata.dtd">
 <pkgmetadata>
-<maintainer type="project">
-       <email>crypto@gentoo.org</email>
-       <name>Crypto</name>
-</maintainer>
-<longdescription>
-RainbowCrack is a general propose implementation of Philippe Oechslin's faster time-memory trade-off technique.
- In short, the RainbowCrack tool is a password cracker. A traditional brute force cracker try all possible 
-plaintexts one by one in cracking time. It is time consuming to break complex password in this way. The idea of 
-time-memory trade-off is to do all cracking time computation in advance and store the result in files so called 
-"rainbow table". It does take a long time to precompute the tables. But once the one time precomputation is 
-finished, a time-memory trade-off cracker can be hundreds of times faster than a brute force cracker, with the 
-help of precomputed tables.
-</longdescription>
+       <maintainer type="project">
+               <email>crypto@gentoo.org</email>
+               <name>Crypto</name>
+       </maintainer>
+       <longdescription>
+               RainbowCrack is a general propose implementation of Philippe Oechslin's faster time-memory trade-off technique.
+               In short, the RainbowCrack tool is a password cracker. A traditional brute force cracker try all possible
+               plaintexts one by one in cracking time. It is time consuming to break complex password in this way. The idea of
+               time-memory trade-off is to do all cracking time computation in advance and store the result in files so called
+               "rainbow table". It does take a long time to precompute the tables. But once the one time precomputation is
+               finished, a time-memory trade-off cracker can be hundreds of times faster than a brute force cracker, with the
+               help of precomputed tables.
+       </longdescription>
 </pkgmetadata>