>>> queue = LinkedQueue() >>> queue.get() Traceback (most recent call last): ... IndexError: dequeue from empty queue >>> for i in range(1, 6): ... queue.put(i) >>> str(queue) '1 <- 2 <- 3 <- 4 <- 5'
(self, item: Any)
| 93 | return len(self) == 0 |
| 94 | |
| 95 | def put(self, item: Any) -> None: |
| 96 | """ |
| 97 | >>> queue = LinkedQueue() |
| 98 | >>> queue.get() |
| 99 | Traceback (most recent call last): |
| 100 | ... |
| 101 | IndexError: dequeue from empty queue |
| 102 | >>> for i in range(1, 6): |
| 103 | ... queue.put(i) |
| 104 | >>> str(queue) |
| 105 | '1 <- 2 <- 3 <- 4 <- 5' |
| 106 | """ |
| 107 | node = Node(item) |
| 108 | if self.is_empty(): |
| 109 | self.front = self.rear = node |
| 110 | else: |
| 111 | assert isinstance(self.rear, Node) |
| 112 | self.rear.next = node |
| 113 | self.rear = node |
| 114 | |
| 115 | def get(self) -> Any: |
| 116 | """ |