char* test_split() { List* list_test = List_create(); List_push(list_test, test1); List_push(list_test, test2); List_push(list_test, test3); List_push(list_test, test4); List_push(list_test, test5); List_push(list_test, test6); ListNode* split1 = List_find(list_test, test3); ListNode* split2 = List_find(list_test, test5); mu_assert(split1->value == test3, "Ridi"); mu_assert(split2->value == test5, "Ridi"); List** splits = List_split(list_test, 2, split1, split2); mu_assert(splits[0]->first->value == list_test->first->value, "Ridi"); mu_assert(splits[0]->first->next->value == list_test->first->next->value, "Ridi"); mu_assert(splits[0]->last->value == list_test->first->next->next->value, "Ridi"); mu_assert(splits[1]->first->value == list_test->first->next->next->next->value, "Ridi"); mu_assert(splits[1]->last->value == list_test->first->next->next->next->next->value, "Ridi"); mu_assert(splits[2]->first->value == list_test->last->value, "Ridi"); return NULL; }
void List_modify(List* p,char ch) { Node *cur = List_find(p,ch); if(cur->data >= 'a' && cur->data <= 'z') cur->data=cur->data-32; else cur->data=cur->data+32; }
void Manager_Search() { char ch; Node *cur; Manager_Printall(); printf("검색 문자: "); scanf("%c",&ch); fflush(stdin); cur =List_find(&mm.li,ch); printf("검색결과: 주소값: %p, 데이터:%c, 다음 주소값: %p\n",cur,cur->data,cur->next); }
END_TEST START_TEST (test_List_accessWithNULL) { // test null arguments List_add (NULL, NULL); fail_unless( List_countIf (NULL, NULL) == 0 ); fail_unless( List_find (NULL, NULL, NULL) == NULL ); fail_unless( List_findIf (NULL, NULL) == NULL ); List_free(NULL); fail_unless( List_get (NULL, 0) == NULL ); List_prepend(NULL, NULL); fail_unless( List_remove (NULL, 0) == NULL ); fail_unless( List_size (NULL) == 0 ); }