fritter.heap.Heap

class documentation

class Heap(Generic[Prioritized]): (source)

View In Hierarchy

A simple implementation of a priority queue using the standard library's heappop and heappush functions.

Method __iter__ Implementation of PriorityQueue.__iter__
Method add Implementation of PriorityQueue.add
Method get Implementation of PriorityQueue.get
Method peek Implementation of PriorityQueue.peek
Method remove Implementation of PriorityQueue.remove
Class Variable _values Undocumented
def __iter__(self) -> Iterator[Prioritized]: (source)

Implementation of PriorityQueue.__iter__

def add(self, item: Prioritized): (source)

Implementation of PriorityQueue.add

def get(self) -> Prioritized | None: (source)

Implementation of PriorityQueue.get

def peek(self) -> Prioritized | None: (source)

Implementation of PriorityQueue.peek

def remove(self, item: Prioritized) -> bool: (source)

Implementation of PriorityQueue.remove

_values: list[Prioritized] = (source)

Undocumented