| 49 | } |
| 50 | |
| 51 | void DoublyLinkedListInsertAtHead(DoublyLinkedList *const list, |
| 52 | void *data) { |
| 53 | OPENER_ASSERT(list->allocator != NULL) |
| 54 | DoublyLinkedListNode * new_node = DoublyLinkedListNodeCreate(data, |
| 55 | list->allocator); |
| 56 | if(NULL == list->first) { |
| 57 | list->first = new_node; |
| 58 | list->last = new_node; |
| 59 | } else { |
| 60 | new_node->next = list->first; |
| 61 | list->first->previous = new_node; |
| 62 | list->first = new_node; |
| 63 | } |
| 64 | } |
| 65 | |
| 66 | void DoublyLinkedListInsertAtTail(DoublyLinkedList *const list, |
| 67 | const void *const data) { |