Removes and returns the given node from the list Returns None if node.prev or node.next is None
(
self, node: DoubleLinkedListNode[T, U]
)
| 125 | node.next = self.rear |
| 126 | |
| 127 | def remove( |
| 128 | self, node: DoubleLinkedListNode[T, U] |
| 129 | ) -> DoubleLinkedListNode[T, U] | None: |
| 130 | """ |
| 131 | Removes and returns the given node from the list |
| 132 | |
| 133 | Returns None if node.prev or node.next is None |
| 134 | """ |
| 135 | |
| 136 | if node.prev is None or node.next is None: |
| 137 | return None |
| 138 | |
| 139 | node.prev.next = node.next |
| 140 | node.next.prev = node.prev |
| 141 | node.prev = None |
| 142 | node.next = None |
| 143 | return node |
| 144 | |
| 145 | |
| 146 | class LRUCache[T, U]: |
no outgoing calls
no test coverage detected