int main(void)
{
t_list *list;
int a;
int b;
int c;
a = 10;
b = 20;
c = 30;
ft_list_push_back(&list, &a);
ft_list_push_back(&list, &b);
ft_list_push_back(&list, &c);
ft_putnbr(*((int*)list->data));
ft_putchar('\n');
ft_putnbr(*((int*)ft_list_last(list)->data));
ft_putchar('\n');
return (0);
}
int main(void)
{
char *exname;
int exnb = 0;
t_list *link;
t_list *base;
(void)link;
base = ft_create_elem("ABC");
base->next = ft_create_elem("012");
base->next->next = ft_create_elem("xyz");
start_day(11);
#ifdef ex00
exname = "ft_create_elem";
start_exo(exnb);
link = ft_create_elem("A");
link->next = ft_create_elem("B");
ft_print_list(link);
printf("expected:\n");
printf("[ A ] -> [ B ] -> NULL\n");
#endif
exnb++;
#ifdef ex01
exname = "ft_list_push_back";
start_exo(exnb);
ft_warning1();
link = NULL;
ft_list_push_back(&link, "A");
ft_list_push_back(&link, "B");
ft_list_push_back(&link, "C");
ft_print_list(link);
printf("expected:\n");
printf("[ A ] -> [ B ] -> [ C ] -> NULL\n");
#endif
exnb++;
#ifdef ex02
exname = "ft_list_push_front";
start_exo(exnb);
ft_warning1();
link = NULL;
ft_list_push_front(&link, "C");
ft_list_push_front(&link, "B");
ft_list_push_front(&link, "A");
ft_print_list(link);
printf("expected:\n");
printf("[ A ] -> [ B ] -> [ C ] -> NULL\n");
#endif
exnb++;
#ifdef ex03
start_exo(exnb);
exname = "ft_list_size";
ft_warning1();
printf("list : ");
ft_print_list(base);
printf("%s = %i\n", exname, ft_list_size(base));
printf("\nlist : ");
ft_print_list(NULL);
printf("%s = %i\n", exname, ft_list_size(NULL));
#endif
exnb++;
#ifdef ex04
start_exo(exnb);
exname = "ft_list_last";
ft_warning1();
printf("list : ");
ft_print_list(base);
printf("%s = ", exname);
ft_print_list(ft_list_last(base));
printf("\nlist : ");
ft_print_list(NULL);
printf("%s = ", exname);
ft_print_list(ft_list_last(NULL));
#endif
exnb++;
#ifdef ex05
start_exo(exnb);
exname = "ft_list_push_params";
printf("pas encore de suite de tests pour cet exercice :(\n");
#endif
exnb++;
#ifdef ex06
start_exo(exnb);
exname = "ft_list_clear";
printf("%s\n", exname);
printf("avant : ");
ft_print_list(base);
ft_list_clear(&base);
printf("apres : ");
ft_print_list(base);
base = ft_create_elem("ABC");
base->next = ft_create_elem("012");
base->next->next = ft_create_elem("xyz");
#endif
exnb++;
#ifdef ex07
start_exo(exnb);
exname = "ft_list_at";
ft_warning1();
printf("list : ");
ft_print_list(base);
printf("%s(list, 0) = ", exname);
ft_print_list(ft_list_at(base, 0));
printf("\nlist : ");
ft_print_list(base);
printf("%s(list, 1) = ", exname);
ft_print_list(ft_list_at(base, 1));
printf("\n%s(NULL, 0) = ", exname);
ft_print_list(ft_list_at(NULL, 0));
printf("\n%s(NULL, 1) = ", exname);
ft_print_list(ft_list_at(NULL, 1));
#endif
exnb++;
#ifdef ex08
start_exo(exnb);
exname = "ft_list_reverse";
printf("%s\n", exname);
printf("avant : ");
ft_print_list(base);
ft_list_reverse(&base);
printf("apres : ");
ft_print_list(base);
#endif
exnb++;
#ifdef ex09
start_exo(exnb);
exname = "ft_list_foreach";
base = ft_create_elem("012");
base->next = ft_create_elem("ABC");
base->next->next = ft_create_elem("xyz");
printf("%s, avec la fonction ft_putstr()\n", exname);
printf("list : ");
ft_print_list(base);
printf("%s : ", exname);
fflush(stdout);
ft_list_foreach(base, &corr_ft_putstr);
#endif
exnb++;
#ifdef ex10
start_exo(exnb);
exname = "ft_list_foreach_if";
printf("list : ");
ft_print_list(base);
printf("%s(list, &ft_putstr, '012', &strcmp) = ", exname);
fflush(stdout);
ft_list_foreach_if(base, &corr_ft_putstr, "012", &strcmp);
printf(" (012 attendu)");
#endif
exnb++;
#ifdef ex11
start_exo(exnb);
exname = "ft_list_find";
base = ft_create_elem("012");
base->next = ft_create_elem("ABC");
base->next->next = ft_create_elem("xyz");
printf("list : ");
ft_print_list(base);
printf("%s(list, 'ABC', &strcmp) = ", exname);
fflush(stdout);
ft_print_list(ft_list_find(base, "ABC", &strcmp));
#endif
exnb++;
#ifdef ex12
start_exo(exnb);
exname = "ft_list_remove_if";
base = ft_create_elem("012");
base->next = ft_create_elem("ABC");
base->next->next = ft_create_elem("xyz");
printf("list : ");
ft_print_list(base);
printf("%s(list, 'ABC', &strcmp) = ", exname);
fflush(stdout);
ft_list_remove_if(&base, "ABC", &strcmp);
ft_print_list(base);
#endif
t_list *list1;
t_list *list2;
(void)list1;
(void)list2;
exnb++;
#ifdef ex13
start_exo(exnb);
exname = "ft_list_merge";
ft_warning1();
list1 = NULL;
list2 = NULL;
printf("list1 : ");
fflush(stdout);
ft_print_list(list1);
printf("list2 : ");
fflush(stdout);
ft_print_list(list2);
ft_list_merge(&list1, list2);
printf("merge : ");
fflush(stdout);
ft_print_list(list1);
printf("\n");
list1 = NULL;
list2 = ft_create_elem("012");
printf("list1 : ");
fflush(stdout);
ft_print_list(list1);
printf("list2 : ");
fflush(stdout);
ft_print_list(list2);
ft_list_merge(&list1, list2);
printf("merge : ");
fflush(stdout);
ft_print_list(list1);
printf("\n");
list1 = ft_create_elem("012");
list2 = NULL;
printf("list1 : ");
fflush(stdout);
ft_print_list(list1);
printf("list2 : ");
fflush(stdout);
ft_print_list(list2);
ft_list_merge(&list1, list2);
printf("merge : ");
fflush(stdout);
ft_print_list(list1);
printf("\n");
list1 = ft_create_elem("012");
list1->next = ft_create_elem("345");
list2 = ft_create_elem("abc");
list2->next = ft_create_elem("def");
printf("list1 : ");
fflush(stdout);
ft_print_list(list1);
printf("list2 : ");
fflush(stdout);
ft_print_list(list2);
ft_list_merge(&list1, list2);
printf("merge : ");
fflush(stdout);
ft_print_list(list1);
#endif
exnb++;
#ifdef ex14
start_exo(exnb);
exname = "ft_list_sort";
printf("%s\n", exname);
ft_warning1();
base = NULL;
printf("avant : ");
fflush(stdout);
ft_print_list(base);
ft_list_sort(&base, &strcmp);
printf("apres : ");
fflush(stdout);
ft_print_list(base);
printf("\n");
base = ft_create_elem("3");
base->next = ft_create_elem("1");
base->next->next = ft_create_elem("2");
printf("avant : ");
fflush(stdout);
ft_print_list(base);
ft_list_sort(&base, &strcmp);
printf("apres : ");
fflush(stdout);
ft_print_list(base);
#endif
exnb++;
#ifdef ex15
start_exo(exnb);
exname = "ft_list_reverse_fun";
base = NULL;
printf("%s\n", exname);
printf("avant : ");
ft_print_list(base);
ft_list_reverse_fun(base);
printf("apres : ");
ft_print_list(base);
printf("\n");
base = ft_create_elem("1");
base->next = ft_create_elem("2");
base->next->next = ft_create_elem("3");
printf("avant : ");
ft_print_list(base);
ft_list_reverse_fun(base);
printf("apres : ");
ft_print_list(base);
printf("\n");
base = ft_create_elem("1");
base->next = ft_create_elem("2");
base->next->next = ft_create_elem("3");
base->next->next->next = ft_create_elem("4");
printf("avant : ");
ft_print_list(base);
ft_list_reverse_fun(base);
printf("apres : ");
ft_print_list(base);
#endif
exnb++;
#ifdef ex16
start_exo(exnb);
exname = "ft_sorted_list_insert";
printf("%s\n", exname);
ft_warning1();
base = ft_create_elem("2");
base->next = ft_create_elem("3");
base->next->next = ft_create_elem("5");
printf("avant : ");
fflush(stdout);
ft_print_list(base);
ft_sorted_list_insert(&base, "7", &strcmp);
printf("apres : ");
fflush(stdout);
ft_print_list(base);
base = NULL;
printf("\navant : ");
fflush(stdout);
ft_print_list(base);
ft_sorted_list_insert(&base, "0", &strcmp);
printf("apres : ");
fflush(stdout);
ft_print_list(base);
#endif
exnb++;
#ifdef ex17
start_exo(exnb);
exname = "ft_sorted_list_merge";
printf("%s\n", exname);
ft_warning1();
list1 = NULL;
list2 = NULL;
printf("list1 : ");
fflush(stdout);
ft_print_list(list1);
printf("list2 : ");
fflush(stdout);
ft_print_list(list2);
ft_sorted_list_merge(&list1, list2, &strcmp);
printf("merge : ");
fflush(stdout);
ft_print_list(list1);
printf("\n");
list1 = NULL;
list2 = ft_create_elem("0");
printf("list1 : ");
fflush(stdout);
ft_print_list(list1);
printf("list2 : ");
fflush(stdout);
ft_print_list(list2);
ft_sorted_list_merge(&list1, list2, &strcmp);
printf("merge : ");
fflush(stdout);
ft_print_list(list1);
printf("\n");
list1 = ft_create_elem("0");
list2 = NULL;
printf("list1 : ");
fflush(stdout);
ft_print_list(list1);
printf("list2 : ");
fflush(stdout);
ft_print_list(list2);
ft_sorted_list_merge(&list1, list2, &strcmp);
printf("merge : ");
fflush(stdout);
ft_print_list(list1);
printf("\n");
list1 = ft_create_elem("0");
list1->next = ft_create_elem("2");
list2 = ft_create_elem("1");
list2->next = ft_create_elem("3");
printf("list1 : ");
fflush(stdout);
ft_print_list(list1);
printf("list2 : ");
fflush(stdout);
ft_print_list(list2);
ft_sorted_list_merge(&list1, list2, &strcmp);
printf("merge : ");
fflush(stdout);
ft_print_list(list1);
#endif
}
int main(int ac, char **av)
{
t_str str1, str2;
int k, i, j;
t_list *tmp;
k = 0;
while (k < (ac == 1 ? K_MAX : ac - 1))
switch (ac == 1 ? k++ : atoi(av[++k]))
{
case 0 :
if (k + 1 < ac)
str1 = av[++k];
else
str1 = strdup("Foo Bar Baz");
printf("Ex 00 : expected [| %s |] :\t%s", str1, GREEN);
ft_print_list_str(ft_create_elem(str1));
printf("%s\n", END);
break ;
case 1 :
if (k + 1 < ac)
str1 = av[++k];
else
str1 = strdup("Hello");
if (k + 1 < ac)
str2 = av[++k];
else
str2 = strdup("World");
tmp = ft_create_elem(str1);
printf("Ex 01 :\n\t- expected [| %s ; %s ; %s |] (normal push back)\n\t\t%s", str1, str2, str2, GREEN);
ft_list_push_back(&tmp, str2);
ft_list_push_back(&tmp, str2);
ft_print_list_str(tmp);
printf("%s\t- expected [| %s ; %s |] (push back on an empty list)\n\t\t%s", END, str1, str2, GREEN);
tmp = NULL;
ft_list_push_back(&tmp, str1);
ft_list_push_back(&tmp, str2);
ft_print_list_str(tmp);
printf("%s\n", END);
break ;
case 2 :
if (k + 1 < ac)
str1 = av[++k];
else
str1 = strdup("Caesar");
if (k + 1 < ac)
str2 = av[++k];
else
str2 = strdup("Ave");
tmp = ft_create_elem(str1);
printf("Ex 02 :\n\t- expected [| %s ; %s ; %s |] (normal front back)\n\t\t%s", str1, str2, str2, GREEN);
ft_list_push_front(&tmp, str2);
ft_list_push_front(&tmp, str2);
ft_print_list_str(tmp);
printf("%s\t- expected [| %s ; %s |] (push front on an empty list)\n\t\t%s", END, str1, str2, GREEN);
tmp = NULL;
ft_list_push_front(&tmp, str1);
ft_list_push_front(&tmp, str2);
ft_print_list_str(tmp);
printf("%s\n", END);
break ;
case 3 :
if (k + 1 < ac)
{
i = atoi(av[++k]);
i *= (i < 0 ? -1 : 1);
}
else
i = 13;
j = -1;
tmp = NULL;
str1 = strdup("Tralala");
while (++j < i)
ft_list_push_front(&tmp, str1);
j = ft_list_size(tmp);
if (j == i)
printf("%s[Ex03 OK]%s\t(tested on a list of %i elements)\n", GREEN, END, i);
else
printf("%s>>>[Ex03 FAIL]<<<%s\t(a list of %i elements is not %i element long)\n", RED, END, i, j);
break ;
case 4 :
str1 = strdup("\e[1;31m>>>[Ex04 FAIL]<<<\e[0;0m");
str2 = strdup("\e[1;32m[Ex04 OK]\e[0;0m");
tmp = NULL;
i = -1;
ft_list_push_front(&tmp, str2);
while (++i < 50)
ft_list_push_front(&tmp, str1);
printf("%s\t(tested on a list of 50 elements)\n", (char*)ft_list_last(tmp)->data);
break ;
case 5 :
printf("Ex05 : You should the the arguments you passed ina reversed order :\n\t%s", GREEN);
ft_print_list_str(ft_list_push_params(ac, av));
printf("%s\n", END);
break ;
}
}
t_list *ft_list_last(t_list *begin_list)
{
if (begin_list->next == NULL)
return (begin_list);
return (ft_list_last(begin_list->next));
}
