fritter.heap

module documentation
(source)

Implementation of PriorityQueue in terms of the standard library's heappop and heappush functions.

Class Heap A simple implementation of a priority queue using the standard library's heappop and heappush functions.
Variable _HeapIsQueue Undocumented
_HeapIsQueue: type[PriorityQueue[int]] = (source) ΒΆ

Undocumented