summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMichał Górny <mgorny@gentoo.org>2016-01-24 23:15:58 +0100
committerMichał Górny <mgorny@gentoo.org>2016-01-24 23:58:38 +0100
commit4412ca2c79a50481eff42550e9d63cba74c9ffc4 (patch)
treec9fc5379b3c3097e4235ec64664ef2d893dd58ad /dev-haskell/lcs/metadata.xml
parentpackage.use.mask studio for net-analyzer/icinga2 (diff)
downloadgentoo-4412ca2c79a50481eff42550e9d63cba74c9ffc4.tar.gz
gentoo-4412ca2c79a50481eff42550e9d63cba74c9ffc4.tar.bz2
gentoo-4412ca2c79a50481eff42550e9d63cba74c9ffc4.zip
Unify quoting in metadata.xml files for machine processing
Force unified quoting in all metadata.xml files since lxml does not preserve original use of single and double quotes. Ensuring unified quoting before the process allows distinguishing the GLEP 67-related metadata.xml changes from unrelated quoting changes.
Diffstat (limited to 'dev-haskell/lcs/metadata.xml')
-rw-r--r--dev-haskell/lcs/metadata.xml6
1 files changed, 3 insertions, 3 deletions
diff --git a/dev-haskell/lcs/metadata.xml b/dev-haskell/lcs/metadata.xml
index fa121ce23df5..272873069bfc 100644
--- a/dev-haskell/lcs/metadata.xml
+++ b/dev-haskell/lcs/metadata.xml
@@ -4,15 +4,15 @@
<herd>haskell</herd>
<longdescription>
Provides a function lcs that takes two lists and returns a longest
- common sublist. For example, lcs &quot;abcd&quot; &quot;acbd&quot; is either &quot;abd&quot; or
- &quot;acd&quot;.
+ common sublist. For example, lcs "abcd" "acbd" is either "abd" or
+ "acd".
The package provides a simple, stupid and (most of all) slow
implementation that needs, for inputs of length m and n, O(m+n)
space and O((m+n)!) time in the worst case.
It also provides an implementation of the Hunt-Szymanski LCS
- algorithm, based on that in &quot;String searching algorithms&quot; by
+ algorithm, based on that in "String searching algorithms" by
Graham A Stephen, ISBN 981021829X.
Given inputs xs and ys of length m and n respectively, where there