diff options
| author |   Francesco Turco <fturco@fastmail.fm> | 2017-09-07 17:06:03 +0200 |
|---|---|---|
| committer |   Michał Górny <mgorny@gentoo.org> | 2018-01-27 10:54:22 +0100 |
| commit | 273c8db6bc8fe27e391ff655a423cc606fa855b0 (patch) | |
| tree | 6db75e7052e4051f1c4323a421771ab7d6bf7e43 /dev-haskell | |
| parent | dev-haskell/hashtables: use HTTPS for links to en.wikipedia.org, bug #637190 (diff) | |
| download | gentoo-273c8db6bc8fe27e391ff655a423cc606fa855b0.tar.gz gentoo-273c8db6bc8fe27e391ff655a423cc606fa855b0.tar.bz2 gentoo-273c8db6bc8fe27e391ff655a423cc606fa855b0.zip | |
dev-haskell/psqueues: use HTTPS for links to en.wikipedia.org, bug #637190
Diffstat (limited to 'dev-haskell')
| -rw-r--r-- | dev-haskell/psqueues/metadata.xml | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/dev-haskell/psqueues/metadata.xml b/dev-haskell/psqueues/metadata.xml index 2237d4004fe0..4860915e4a9d 100644 --- a/dev-haskell/psqueues/metadata.xml +++ b/dev-haskell/psqueues/metadata.xml @@ -7,7 +7,7 @@ </maintainer> <longdescription> The psqueues package provides - <http://en.wikipedia.org/wiki/Priority_queue Priority Search Queues> in + <https://en.wikipedia.org/wiki/Priority_queue Priority Search Queues> 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 <http://en.wikipedia.org/wiki/Radix_tree radix tree> + to @Int@ and uses a <https://en.wikipedia.org/wiki/Radix_tree radix tree> (like @IntMap@) with an additional min-heap property. * @HashPSQ k p v@ is a fairly straightforward extension of @IntPSQ@: it |