fingertree-psqueue: Implementation of priority search queues as finger trees.

[ bsd3, data-structures, library ] [ Propose Tags ]

An implementation of priority search queues: a datastructure holding key/priority bindings having fast operations both for extracting the element with minimum priority and for modifying and looking up elements by key.

Modules

[Index]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1, 0.2, 0.3
Dependencies base (<6), fingertree [details]
License BSD-3-Clause
Copyright (c) 2009 Cale Gibbard
Author Cale Gibbard
Maintainer cgibbard@gmail.com
Category Data Structures
Uploaded by CaleGibbard at 2011-09-28T06:06:07Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 3625 total (10 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]