Reverse a generated linked list and print the before and after

1 files changed, 0 insertions, 398 deletions

diff --git a/src/01/05/doubly_linked_list_test.c b/src/01/05/doubly_linked_list_test.c
index 3ef4c29..e674917 100644
--- a/src/01/05/doubly_linked_list_test.c
+++ b/src/01/05/doubly_linked_list_test.c
@@ -5,404 +5,6 @@ Describe(DoublyLinkedList);
 BeforeEach(DoublyLinkedList){ }
 AfterEach(DoublyLinkedList){ }
 
-Ensure(DoublyLinkedList, when_getting_head) {
-  Node *head = initialize(100);
-  assert_that(get(head, 0), is_equal_to(head));
-  free(head);
-}
-
-Ensure(DoublyLinkedList, when_getting_mid) {
-  Node *head = initialize(100);
-
-  Node *mid = add(head, 200);
-  add(head, 300);
-
-  assert_that(get(head, 1), is_equal_to(mid));
-  assert_that(get(head, 1)->data, is_equal_to(200));
-
-  free(head);
-}
-
-Ensure(DoublyLinkedList, when_getting_tail) {
-  Node *head = initialize(100);
-
-  add(head, 200);
-  Node *tail = add(head, 300);
-
-  assert_that(get(head, 2), is_equal_to(tail));
-
-  free(head);
-}
-
-Ensure(DoublyLinkedList, when_getting_from_empty_list) {
-  assert_that(get(NULL, 2), is_equal_to(NULL));
-}
-
-Ensure(DoublyLinkedList, when_getting_negative_index) {
-  Node *head = initialize(100);
-
-  assert_that(get(head, -1), is_equal_to(NULL));
-
-  free(head);
-}
-
-Ensure(DoublyLinkedList, when_getting_index_out_of_range) {
-  Node *head = initialize(100);
-
-  assert_that(get(head, 1), is_equal_to(NULL));
-
-  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_with_non_adjacent_node_inverted) {
-  Node *head = initialize(100);
-  Node *mid1 = add(head, 200);
-  Node *mid2 = add(head, 300);
-  Node *tail = add(head, 400);
-
-  swap(mid2, head);
-
-  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);
-  Node *tail = add(head, 300);
-
-  swap(head, mid);
-
-  assert_that(head->prev, is_equal_to(mid));
-  assert_that(head->data, is_equal_to(100));
-  assert_that(head->next, is_equal_to(tail));
-
-  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->prev, is_equal_to(head));
-  assert_that(tail->data, is_equal_to(300));
-  assert_that(tail->next, is_equal_to(NULL));
-
-  free(head);
-}
-
-Ensure(DoublyLinkedList, when_swapping_head_adjacent_inverted) {
-  Node *head = initialize(100);
-  Node *mid = add(head, 200);
-  Node *tail = add(head, 300);
-
-  swap(mid, head);
-
-  assert_that(head->prev, is_equal_to(mid));
-  assert_that(head->data, is_equal_to(100));
-  assert_that(head->next, is_equal_to(tail));
-
-  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->prev, is_equal_to(head));
-  assert_that(tail->data, is_equal_to(300));
-  assert_that(tail->next, is_equal_to(NULL));
-
-  free(head);
-}
-
-Ensure(DoublyLinkedList, when_swapping_mid) {
-  Node *head = initialize(100);
-  Node *mid1 = add(head, 200);
-  Node *mid2 = add(head, 300);
-  Node *mid3 = add(head, 400);
-  Node *tail = add(head, 500);
-
-  swap(mid1, mid3);
-
-  assert_that(head->prev, is_equal_to(NULL));
-  assert_that(head->data, is_equal_to(100));
-  assert_that(head->next, is_equal_to(mid3));
-
-  assert_that(mid1->prev, is_equal_to(mid2));
-  assert_that(mid1->data, is_equal_to(200));
-  assert_that(mid1->next, is_equal_to(tail));
-
-  assert_that(mid2->prev, is_equal_to(mid3));
-  assert_that(mid2->data, is_equal_to(300));
-  assert_that(mid2->next, is_equal_to(mid1));
-
-  assert_that(mid3->prev, is_equal_to(head));
-  assert_that(mid3->data, is_equal_to(400));
-  assert_that(mid3->next, is_equal_to(mid2));
-
-  assert_that(tail->prev, is_equal_to(mid1));
-  assert_that(tail->data, is_equal_to(500));
-  assert_that(tail->next, is_equal_to(NULL));
-
-  free(head);
-}
-
-Ensure(DoublyLinkedList, when_swapping_y_mid) {
-  Node *head = initialize(100);
-  Node *mid1 = add(head, 200);
-  Node *mid2 = add(head, 300);
-  Node *mid3 = add(head, 400);
-  Node *tail = add(head, 500);
-
-  swap(mid3, mid1);
-
-  assert_that(head->prev, is_equal_to(NULL));
-  assert_that(head->data, is_equal_to(100));
-  assert_that(head->next, is_equal_to(mid3));
-
-  assert_that(mid1->prev, is_equal_to(mid2));
-  assert_that(mid1->data, is_equal_to(200));
-  assert_that(mid1->next, is_equal_to(tail));
-
-  assert_that(mid2->prev, is_equal_to(mid3));
-  assert_that(mid2->data, is_equal_to(300));
-  assert_that(mid2->next, is_equal_to(mid1));
-
-  assert_that(mid3->prev, is_equal_to(head));
-  assert_that(mid3->data, is_equal_to(400));
-  assert_that(mid3->next, is_equal_to(mid2));
-
-  assert_that(tail->prev, is_equal_to(mid1));
-  assert_that(tail->data, is_equal_to(500));
-  assert_that(tail->next, is_equal_to(NULL));
-
-  free(head);
-}
-
-Ensure(DoublyLinkedList, when_swapping_mid_adjacent) {
-  Node *head = initialize(100);
-  Node *mid1 = add(head, 200);
-  Node *mid2 = add(head, 300);
-  Node *tail = add(head, 400);
-
-  swap(mid1, mid2);
-
-  assert_that(head->prev, is_equal_to(NULL));
-  assert_that(head->data, is_equal_to(100));
-  assert_that(head->next, is_equal_to(mid2));
-
-  assert_that(mid1->prev, is_equal_to(mid2));
-  assert_that(mid1->data, is_equal_to(200));
-  assert_that(mid1->next, is_equal_to(tail));
-
-  assert_that(mid2->prev, is_equal_to(head));
-  assert_that(mid2->data, is_equal_to(300));
-  assert_that(mid2->next, is_equal_to(mid1));
-
-  assert_that(tail->prev, is_equal_to(mid1));
-  assert_that(tail->data, is_equal_to(400));
-  assert_that(tail->next, is_equal_to(NULL));
-
-  free(head);
-}
-
-Ensure(DoublyLinkedList, when_swapping_mid_adjacent_y) {
-  Node *head = initialize(100);
-  Node *mid1 = add(head, 200);
-  Node *mid2 = add(head, 300);
-  Node *tail = add(head, 400);
-
-  swap(mid2, mid1);
-
-  assert_that(head->prev, is_equal_to(NULL));
-  assert_that(head->data, is_equal_to(100));
-  assert_that(head->next, is_equal_to(mid2));
-
-  assert_that(mid1->prev, is_equal_to(mid2));
-  assert_that(mid1->data, is_equal_to(200));
-  assert_that(mid1->next, is_equal_to(tail));
-
-  assert_that(mid2->prev, is_equal_to(head));
-  assert_that(mid2->data, is_equal_to(300));
-  assert_that(mid2->next, is_equal_to(mid1));
-
-  assert_that(tail->prev, is_equal_to(mid1));
-  assert_that(tail->data, is_equal_to(400));
-  assert_that(tail->next, is_equal_to(NULL));
-
-  free(head);
-}
-
-Ensure(DoublyLinkedList, when_swapping_tail_adjacent) {
-  Node *head = initialize(100);
-  Node *mid = add(head, 200);
-  Node *tail = add(head, 300);
-
-  swap(mid, tail);
-
-  assert_that(head->prev, is_equal_to(NULL));
-  assert_that(head->data, is_equal_to(100));
-  assert_that(head->next, is_equal_to(tail));
-
-  assert_that(mid->prev, is_equal_to(tail));
-  assert_that(mid->data, is_equal_to(200));
-  assert_that(mid->next, is_equal_to(NULL));
-
-  assert_that(tail->prev, is_equal_to(head));
-  assert_that(tail->data, is_equal_to(300));
-  assert_that(tail->next, is_equal_to(mid));
-
-  free(head);
-}
-
-Ensure(DoublyLinkedList, when_swapping_tail_adjacent_inverted) {
-  Node *head = initialize(100);
-  Node *mid = add(head, 200);
-  Node *tail = add(head, 300);
-
-  swap(tail, mid);
-
-  assert_that(head->prev, is_equal_to(NULL));
-  assert_that(head->data, is_equal_to(100));
-  assert_that(head->next, is_equal_to(tail));
-
-  assert_that(mid->prev, is_equal_to(tail));
-  assert_that(mid->data, is_equal_to(200));
-  assert_that(mid->next, is_equal_to(NULL));
-
-  assert_that(tail->prev, is_equal_to(head));
-  assert_that(tail->data, is_equal_to(300));
-  assert_that(tail->next, is_equal_to(mid));
-
-  free(head);
-}
-
-Ensure(DoublyLinkedList, when_swapping_tail_with_non_adjacent_node) {
-  Node *head = initialize(100);
-  Node *mid1 = add(head, 200);
-  Node *mid2 = add(head, 300);
-  Node *tail = add(head, 400);
-
-  swap(mid1, tail);
-
-  assert_that(head->prev, is_equal_to(NULL));
-  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(NULL));
-
-  assert_that(mid2->prev, is_equal_to(tail));
-  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(mid2));
-
-  free(head);
-}
-
-Ensure(DoublyLinkedList, when_swapping_tail_with_non_adjacent_node_inverted) {
-  Node *head = initialize(100);
-  Node *mid1 = add(head, 200);
-  Node *mid2 = add(head, 300);
-  Node *tail = add(head, 400);
-
-  swap(tail, mid1);
-
-  assert_that(head->prev, is_equal_to(NULL));
-  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(NULL));
-
-  assert_that(mid2->prev, is_equal_to(tail));
-  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(mid2));
-
-  free(head);
-}
-
-Ensure(DoublyLinkedList, when_swapping_with_NULL) {
-  Node *head = initialize(100);
-  Node *mid = add(head, 200);
-  Node *tail = add(head, 300);
-
-  swap(mid, NULL);
-
-  assert_that(head->prev, is_equal_to(NULL));
-  assert_that(head->data, is_equal_to(100));
-  assert_that(head->next, is_equal_to(mid));
-
-  assert_that(mid->prev, is_equal_to(head));
-  assert_that(mid->data, is_equal_to(200));
-  assert_that(mid->next, is_equal_to(tail));
-
-  assert_that(tail->prev, is_equal_to(mid));
-  assert_that(tail->data, is_equal_to(300));
-  assert_that(tail->next, is_equal_to(NULL));
-
-  free(head);
-}
-
-Ensure(DoublyLinkedList, when_swapping_self) {
-  Node *head = initialize(100);
-  Node *mid = add(head, 200);
-  Node *tail = add(head, 300);
-
-  swap(mid, mid);
-
-  assert_that(head->prev, is_equal_to(NULL));
-  assert_that(head->data, is_equal_to(100));
-
-  free(head);
-}
-
 Ensure(DoublyLinkedList, when_reversing_a_short_list) {
   Node *head = initialize(100);
   Node *mid = add(head, 200);