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/chasingbottoms/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/chasingbottoms/metadata.xml')
-rw-r--r--dev-haskell/chasingbottoms/metadata.xml20
1 files changed, 10 insertions, 10 deletions
diff --git a/dev-haskell/chasingbottoms/metadata.xml b/dev-haskell/chasingbottoms/metadata.xml
index bf0a95f2eed..21f906bf63f 100644
--- a/dev-haskell/chasingbottoms/metadata.xml
+++ b/dev-haskell/chasingbottoms/metadata.xml
@@ -32,13 +32,13 @@
Showing partial and infinite values (@\\\/!@ is join and @\/\\!@ is meet):
- [@&gt; approxShow 4 $ (True, bottom) \\\/! (bottom, \&#39;b\&#39;)@] @\&quot;Just (True, \&#39;b\&#39;)\&quot;@
+ [@&gt; approxShow 4 $ (True, bottom) \\\/! (bottom, \'b\')@] @\"Just (True, \'b\')\"@
- [@&gt; approxShow 4 $ (True, bottom) \/\\! (bottom, \&#39;b\&#39;)@] @\&quot;(_|_, _|_)\&quot;@
+ [@&gt; approxShow 4 $ (True, bottom) \/\\! (bottom, \'b\')@] @\"(_|_, _|_)\"@
- [@&gt; approxShow 4 $ ([1..\] :: [Int\])@] @\&quot;[1, 2, 3, _\&quot;@
+ [@&gt; approxShow 4 $ ([1..\] :: [Int\])@] @\"[1, 2, 3, _\"@
- [@&gt; approxShow 4 $ (cycle [bottom\] :: [Bool\])@] @\&quot;[_|_, _|_, _|_, _\&quot;@
+ [@&gt; approxShow 4 $ (cycle [bottom\] :: [Bool\])@] @\"[_|_, _|_, _|_, _\"@
Approximately comparing infinite, partial values:
@@ -47,16 +47,16 @@
[@&gt; approx 100 [2,4..\] \/=! approx 100 (filter even [bottom..\] :: [Int\])@] @True@
The code above relies on the fact that @bottom@, just as @error
- \&quot;...\&quot;@, @undefined@ and pattern match failures, yield
+ \"...\"@, @undefined@ and pattern match failures, yield
exceptions. Sometimes we are dealing with properly non-terminating
computations, such as the following example, and then it can be nice to
be able to apply a time-out:
- [@&gt; timeOut&#39; 1 (reverse [1..5\])@] @Value [5,4,3,2,1]@
+ [@&gt; timeOut' 1 (reverse [1..5\])@] @Value [5,4,3,2,1]@
- [@&gt; timeOut&#39; 1 (reverse [1..\])@] @NonTermination@
+ [@&gt; timeOut' 1 (reverse [1..\])@] @NonTermination@
- The time-out functionality can be used to treat \&quot;slow\&quot; computations as
+ The time-out functionality can be used to treat \"slow\" computations as
bottoms:
[@&gt; let tweak = Tweak &amp;#x7b; approxDepth = Just 5, timeOutLimit = Just 2 &amp;#x7d;@]
@@ -86,8 +86,8 @@
[@ @] @Value ()@
For the underlying theory and a larger example involving use of
- QuickCheck, see the article \&quot;Chasing Bottoms, A Case Study in Program
- Verification in the Presence of Partial and Infinite Values\&quot;
+ QuickCheck, see the article \"Chasing Bottoms, A Case Study in Program
+ Verification in the Presence of Partial and Infinite Values\"
(&lt;http://www.cse.chalmers.se/~nad/publications/danielsson-jansson-mpc2004.html&gt;).
The code has been tested using GHC. Most parts can probably be