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]
Versions [faq] 0.1, 0.2, 0.2.1.1, 0.2.2, 0.2.3, 0.3.0.1, 0.3.1, 0.3.2, 0.3.2.1, 0.3.3, 0.3.4.1, 0.3.5, 0.3.6, 0.3.6.1
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 Tue Feb 5 18:38:15 UTC 2019
Distributions Arch:0.3.6.1, LTSHaskell:0.3.6.1, NixOS:0.3.6.1, Stackage:0.3.6.1
Downloads 15109 total (422 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2019-02-05 [all 1 reports]

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees


Readme for heaps-0.3.6.1

[back to package description]

heaps

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