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.

Modules

[Index]

Downloads

• stable-heap-0.1.0.0.tar.gz [browse] (Cabal source package)
• Package description (as included in the package)

Maintainer's Corner

Package maintainers

• JakeMcArthur

For package maintainers and hackage trustees

• edit package information

Candidates

• No Candidates