summaryrefslogtreecommitdiff
blob: 4feb6b73581db75fabbae2195fd27c834d9b1223 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE pkgmetadata SYSTEM "https://www.gentoo.org/dtd/metadata.dtd">
<pkgmetadata>
	<herd>haskell</herd>
	<longdescription>
		A /priority search queue/ efficiently supports the
		opperations of both a search tree and a priority queue. A
		&#39;Binding&#39; 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.
	</longdescription>
</pkgmetadata>