pettomato-indexed-priority-queue
A binary heap based priority queue implementation with efficient support for find, update, replace, and delete operations.
$ area51 add pettomato-indexed-priority-queueCopyUsage
;; area51 add updates your .asd automatically.
;; Use the package in your code:
(in-package :my-project)
(pettomato-indexed-priority-queue:some-function ...)