| 95 | } |
| 96 | |
| 97 | void DoublyLinkedListInsertAfterNode(DoublyLinkedList *const list, |
| 98 | DoublyLinkedListNode *node, |
| 99 | void *data) { |
| 100 | OPENER_ASSERT(list->allocator != NULL) |
| 101 | if(list->last == node) { |
| 102 | DoublyLinkedListInsertAtTail(list, data); |
| 103 | } else { |
| 104 | DoublyLinkedListNode *new_node = DoublyLinkedListNodeCreate(data, |
| 105 | list->allocator); |
| 106 | new_node->previous = node; |
| 107 | new_node->next = node->next; |
| 108 | node->next->previous = new_node; |
| 109 | node->next = new_node; |
| 110 | } |
| 111 | } |
| 112 | |
| 113 | void DoublyLinkedListRemoveNode(DoublyLinkedList *const list, |
| 114 | DoublyLinkedListNode **pointer_to_node_pointer) |