(self)
| 63 | curr = curr.next |
| 64 | |
| 65 | def __reversed__(self) -> t.Generator[str, None, None]: |
| 66 | # Traverse the linked list in reverse order. |
| 67 | root = self.__root |
| 68 | curr = root.prev |
| 69 | while curr is not root: |
| 70 | yield curr.key |
| 71 | curr = curr.prev |
| 72 | |
| 73 | def pop(self, last: bool = True) -> str: |
| 74 | if not self: |
nothing calls this directly
no outgoing calls
no test coverage detected