MCPcopy Index your code
hub / github.com/keon/algorithms / dequeue

Method dequeue

algorithms/data_structures/queue.py:95–110  ·  view source on GitHub ↗

Remove and return the front item. Returns: The front element. Raises: IndexError: If the queue is empty.

(self)

Source from the content-addressed store, hash-verified

93 self._size += 1
94
95 def dequeue(self) -> object:
96 """Remove and return the front item.
97
98 Returns:
99 The front element.
100
101 Raises:
102 IndexError: If the queue is empty.
103 """
104 if self.is_empty():
105 raise IndexError("Queue is empty")
106 value = self._array[self._front]
107 self._array[self._front] = None
108 self._front += 1
109 self._size -= 1
110 return value
111
112 def peek(self) -> object:
113 """Return the front element without removing it.

Callers 1

test_array_queueMethod · 0.95

Calls 1

is_emptyMethod · 0.45

Tested by 1

test_array_queueMethod · 0.76