void test_linkedList_remove(void) { CU_ASSERT_EQUAL(linkedList_size(list), 0); linkedList_addElement(list, "element"); CU_ASSERT_EQUAL(linkedList_size(list), 1); linkedList_removeElement(list, "element"); CU_ASSERT_EQUAL(linkedList_size(list), 0); }
// this function prints the contents of a linked list void printLinkedList(struct LinkedList *list){ struct Link *lnk; if(!linkedList_size(list)){ printf(" EMPTY\n"); } else{ lnk = list->frontSentinel->next; while(lnk != list->backSentinel){ printf(" [%d]", lnk->value); lnk = lnk->next; } printf("\n"); } }
int linkedList_isEmpty(linkedList_t *list) { return linkedList_size(list) == 0; }
void test_linkedList_create(void) { CU_ASSERT_PTR_NOT_NULL_FATAL(list); CU_ASSERT_EQUAL(linkedList_size(list), 0); }