(self)
return heappop(self.heap).item
Return the item with the lowest priority, and remove it from the queue.
Return the item with the lowest priority, and remove it from the queue.
Return the item with the lowest priority and remove it from the queue .
def pop(self):
        """
        Return the item with the lowest priority, and remove it from the queue.
        """
        return heappop(self.heap).item
def pop ( self ) : return heappop ( self . heap ) . item