[gentoo-commits] repo/gentoo:master commit in: dev-haskell/psqueues/

[Michał Górny]

commit:     273c8db6bc8fe27e391ff655a423cc606fa855b0
Author:     Francesco Turco <fturco <AT> fastmail <DOT> fm>
AuthorDate: Thu Sep  7 15:06:03 2017 +0000
Commit:     Michał Górny <mgorny <AT> gentoo <DOT> org>
CommitDate: Sat Jan 27 09:54:22 2018 +0000
URL:        https://gitweb.gentoo.org/repo/gentoo.git/commit/?id=273c8db6

dev-haskell/psqueues: use HTTPS for links to en.wikipedia.org, bug #637190

 dev-haskell/psqueues/metadata.xml | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/dev-haskell/psqueues/metadata.xml 
b/dev-haskell/psqueues/metadata.xml
index 2237d4004fe..4860915e4a9 100644
--- a/dev-haskell/psqueues/metadata.xml
+++ b/dev-haskell/psqueues/metadata.xml
@@ -7,7 +7,7 @@
        </maintainer>
        <longdescription>
                The psqueues package provides
-               &lt;http://en.wikipedia.org/wiki/Priority_queue Priority Search 
Queues&gt; in
+               &lt;https://en.wikipedia.org/wiki/Priority_queue Priority 
Search Queues&gt; in
                three different flavors.
                
                * @OrdPSQ k p v@, which uses the @Ord k@ instance to provide 
fast insertion,
@@ -18,7 +18,7 @@
                considerably faster and provides a slightly different API.
                
                * @IntPSQ p v@ is a far more efficient implementation. It fixes 
the key type
-               to @Int@ and uses a &lt;http://en.wikipedia.org/wiki/Radix_tree 
radix tree&gt;
+               to @Int@ and uses a 
&lt;https://en.wikipedia.org/wiki/Radix_tree radix tree&gt;
                (like @IntMap@) with an additional min-heap property.
                
                * @HashPSQ k p v@ is a fairly straightforward extension of 
@IntPSQ@: it