Method peek

algorithms/data_structures/queue.py:196–207

Return the front element without removing it. Returns: The front element. Raises: IndexError: If the queue is empty.

(self)

        return value

    def peek(self) -> object:
        """Return the front element without removing it.

        Returns:
            The front element.

        Raises:
            IndexError: If the queue is empty.
        """
        if self.is_empty():
            raise IndexError("Queue is empty")
        return self._front.value