stable-heap: Purely functional stable heaps (fair priority queues)
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.
|Dependencies||base (>=4.8 && <4.9) [details]|
|Copyright||Copyright (C) 2015 Jake McArthur|
|Source repo||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||by JakeMcArthur at 2015-05-17T16:18:27Z|
|Reverse Dependencies||1 direct, 0 indirect [details]|
|Downloads||846 total (8 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]