@hackage / stable-heap

Purely functional stable heaps (fair priority queues)

Latest0.3.0.0

About

Metadata

  • Last updated , by JakeMcArthur
  • License MIT
  • Categories Data Structures

  • Maintained by: Jake.McArthur@gmail.com

  • Lottery factor: 1

Links

Installation

Tested Compilers

  1. 9.12.2
  2. 9.10.3
  3. 9.8.4
  4. 9.6.7

Readme

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.