int main(void)
{
IntNode *head;
/* Tests for Exercise 1. */
printf("=== Testing remove_duplicates ===\n\n");
printf("Test 1\n");
printf("Building linked list: ");
head = NULL;
head = intnode_construct(5, head);
head = intnode_construct(3, head);
head = intnode_construct(3, head);
head = intnode_construct(4, head);
head = intnode_construct(4, head);
head = intnode_construct(4, head);
head = intnode_construct(1, head);
head = intnode_construct(3, head);
head = intnode_construct(3, head);
print_linked_list(head);
printf("\n");
printf("Calling remove_duplicates\n");
remove_duplicates(head);
printf("Expected result: 3 -> 1 -> 4 -> 3 -> 5\n");
printf(" Actual result: ");
print_linked_list(head);
printf("\n\n");
free_linked_list(head);
printf("Test 2\n");
printf("Building linked list: ");
head = NULL;
head = intnode_construct(5, head);
head = intnode_construct(5, head);
head = intnode_construct(5, head);
head = intnode_construct(5, head);
print_linked_list(head);
printf("\n");
printf("Calling remove_duplicates\n");
remove_duplicates(head);
printf("Expected result: 5\n");
printf(" Actual result: ");
print_linked_list(head);
printf("\n\n");
free_linked_list(head);
printf("Test 3\n");
printf("Building linked list: ");
head = NULL;
head = intnode_construct(2, head);
head = intnode_construct(2, head);
print_linked_list(head);
printf("\n");
printf("Calling remove_duplicates\n");
remove_duplicates(head);
printf("Expected result: 2\n");
printf(" Actual result: ");
print_linked_list(head);
printf("\n\n");
free_linked_list(head);
printf("Test 4\n");
printf("Building linked list: ");
head = NULL;
head = intnode_construct(4, head);
head = intnode_construct(3, head);
head = intnode_construct(2, head);
head = intnode_construct(1, head);
print_linked_list(head);
printf("\n");
printf("Calling remove_duplicates\n");
remove_duplicates(head);
printf("Expected result: 1 -> 2 -> 3 -> 4\n");
printf(" Actual result: ");
print_linked_list(head);
printf("\n\n");
free_linked_list(head);
printf("Test 5\n");
printf("Building linked list: ");
head = NULL;
head = intnode_construct(4, head);
print_linked_list(head);
printf("\n");
printf("Calling remove_duplicates\n");
remove_duplicates(head);
printf("Expected result: 4\n");
printf(" Actual result: ");
print_linked_list(head);
printf("\n\n");
free_linked_list(head);
/* Tests for Exercise 2. */
printf("=== Testing reverse ===\n\n");
printf("Test 1\n");
printf("Building linked list: ");
head = NULL;
head = intnode_construct(4, head);
head = intnode_construct(3, head);
head = intnode_construct(2, head);
head = intnode_construct(1, head);
print_linked_list(head);
printf("\n");
printf("Calling reverse\n");
head = reverse(head);
printf("Expected result: 4 -> 3 -> 2 -> 1\n");
printf(" Actual result: ");
print_linked_list(head);
printf("\n\n");
free_linked_list(head);
printf("Test 2\n");
printf("Building linked list: ");
head = NULL;
head = intnode_construct(2, head);
head = intnode_construct(1, head);
print_linked_list(head);
printf("\n");
printf("Calling reverse\n");
head = reverse(head);
printf("Expected result: 2 -> 1\n");
printf(" Actual result: ");
print_linked_list(head);
printf("\n\n");
free_linked_list(head);
printf("Test 3\n");
printf("Building linked list: ");
head = NULL;
head = intnode_construct(2, head);
print_linked_list(head);
printf("\n");
printf("Calling reverse\n");
head = reverse(head);
printf("Expected result: 2\n");
printf(" Actual result: ");
print_linked_list(head);
printf("\n\n");
free_linked_list(head);
printf("Test 4\n");
printf("Building linked list: ");
head = NULL;
print_linked_list(head);
printf(" (head == NULL)\n");
printf("Calling reverse\n");
head = reverse(head);
printf("Expected result: empty list\n");
printf(" Actual result: ");
print_linked_list(head);
printf("\n\n");
free_linked_list(head);
}
int main(void)
{
IntNode *head = NULL; // An empty linked list.
IntNode *empty = NULL; // Another empty linked list.
/* Tests for Exercise 1. */
printf("Building linked list 1 -> 1 -> 2 -> 3 -> 3 -> 4 -> 5 -> 5 -> 5\n\n");
head = NULL;
head = intnode_construct(5, head);
head = intnode_construct(5, head);
head = intnode_construct(5, head);
head = intnode_construct(4, head);
head = intnode_construct(3, head);
head = intnode_construct(3, head);
head = intnode_construct(2, head);
head = intnode_construct(1, head);
head = intnode_construct(1, head);
// print_linked_list(head);
printf("=== Testing count ===\n\n");
int occurrences;
printf("Calling count with list: ");
print_linked_list(empty);
printf("\nCounting 1's.\n");
occurrences = count(empty, 1);
printf("Expected result: 0\n");
printf("Actual result: %d\n\n", occurrences);
printf("Calling count with list: ");
print_linked_list(empty);
printf("\nCounting 7's.\n");
occurrences = count(empty, 7);
printf("Expected result: 0\n");
printf("Actual result: %d\n\n", occurrences);
printf("Calling count with list: ");
print_linked_list(head);
printf("\nCounting 1's.\n");
occurrences = count(head, 1);
printf("Expected result: 2\n");
printf("Actual result: %d\n\n", occurrences);
printf("Calling count with list: ");
print_linked_list(head);
printf("\nCounting 2's.\n");
occurrences = count(head, 2);
printf("Expected result: 1\n");
printf("Actual result: %d\n\n", occurrences);
printf("Calling count with list: ");
print_linked_list(head);
printf("\nCounting 3's.\n");
occurrences = count(head, 3);
printf("Expected result: 2\n");
printf("Actual result: %d\n\n", occurrences);
printf("Calling count with list: ");
print_linked_list(head);
printf("\nCounting 4's.\n");
occurrences = count(head, 4);
printf("Expected result: 1\n");
printf("Actual result: %d\n\n", occurrences);
printf("Calling count with list: ");
print_linked_list(head);
printf("\nCounting 5's.\n");
occurrences = count(head, 5);
printf("Expected result: 3\n");
printf("Actual result: %d\n\n", occurrences);
printf("Calling count with list: ");
print_linked_list(head);
printf("\nCounting 7's.\n");
occurrences = count(head, 7);
printf("Expected result: 0\n");
printf("Actual result: %d\n\n", occurrences);
/* Tests for Exercise 2. */
printf("=== Testing index ===\n\n");
int posn;
printf("Calling index with list: ");
print_linked_list(empty);
printf("\nSearching for 1.\n");
posn = index(empty, 1);
printf("Expected result: -1\n");
printf("Actual result: %d\n\n", posn);
printf("Calling index with list: ");
print_linked_list(head);
printf("\nSearching for 1.\n");
posn = index(head, 1);
printf("Expected result: 0\n");
printf("Actual result: %d\n\n", posn);
printf("Calling index with list: ");
print_linked_list(head);
printf("\nSearching for 2.\n");
posn = index(head, 2);
printf("Expected result: 2\n");
printf("Actual result: %d\n\n", posn);
printf("Calling index with list: ");
print_linked_list(head);
printf("\nSearching for 3.\n");
posn = index(head, 3);
printf("Expected result: 3\n");
printf("Actual result: %d\n\n", posn);
printf("Calling index with list: ");
print_linked_list(head);
printf("\nSearching for 4.\n");
posn = index(head, 4);
printf("Expected result: 5\n");
printf("Actual result: %d\n\n", posn);
printf("Calling index with list: ");
print_linked_list(head);
printf("\nSearching for 5.\n");
posn = index(head, 5);
printf("Expected result: 6\n");
printf("Actual result: %d\n\n", posn);
printf("Calling index with list: ");
print_linked_list(head);
printf("\nSearching for 7.\n");
posn = index(head, 7);
printf("Expected result: -1\n");
printf("Actual result: %d\n\n", posn);
/* Tests for Exercise 3. */
printf("=== Testing fetch ===\n\n");
/* We can't test these cases, because they should cause the function
* to terminate via assert.
*
* 1. The list is empty; terminate via assert.
* 2. index < 0 or index >= # of nodes; terminate via assert.
*/
int value;
printf("Calling fetch with list: ");
print_linked_list(head);
printf("\nFetching value at index 0.\n");
value = fetch(head, 0);
printf("Expected result: 1\n");
printf("Actual result: %d\n\n", value);
printf("Calling fetch with list: ");
print_linked_list(head);
printf("\nFetching value at index 1.\n");
value = fetch(head, 1);
printf("Expected result: 1\n");
printf("Actual result: %d\n\n", value);
printf("Calling fetch with list: ");
print_linked_list(head);
printf("\nFetching value at index 2.\n");
value = fetch(head, 2);
printf("Expected result: 2\n");
printf("Actual result: %d\n\n", value);
printf("Calling fetch with list: ");
print_linked_list(head);
printf("\nFetching value at index 3.\n");
value = fetch(head, 3);
printf("Expected result: 3\n");
printf("Actual result: %d\n\n", value);
printf("Calling fetch with list: ");
print_linked_list(head);
printf("\nFetching value at index 4.\n");
value = fetch(head, 4);
printf("Expected result: 3\n");
printf("Actual result: %d\n\n", value);
printf("Calling fetch with list: ");
print_linked_list(head);
printf("\nFetching value at index 5.\n");
value = fetch(head, 5);
printf("Expected result: 4\n");
printf("Actual result: %d\n\n", value);
printf("Calling fetch with list: ");
print_linked_list(head);
printf("\nFetching value at index 6.\n");
value = fetch(head, 6);
printf("Expected result: 5\n");
printf("Actual result: %d\n\n", value);
printf("Calling fetch with list: ");
print_linked_list(head);
printf("\nFetching value at index 7.\n");
value = fetch(head, 7);
printf("Expected result: 5\n");
printf("Actual result: %d\n\n", value);
printf("Calling fetch with list: ");
print_linked_list(head);
printf("\nFetching value at index 8.\n");
value = fetch(head, 8);
printf("Expected result: 5\n");
printf("Actual result: %d\n\n", value);
/* Tests for Exercise 4. */
printf("=== Testing insert ===\n\n");
IntNode *list1 = NULL; // An empty linked list.
printf("Calling insert with list: ");
print_linked_list(list1);
printf("\nInserting 10 at index 0.\n");
list1 = insert(list1, 0, 10);
printf("Expected list:\t10\n");
printf("Actual list:\t");
print_linked_list(list1);
printf("\n\n");
printf("Calling insert with list: ");
print_linked_list(list1);
printf("\nInserting 20 value at index 0.\n");
list1 = insert(list1, 0, 20);
printf("Expected list:\t20 -> 10\n");
printf("Actual list:\t");
print_linked_list(list1);
printf("\n\n");
printf("Calling insert with list: ");
print_linked_list(list1);
printf("\nInserting 30 at index 1.\n");
list1 = insert(list1, 1, 30);
printf("Expected list:\t20 -> 30 -> 10\n");
printf("Actual list:\t");
print_linked_list(list1);
printf("\n\n");
printf("Calling insert with list: ");
print_linked_list(list1);
printf("\nInserting 40 at index 3.\n");
list1 = insert(list1, 3, 40);
printf("Expected list:\t20 -> 30 -> 10 -> 40\n");
printf("Actual list:\t");
print_linked_list(list1);
printf("\n\n");
}
int main(void)
{
IntNode *head = NULL; // An empty linked list.
IntNode *empty = NULL; // Another empty linked list.
printf("=== Testing insert_front ===\n\n");
printf("Calling insert_front with list: ");
print_linked_list(head);
printf("\nInserting 3.\n");
head = insert_front(head, 3);
printf("Expected list: 3\n");
printf("Actual list: ");
print_linked_list(head);
printf("\n\n");
printf("Calling insert_front with list: ");
print_linked_list(head);
printf("\nInserting 2.\n");
head = insert_front(head, 2);
printf("Expected list: 2 -> 3\n");
printf("Actual list: ");
print_linked_list(head);
printf("\n\n");
printf("Calling insert_front with list: ");
print_linked_list(head);
printf("\nInserting 1.\n");
head = insert_front(head, 1);
printf("Expected list: 1 -> 2 -> 3\n");
printf("Actual list: ");
print_linked_list(head);
printf("\n\n");
printf("=== Testing contains ===\n\n");
_Bool found;
printf("Calling contains with list: ");
print_linked_list(empty);
printf("\nSearching for 1.\n");
found = contains(empty, 1);
printf("Expected result: false\n");
printf("Actual result: ");
print_boolean(found);
printf("\n\n");
printf("Calling contains with list: ");
print_linked_list(head);
printf("\nSearching for 1.\n");
found = contains(head, 1);
printf("Expected result: true\n");
printf("Actual result: ");
print_boolean(found);
printf("\n\n");
printf("Calling contains with list: ");
print_linked_list(head);
printf("\nSearching for 3.\n");
found = contains(head, 3);
printf("Expected result: true\n");
printf("Actual result: ");
print_boolean(found);
printf("\n\n");
printf("Calling contains with list: ");
print_linked_list(head);
printf("\nSearching for 6.\n");
found = contains(head, 6);
printf("Expected result: false\n");
printf("Actual result: ");
print_boolean(found);
printf("\n\n");
printf("=== Testing append_rear ===\n\n");
printf("Calling append_rear with list: ");
print_linked_list(head);
printf("\nAppending 4.\n");
head = append_rear(head, 4);
printf("Expected list: 1 -> 2 -> 3 -> 4\n");
printf("Actual list: ");
print_linked_list(head);
printf("\n\n");
printf("=== Testing remove_first ===\n\n");
printf("Calling remove_first with list: ");
print_linked_list(head);
head = remove_first(head);
printf("\nExpected list: 2 -> 3 -> 4\n");
printf("Actual list: ");
print_linked_list(head);
printf("\n\n");
printf("=== Testing remove_last ===\n\n");
printf("Calling remove_last with list: ");
print_linked_list(head);
head = remove_last(head);
printf("\nExpected list: 2 -> 3\n");
printf("Actual list: ");
print_linked_list(head);
printf("\n\n");
printf("Calling remove_last with list: ");
print_linked_list(head);
head = remove_last(head);
printf("\nExpected list: 2\n");
printf("Actual list: ");
print_linked_list(head);
printf("\n\n");
printf("Calling remove_last with list: ");
print_linked_list(head);
head = remove_last(head);
printf("\nExpected list: empty list\n");
printf("Actual list: ");
print_linked_list(head);
printf("\n\n");
/* Tests for Exercise 1. */
printf("Building linked list 1 -> 1 -> 2 -> 3 -> 3 -> 4 -> 5 -> 5 -> 5\n\n");
head = NULL;
head = intnode_construct(5, head);
head = intnode_construct(5, head);
head = intnode_construct(5, head);
head = intnode_construct(4, head);
head = intnode_construct(3, head);
head = intnode_construct(3, head);
head = intnode_construct(2, head);
head = intnode_construct(1, head);
head = intnode_construct(1, head);
// print_linked_list(head);
printf("=== Testing count ===\n\n");
int occurrences;
printf("Calling count with list: ");
print_linked_list(empty);
printf("\nCounting 1's.\n");
occurrences = count(empty, 1);
printf("Expected result: 0\n");
printf("Actual result: %d\n\n", occurrences);
printf("Calling count with list: ");
print_linked_list(empty);
printf("\nCounting 7's.\n");
occurrences = count(empty, 7);
printf("Expected result: 0\n");
printf("Actual result: %d\n\n", occurrences);
printf("Calling count with list: ");
print_linked_list(head);
printf("\nCounting 1's.\n");
occurrences = count(head, 1);
printf("Expected result: 2\n");
printf("Actual result: %d\n\n", occurrences);
printf("Calling count with list: ");
print_linked_list(head);
printf("\nCounting 2's.\n");
occurrences = count(head, 2);
printf("Expected result: 1\n");
printf("Actual result: %d\n\n", occurrences);
printf("Calling count with list: ");
print_linked_list(head);
printf("\nCounting 3's.\n");
occurrences = count(head, 3);
printf("Expected result: 2\n");
printf("Actual result: %d\n\n", occurrences);
printf("Calling count with list: ");
print_linked_list(head);
printf("\nCounting 4's.\n");
occurrences = count(head, 4);
printf("Expected result: 1\n");
printf("Actual result: %d\n\n", occurrences);
printf("Calling count with list: ");
print_linked_list(head);
printf("\nCounting 5's.\n");
occurrences = count(head, 5);
printf("Expected result: 3\n");
printf("Actual result: %d\n\n", occurrences);
printf("Calling count with list: ");
print_linked_list(head);
printf("\nCounting 7's.\n");
occurrences = count(head, 7);
printf("Expected result: 0\n");
printf("Actual result: %d\n\n", occurrences);
/* Tests for Exercise 2. */
printf("=== Testing index ===\n\n");
int posn;
printf("Calling index with list: ");
print_linked_list(empty);
printf("\nSearching for 1.\n");
posn = index(empty, 1);
printf("Expected result: -1\n");
printf("Actual result: %d\n\n", posn);
printf("Calling index with list: ");
print_linked_list(head);
printf("\nSearching for 1.\n");
posn = index(head, 1);
printf("Expected result: 0\n");
printf("Actual result: %d\n\n", posn);
printf("Calling index with list: ");
print_linked_list(head);
printf("\nSearching for 2.\n");
posn = index(head, 2);
printf("Expected result: 2\n");
printf("Actual result: %d\n\n", posn);
printf("Calling index with list: ");
print_linked_list(head);
printf("\nSearching for 3.\n");
posn = index(head, 3);
printf("Expected result: 3\n");
printf("Actual result: %d\n\n", posn);
printf("Calling index with list: ");
print_linked_list(head);
printf("\nSearching for 4.\n");
posn = index(head, 4);
printf("Expected result: 5\n");
printf("Actual result: %d\n\n", posn);
printf("Calling index with list: ");
print_linked_list(head);
printf("\nSearching for 5.\n");
posn = index(head, 5);
printf("Expected result: 6\n");
printf("Actual result: %d\n\n", posn);
printf("Calling index with list: ");
print_linked_list(head);
printf("\nSearching for 7.\n");
posn = index(head, 7);
printf("Expected result: -1\n");
printf("Actual result: %d\n\n", posn);
/* Tests for Exercise 31. */
printf("=== Testing fetch ===\n\n");
/* We can't test these cases, because they should cause the function
* to terminate via assert.
*
* 1. The list is empty; terminate via assert.
* 2. index < 0 or index >= # of nodes; terminate via assert.
*/
int value;
printf("Calling fetch with list: ");
print_linked_list(head);
printf("\nFetching value at index 0.\n");
value = fetch(head, 0);
printf("Expected result: 1\n");
printf("Actual result: %d\n\n", value);
printf("Calling fetch with list: ");
print_linked_list(head);
printf("\nFetching value at index 1.\n");
value = fetch(head, 1);
printf("Expected result: 1\n");
printf("Actual result: %d\n\n", value);
printf("Calling fetch with list: ");
print_linked_list(head);
printf("\nFetching value at index 2.\n");
value = fetch(head, 2);
printf("Expected result: 2\n");
printf("Actual result: %d\n\n", value);
printf("Calling fetch with list: ");
print_linked_list(head);
printf("\nFetching value at index 3.\n");
value = fetch(head, 3);
printf("Expected result: 3\n");
printf("Actual result: %d\n\n", value);
printf("Calling fetch with list: ");
print_linked_list(head);
printf("\nFetching value at index 4.\n");
value = fetch(head, 4);
printf("Expected result: 3\n");
printf("Actual result: %d\n\n", value);
printf("Calling fetch with list: ");
print_linked_list(head);
printf("\nFetching value at index 5.\n");
value = fetch(head, 5);
printf("Expected result: 4\n");
printf("Actual result: %d\n\n", value);
printf("Calling fetch with list: ");
print_linked_list(head);
printf("\nFetching value at index 6.\n");
value = fetch(head, 6);
printf("Expected result: 5\n");
printf("Actual result: %d\n\n", value);
printf("Calling fetch with list: ");
print_linked_list(head);
printf("\nFetching value at index 7.\n");
value = fetch(head, 7);
printf("Expected result: 5\n");
printf("Actual result: %d\n\n", value);
printf("Calling fetch with list: ");
print_linked_list(head);
printf("\nFetching value at index 8.\n");
value = fetch(head, 8);
printf("Expected result: 5\n");
printf("Actual result: %d\n\n", value);
/* Tests for Exercise 4. */
printf("Building linked list 1 -> 2 -> 3 -> 4\n\n");
IntNode *list = NULL;
list = intnode_construct(4, list);
list = intnode_construct(3, list);
list = intnode_construct(2, list);
list = intnode_construct(1, list);
printf("=== Testing remove_last_one_pointer ===\n\n");
printf("Calling remove_last_one_pointer with list: ");
print_linked_list(list);
list = remove_last_one_pointer(list);
printf("\nExpected list: 1 -> 2 -> 3\n");
printf("Actual list: ");
print_linked_list(list);
printf("\n\n");
printf("Calling remove_last_one_pointer with list: ");
print_linked_list(list);
list = remove_last_one_pointer(list);
printf("\nExpected list: 1 -> 2\n");
printf("Actual list: ");
print_linked_list(list);
printf("\n\n");
printf("Calling remove_last_one_pointer with list: ");
print_linked_list(list);
list = remove_last_one_pointer(list);
printf("\nExpected list: 1\n");
printf("Actual list: ");
print_linked_list(list);
printf("\n\n");
printf("Calling remove_last_one_pointer with list: ");
print_linked_list(list);
list = remove_last_one_pointer(list);
printf("\nExpected list: empty list\n");
printf("Actual list: ");
print_linked_list(list);
printf("\n\n");
}
