Adds the given node to the end of the list (before rear)
(self, node: DoubleLinkedListNode[T, U])
| 110 | return ",\n ".join(rep) |
| 111 | |
| 112 | def add(self, node: DoubleLinkedListNode[T, U]) -> None: |
| 113 | """ |
| 114 | Adds the given node to the end of the list (before rear) |
| 115 | """ |
| 116 | |
| 117 | previous = self.rear.prev |
| 118 | |
| 119 | # All nodes other than self.head are guaranteed to have non-None previous |
| 120 | assert previous is not None |
| 121 | |
| 122 | previous.next = node |
| 123 | node.prev = previous |
| 124 | self.rear.prev = node |
| 125 | node.next = self.rear |
| 126 | |
| 127 | def remove( |
| 128 | self, node: DoubleLinkedListNode[T, U] |
no outgoing calls