stable-heap: Purely functional stable heaps (fair priority queues)

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

This library provides a purely functional implementation of stable heaps (fair priority queues). The data structure is a cousin of the pairing heap which maintains a sequential ordering of the keys. Insertion can be to either end of the heap, as though it is a deque, and it can be split on the left-most occurrence of the minimum key.

The current state of the package is fairly barebones. It will be fleshed out later.




Maintainer's Corner

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS]
Dependencies base (>=4.8 && <4.9) [details]
License MIT
Copyright Copyright (C) 2015 Jake McArthur
Author Jake McArthur
Category Data Structures
Home page
Bug tracker
Source repo head: darcs get
this: darcs get --tag v0.1.0.0
Uploaded by JakeMcArthur at 2015-05-17T16:18:27Z
Distributions NixOS:
Downloads 795 total (8 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]