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 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
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>
Revised Revision 2 made by ryanglscott at Tue Mar 13 14:33:43 UTC 2018
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 Thu Jan 18 19:45:16 UTC 2018
Distributions LTSHaskell:0.3.6, NixOS:0.3.6, Stackage:0.3.6, openSUSE:0.3.6
Downloads 10901 total (70 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2018-01-18 [all 1 reports]
Hackage Matrix CI

Modules

[Index]

Downloads

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

For package maintainers and hackage trustees


Readme for heaps-0.3.6

[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