main() {
char *p = "harsh";
head = (Node*)malloc(sizeof(Node));
head->next = NULL;
insertToList(&head,p, 5, 0);
insertToList(&head,"abcdef",6,7);
insertToList(&head,"harshitha",9,13);
insertToList(&head,"hhh",3,1);
// printAggr(head);
//removeFromList(&head,7);
printf("\n printing data");
printAggr(head);
freeList(&head);
}
int test(){
T t ;
t.x =1;
t.y =2;
T t1 = {3,4};
Find f =&find;
ListPtr list = initList(NULL,NULL);
insertToList(list, &t, sizeof(t));
insertToList(list, &t1, sizeof(t1));
int a =1;
void*args[0];
args[0]=&a;
T* s = getFromList(list,f,args);
//printf("%d %d\n", s->y, t.y);
insertToList(list, &t1,sizeof(t1));
insertToList(list, &t1,sizeof(t1));
insertToList(list, &t1,sizeof(t1));
insertToList(list, &t1,sizeof(t1));
insertToList(list, &t1,sizeof(t1));
a = 1;
T* r = getFromList(list,f,args);
printf("%d\n", r->y);
printf("count %d\n", getCount(list));
displayList(list,display,4);
printf("remove %d\n",removeFromList(list,f,args));
displayList(list,display,4);
r = getFromList(list,f,args);
//printf("%d\n", r);
assert(r==NULL);
displayList(list,display,4);
t1.y=10;
a = 3;
int count = setToList(list,&t1,sizeof(t1),f,args);
printf("update %d\n", count);
displayList(list,display,4);
ListPtr ptr = list;
int i = 0;
do{
void * data = NULL;
if(i>4){
data= preFromList(&ptr,list,f,args);
}else{
data = nextFromList(&ptr,list,f,args);
}
if(ptr != list){
display(data,ptr->id);
printf("\n");
}
i++;
}while(ptr!=list);
//displayList(list,display,4);
int num = freeList(&list);
printf("%d\n", num);
}
