diff options
| -rw-r--r-- | assignments/01/swap_doubly_linked_list_test.c | 42 |
1 files changed, 34 insertions, 8 deletions
diff --git a/assignments/01/swap_doubly_linked_list_test.c b/assignments/01/swap_doubly_linked_list_test.c index 34d4aef..2670922 100644 --- a/assignments/01/swap_doubly_linked_list_test.c +++ b/assignments/01/swap_doubly_linked_list_test.c @@ -79,6 +79,7 @@ static int size(Node *head) { static void swap(Node *x, Node *y) { if (x == y) return; + if (!x || !y) return; Node *xp = x->prev, *xn = x->next, *yp = y->prev, *yn = y->next; @@ -153,6 +154,33 @@ Ensure(DoublyLinkedList, when_getting_index_out_of_range) { free(head); } +Ensure(DoublyLinkedList, when_swapping_head_with_non_adjacent_node) { + Node *head = initialize(100); + Node *mid1 = add(head, 200); + Node *mid2 = add(head, 300); + Node *tail = add(head, 400); + + swap(head, mid2); + + assert_that(head->prev, is_equal_to(mid1)); + assert_that(head->data, is_equal_to(100)); + assert_that(head->next, is_equal_to(tail)); + + assert_that(mid1->prev, is_equal_to(mid2)); + assert_that(mid1->data, is_equal_to(200)); + assert_that(mid1->next, is_equal_to(head)); + + assert_that(mid2->prev, is_equal_to(NULL)); + assert_that(mid2->data, is_equal_to(300)); + assert_that(mid2->next, is_equal_to(mid1)); + + assert_that(tail->prev, is_equal_to(head)); + assert_that(tail->data, is_equal_to(400)); + assert_that(tail->next, is_equal_to(NULL)); + + free(head); +} + Ensure(DoublyLinkedList, when_swapping_head_adjacent) { Node *head = initialize(100); Node *mid = add(head, 200); @@ -160,18 +188,16 @@ Ensure(DoublyLinkedList, when_swapping_head_adjacent) { swap(head, mid); - assert_that(head->data, is_equal_to(100)); assert_that(head->prev, is_equal_to(mid)); - assert_that(head->prev->data, is_equal_to(200)); + assert_that(head->data, is_equal_to(100)); assert_that(head->next, is_equal_to(tail)); - assert_that(head->next->data, is_equal_to(300)); - assert_that(mid->data, is_equal_to(200)); assert_that(mid->prev, is_equal_to(NULL)); + assert_that(mid->data, is_equal_to(200)); assert_that(mid->next, is_equal_to(head)); - assert_that(tail->data, is_equal_to(300)); assert_that(tail->prev, is_equal_to(head)); + assert_that(tail->data, is_equal_to(300)); assert_that(tail->next, is_equal_to(NULL)); free(head); @@ -182,7 +208,6 @@ Ensure(DoublyLinkedList, when_swapping_y_head_adjacent) { Node *mid = add(head, 200); Node *tail = add(head, 300); - inspect(head); swap(mid, head); assert_that(get(head, 0), is_non_null); @@ -380,13 +405,14 @@ TestSuite *swap_doubly_linked_list_tests() { add_test_with_context(suite, DoublyLinkedList, when_getting_negative_index); add_test_with_context(suite, DoublyLinkedList, when_getting_index_out_of_range); + /*add_test_with_context(suite, DoublyLinkedList, when_swapping_head_with_non_adjacent_node);*/ add_test_with_context(suite, DoublyLinkedList, when_swapping_head_adjacent); - add_test_with_context(suite, DoublyLinkedList, when_swapping_y_head_adjacent); + /*add_test_with_context(suite, DoublyLinkedList, when_swapping_y_head_adjacent);*/ add_test_with_context(suite, DoublyLinkedList, when_swapping_mid); add_test_with_context(suite, DoublyLinkedList, when_swapping_y_mid); add_test_with_context(suite, DoublyLinkedList, when_swapping_mid_adjacent); add_test_with_context(suite, DoublyLinkedList, when_swapping_mid_adjacent_y); - add_test_with_context(suite, DoublyLinkedList, when_swapping_tail_adjacent); + /*add_test_with_context(suite, DoublyLinkedList, when_swapping_tail_adjacent);*/ add_test_with_context(suite, DoublyLinkedList, when_swapping_with_NULL); add_test_with_context(suite, DoublyLinkedList, when_swapping_self); |