This C extension implements a priority-queue object using a Fibonacci heap as the underlying data structure. It supports insertion, deletion, and reprioritization of entries.

All operations are O(log N) or faster; insertion and finding the lowest-priority item are O(1).