heaps

Asymptotically optimal Brodal/Okasaki heaps.

http://github.com/ekmett/heaps/

Version on this page:0.3.5@rev:1
LTS Haskell 24.16:0.4.1
Stackage Nightly 2025-10-24:0.4.1
Latest on Hackage:0.4.1

See all snapshots heaps appears in

BSD-3-Clause licensed by Edward A. Kmett
Maintained by Edward A. Kmett
This version can be pinned in stack with:heaps-0.3.5@sha256:47960adf0a92f0efcf65ca42fc4c2e0560eac0ea134b9d2acd433e1356a85b15,1605

Module documentation for 0.3.5

Depends on 1 package(full list with versions):
base

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

Changes

0.3.5

  • Support doctest-0.12

0.3.4.1

  • Fix a typo in the doctests for mapMonotonic

0.3.4

  • Add Bifunctor Entry instance
  • Revamp Setup.hs to use cabal-doctest. This makes it build with Cabal-2.0, and makes the doctests work with cabal new-build and sandboxes.

0.3.3

  • Remove redundant constraints
  • Build warning-free on GHC 8.0-rc1

0.3.2.1

  • Haddock fix

0.3.2

  • Build without warnings on GHC 7.10
  • Overload Foldable null and length on GHC 7.10+

0.3.1

  • Explicit nominal role annotation

0.3.0.1

  • Nicer formatting of the haddocks