| 1 |
commit: 273c8db6bc8fe27e391ff655a423cc606fa855b0 |
| 2 |
Author: Francesco Turco <fturco <AT> fastmail <DOT> fm> |
| 3 |
AuthorDate: Thu Sep 7 15:06:03 2017 +0000 |
| 4 |
Commit: Michał Górny <mgorny <AT> gentoo <DOT> org> |
| 5 |
CommitDate: Sat Jan 27 09:54:22 2018 +0000 |
| 6 |
URL: https://gitweb.gentoo.org/repo/gentoo.git/commit/?id=273c8db6 |
| 7 |
|
| 8 |
dev-haskell/psqueues: use HTTPS for links to en.wikipedia.org, bug #637190 |
| 9 |
|
| 10 |
dev-haskell/psqueues/metadata.xml | 4 ++-- |
| 11 |
1 file changed, 2 insertions(+), 2 deletions(-) |
| 12 |
|
| 13 |
diff --git a/dev-haskell/psqueues/metadata.xml b/dev-haskell/psqueues/metadata.xml |
| 14 |
index 2237d4004fe..4860915e4a9 100644 |
| 15 |
--- a/dev-haskell/psqueues/metadata.xml |
| 16 |
+++ b/dev-haskell/psqueues/metadata.xml |
| 17 |
@@ -7,7 +7,7 @@ |
| 18 |
</maintainer> |
| 19 |
<longdescription> |
| 20 |
The psqueues package provides |
| 21 |
- <http://en.wikipedia.org/wiki/Priority_queue Priority Search Queues> in |
| 22 |
+ <https://en.wikipedia.org/wiki/Priority_queue Priority Search Queues> in |
| 23 |
three different flavors. |
| 24 |
|
| 25 |
* @OrdPSQ k p v@, which uses the @Ord k@ instance to provide fast insertion, |
| 26 |
@@ -18,7 +18,7 @@ |
| 27 |
considerably faster and provides a slightly different API. |
| 28 |
|
| 29 |
* @IntPSQ p v@ is a far more efficient implementation. It fixes the key type |
| 30 |
- to @Int@ and uses a <http://en.wikipedia.org/wiki/Radix_tree radix tree> |
| 31 |
+ to @Int@ and uses a <https://en.wikipedia.org/wiki/Radix_tree radix tree> |
| 32 |
(like @IntMap@) with an additional min-heap property. |
| 33 |
|
| 34 |
* @HashPSQ k p v@ is a fairly straightforward extension of @IntPSQ@: it |
Archives