diff options
Diffstat (limited to 'dev-haskell/psqueues/metadata.xml')
| -rw-r--r-- | dev-haskell/psqueues/metadata.xml | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/dev-haskell/psqueues/metadata.xml b/dev-haskell/psqueues/metadata.xml index d4c0b904bde1..f44e265cde02 100644 --- a/dev-haskell/psqueues/metadata.xml +++ b/dev-haskell/psqueues/metadata.xml @@ -8,7 +8,7 @@ three different flavors. * @OrdPSQ k p v@, which uses the @Ord k@ instance to provide fast insertion, - deletion and lookup. This implementation is based on Ralf Hinze's + deletion and lookup. This implementation is based on Ralf Hinze's <http://citeseer.ist.psu.edu/hinze01simple.html A Simple Implementation Technique for Priority Search Queues>. Hence, it is similar to the <http://hackage.haskell.org/package/PSQueue PSQueue> library, although it is @@ -19,7 +19,7 @@ (like @IntMap@) with an additional min-heap property. * @HashPSQ k p v@ is a fairly straightforward extension of @IntPSQ@: it - simply uses the keys' hashes as indices in the @IntPSQ@. If there are any + simply uses the keys' hashes as indices in the @IntPSQ@. If there are any hash collisions, it uses an @OrdPSQ@ to resolve those. The performance of this implementation is comparable to that of @IntPSQ@, but it is more widely applicable since the keys are not restricted to @Int@, but rather to any @@ -43,6 +43,6 @@ * Schedulers; - * Pathfinding algorithms, such as Dijkstra's and A*. + * Pathfinding algorithms, such as Dijkstra's and A*. </longdescription> </pkgmetadata> |