diff options
author | V3n3RiX <venerix@redcorelinux.org> | 2018-01-27 18:07:28 +0000 |
---|---|---|
committer | V3n3RiX <venerix@redcorelinux.org> | 2018-01-27 18:07:28 +0000 |
commit | 67f76a858f1ac826bd8a550d756d9ec6e340ed4f (patch) | |
tree | 45f4ada6be05bc180a14e017c9d5c6b58a0eec6e /dev-haskell/psqueues/metadata.xml | |
parent | 38b7258d086dd5e263c3bbe3880c8c956676bc71 (diff) |
gentoo resync : 27.01.2018
Diffstat (limited to 'dev-haskell/psqueues/metadata.xml')
-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 |