int
main(int argc, char *argv[])
{
#ifndef _LIST_
/*双链表实现*/
dlist dl;
dl = init_dlist(dl);
rand_dlist(dl, SIZE, MAX_NUM);
printf("this is doubly list.\n");
print_dlist(dl);
exchange_dlnode(dl->next->next, dl);
print_dlist(dl);
#else
/*单链表实现*/
list l;
l = init_list(l);
rand_list(l, SIZE, MAX_NUM);
printf("this is single list.\n");
print_list(l);
exchange_lnode(l->next->next, l);
print_list(l);
#endif
return 0;
}
int test_quick_sort() {
struct dlist* list_to_sort = NULL;
list_to_sort = generate_dlist();
print_dlist(list_to_sort);
//quick_sort(list_to_sort);
struct dlist* tmp = get_element_by_index(list_to_sort, 1);
printf("5 element - %d %p\n", tmp->data, tmp);
print_dlist(list_to_sort);
free_dlist(list_to_sort);
return 0;
}
int
main (int argc,
char *argv[])
{
dnode *t;
init_dlist ();
ordered_insert (10);
ordered_insert (5);
ordered_insert (8);
ordered_insert (3);
ordered_insert (1);
ordered_insert (7);
ordered_insert (8);
printf ("\nInitial Linked list is ");
print_dlist (head->next);
printf ("\nFinding 4 is %ssuccessful", find_dnode (4) == tail ? "un" : "");
t = find_dnode (5);
printf ("\nFinding 5 is %ssuccessful", t == tail ? "un" : "");
printf ("\nInserting 7 before 5");
insert_dnode_ptr (7, t);
print_dlist (head->next);
t = find_dnode (3);
printf ("\nDeleting 3 ");
delete_dnode_ptr (t);
print_dlist (head->next);
printf ("\nInserting node 2 before 10");
insert_dnode (2, 10);
print_dlist (head->next);
printf ("\nDeleting node 2");
if (!delete_dnode (2))
printf ("\n deleting 2 is unsuccessful");
print_dlist (head->next);
printf ("\nDeleting node 1");
delete_dnode (1);
print_dlist (head->next);
printf ("\nInserting 15 at first");
insert_dnode_ptr (15, head->next);
print_dlist (head->next);
printf ("\nDeleting all node");
delete_all ();
print_dlist(head->next);
return 0;
}
int main() {
ITEMTYPE removed;
Dlist *dl = create_dlist();
add_last_dlist(dl,10);
add_last_dlist(dl,20);
add_last_dlist(dl,30);
add_last_dlist(dl,40);
add_dlist(dl,70,1);
add_dlist(dl,80,0);
remove_dlist(dl,5,&removed);
remove_dlist(dl,2,&removed);
remove_dlist(dl,0,&removed);
set_dlist(dl,0,35);
remove_element_dlist(dl,20);
remove_dlist(dl,0,&removed);
print_dlist(dl);
int n;
get_dlist(dl,0,&n);
printf("testando get_dlist(dl,0,&n) = %d\n",n);
return 0;
}
