161cdfdab6
search tree and a priority queue. A 'Binding' is a product of a key and a priority. Bindings can be inserted, deleted, modified and queried in logarithmic time, and the binding with the least priority can be retrieved in constant time. A queue can be built from a list of bindings, sorted by keys, in linear time. WWW: http://hackage.haskell.org/package/PSQueue Obtained from: FreeBSD Haskell
2 lines
140 B
Text
2 lines
140 B
Text
SHA256 (cabal/PSQueue-1.1.tar.gz) = a8e0871ad10f916f55c3b9baec53eff23c4e97e09cf96d6c66771789e00a49cc
|
|
SIZE (cabal/PSQueue-1.1.tar.gz) = 6280
|