minheap provides several heap data structures with meldable min-heap and priority queue functionality. Due to this lib's history, all implemented heaps are currently limited to fixnum keys in min-first order though an adaption for other needs should be quite simple.

In the current version this library sports the following heap data structures: binary, Fibonacci, pairing (in a number of variants), rank pairing, splay, violation

Git repository is at: https://github.com/sfrank/minheap

Quick assessment (2023-04-22)

Passes all tests in CCL and MKCL. The tests require lisp-unit.