>>> queue = LinkedQueue() >>> queue.get() Traceback (most recent call last): ... IndexError: dequeue from empty queue >>> queue = LinkedQueue() >>> for i in range(1, 6): ... queue.put(i) >>> for i in range(1, 6):
(self)
| 113 | self.rear = node |
| 114 | |
| 115 | def get(self) -> Any: |
| 116 | """ |
| 117 | >>> queue = LinkedQueue() |
| 118 | >>> queue.get() |
| 119 | Traceback (most recent call last): |
| 120 | ... |
| 121 | IndexError: dequeue from empty queue |
| 122 | >>> queue = LinkedQueue() |
| 123 | >>> for i in range(1, 6): |
| 124 | ... queue.put(i) |
| 125 | >>> for i in range(1, 6): |
| 126 | ... assert queue.get() == i |
| 127 | >>> len(queue) |
| 128 | 0 |
| 129 | """ |
| 130 | if self.is_empty(): |
| 131 | raise IndexError("dequeue from empty queue") |
| 132 | assert isinstance(self.front, Node) |
| 133 | node = self.front |
| 134 | self.front = self.front.next |
| 135 | if self.front is None: |
| 136 | self.rear = None |
| 137 | return node.data |
| 138 | |
| 139 | def clear(self) -> None: |
| 140 | """ |