Gentoo Packages

Search

Install

Install this package:

emerge -a dev-haskell/meldable-heap

If the package is masked, you can unmask it using the autounmask tool or standard emerge options:

autounmask dev-haskell/meldable-heap

Or alternatively:

emerge --autounmask-write -a dev-haskell/meldable-heap

Package Information

Description:

A heap is a container supporting the insertion of elements and the extraction of the minimum element. This library additionally supports melding two heaps. This library models the implementation of asymptotically optimal purely functional heaps given by Brodal and Okasaki in their paper \"Optimal Purely Functional Priority Queues\". It has been proved correct using the Coq proof assistant. The proofs are included in the Cabal package. A description of the differences between versions of this package is available at <http://priority-queues.googlecode.com/hg/brodal-okasaki/cabal/CHANGELOG>.

Homepage:

https://github.com/jbapple/priority-queues

License:

BSD

Versions

Metadata

Description

• A heap is a container supporting the insertion of elements and the extraction of the minimum element. This library additionally supports melding two heaps. This library models the implementation of asymptotically optimal purely functional heaps given by Brodal and Okasaki in their paper \"Optimal Purely Functional Priority Queues\". It has been proved correct using the Coq proof assistant. The proofs are included in the Cabal package. A description of the differences between versions of this package is available at <http://priority-queues.googlecode.com/hg/brodal-okasaki/cabal/CHANGELOG>.

Maintainers

• Gentoo Haskell (haskell@gentoo.org) - Type: project

<pkgmetadata>
	<maintainer type="project">
		<email>haskell@gentoo.org</email>
		<name>Gentoo Haskell</name>
	</maintainer>
	<longdescription>
		A heap is a container supporting the insertion of elements and the extraction of the minimum element. This library additionally supports melding two heaps. This library models the implementation of asymptotically optimal purely functional heaps given by Brodal and Okasaki in their paper \"Optimal Purely Functional Priority Queues\". It has been proved correct using the Coq proof assistant. The proofs are included in the Cabal package.
		
		A description of the differences between versions of this package is available at &lt;http://priority-queues.googlecode.com/hg/brodal-okasaki/cabal/CHANGELOG&gt;.
	</longdescription>
</pkgmetadata>

Lint Warnings

• [Error] Missing md5-cache for ebuild meldable-heap-2.0.3-r1

Manifest