The heaps package

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

Asymptotically optimal BrodalOkasaki bootstrapped skew-binomial heaps from the paper <http:citeseerx.ist.psu.eduviewdoc/summary?doi=10.1.1.48.973 "Optimal Purely Functional Priority Queues">, extended with a Foldable interface.


[Skip to Readme]

Properties

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
Change log CHANGELOG.markdown
Dependencies base (>=4 && <4.8) [details]
License BSD3
Copyright (c) 2010 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 repository head: git clone git://github.com/ekmett/heaps.git
Uploaded Thu Mar 13 22:02:48 UTC 2014 by EdwardKmett
Updated Fri Jan 2 12:57:58 UTC 2015 by HerbertValerioRiedel to revision 1   [What is this?]
Distributions LTSHaskell:0.3.5, NixOS:0.3.5, Stackage:0.3.5, Tumbleweed:0.3.4.1
Downloads 8100 total (209 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Successful builds reported [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.1

[back to package description]

heaps

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