The stable-heap package

[Tags:benchmark, library, mit]

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.

Properties

Versions 0.1.0.0
Dependencies base (==4.8.*) [details]
License MIT
Copyright Copyright (C) 2015 Jake McArthur
Author Jake McArthur
Maintainer Jake.McArthur@gmail.com
Stability experimental
Category Data Structures
Home page http://hub.darcs.net/jmcarthur/stable-heap
Bug tracker http://hub.darcs.net/jmcarthur/stable-heap/issues
Source repository head: darcs get http://hub.darcs.net/jmcarthur/stable-heap
this: darcs get http://hub.darcs.net/jmcarthur/stable-heap --tag v0.1.0.0
Uploaded Sun May 17 16:18:27 UTC 2015 by JakeMcArthur
Distributions NixOS:0.1.0.0
Downloads 131 total (4 in the last 30 days)
Votes
0 []
Status Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees