heaps: Asymptotically optimal Brodal/Okasaki heaps.

[ bsd3, data-structures, library ] [ Propose Tags ]

Asymptotically optimal Brodal/Okasaki bootstrapped skew-binomial heaps from the paper "Optimal Purely Functional Priority Queues", extended with a Foldable interface.

[Skip to Readme]


[Index] [Quick Jump]


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS] 0.1, 0.2,, 0.2.2, 0.2.3,, 0.3.1, 0.3.2,, 0.3.3,, 0.3.5, 0.3.6,, 0.4
Change log CHANGELOG.markdown
Dependencies base (>=4 && <6) [details]
License BSD-3-Clause
Copyright (c) 2010-2015 Edward A. Kmett
Author Edward A. Kmett
Maintainer Edward A. Kmett <ekmett@gmail.com>
Category Data Structures
Home page http://github.com/ekmett/heaps/
Bug tracker http://github.com/ekmett/heaps/issues
Source repo head: git clone git://github.com/ekmett/heaps.git
Uploaded by ryanglscott at 2021-02-17T23:52:15Z
Distributions Arch:0.4, Debian:, Fedora:0.4, LTSHaskell:0.4, NixOS:0.4, Stackage:0.4
Reverse Dependencies 20 direct, 2018 indirect [details]
Downloads 34324 total (176 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2021-02-17 [all 1 reports]

Readme for heaps-0.4

[back to package description]


Hackage Build Status

This package provides Brodal/Okasaki heaps. These are asymptotically optimal purely functional heaps.

Contact Information

Contributions and bug reports are welcome!

Please feel free to contact me through github or on the #haskell IRC channel on irc.freenode.net.

-Edward Kmett