</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,
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