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.

Modules

[Index] [Quick Jump]

Downloads

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1.0.0, 0.2.1.0
Dependencies base (>=4.7 && <4.19) [details]
License MIT
Copyright Copyright (C) 2015-2023 Jake McArthur
Author Jake McArthur
Maintainer Jake.McArthur@gmail.com
Revised Revision 2 made by JakeMcArthur at 2023-08-13T19:50:41Z
Category Data Structures
Home page https://github.com/jmcarthur/stable-heap
Bug tracker https://github.com/jmcarthur/stable-heap/issues
Source repo head: git clone https://github.com/jmcarthur/stable-heap.git
this: git clone https://github.com/jmcarthur/stable-heap.git(tag v0.2.1.0)
Uploaded by JakeMcArthur at 2023-08-13T19:48:14Z
Distributions NixOS:0.2.1.0
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 908 total (2 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2023-08-13 [all 1 reports]