void verify_testcases()
{
int i;
struct node *list1,*list2;
for(i=0;i<10;i++)
{
list1=create_linkedlist(test[i].input1);
list2=create_linkedlist(test[i].input2);
list1=add_linkedlist_method2(list1,list2);
if(compare(list1,test[i].output))
printf("\npassed");
else
printf("\nfailed");
}
}
void verify_testcases()
{
int i;
struct node *head2;
for(i=0;i<11;i++)
{
head2=create_linkedlist(testcases[i].input);
head2=arrange_displaced_lists(head2);
if(verify_output(head2,testcases[i].output))
printf("\nPASSED,");
else
printf("2FAILED,");
}
}
END_TEST
START_TEST(linkedlist_index)
{
#line 64
LinkedList *crap0 = create_linkedlist();
int i;
for(i = 0; i < 1000; i++){
append_to_linkedlist(crap0, (void *) &i, sizeof(int));
}
int a;
for( a = 0; a < 1000; a++){
if(a < 1000){
int *b = (int *) get_index_data_linkedlist(crap0, a);
ck_assert(a == *b);
}
}
free_linkedlist(crap0);
}
