From 35552182e98d471ff691ad653aeb883c5dde62d1 Mon Sep 17 00:00:00 2001 From: Ulysse Cura Date: Thu, 13 Feb 2025 21:36:44 +0100 Subject: [PATCH] Rewriting tests --- src/main.c | 56 +++++++++++++++--------------------------------------- 1 file changed, 15 insertions(+), 41 deletions(-) diff --git a/src/main.c b/src/main.c index b0ae622..e7e2f43 100644 --- a/src/main.c +++ b/src/main.c @@ -24,60 +24,34 @@ int main(void) int main(void) { - dclear(C_WHITE); + dclear(C_RGB(1, 70, 34)); - linked_list_t list; - linked_list_init(&list, sizeof(int)); + linked_list_t linked_list; + linked_list_init(&linked_list, sizeof(int)); - elem_t *elem = elem_create(&list); - if((!elem) || (!elem->data)) + elem_t *elem1 = elem_create(&linked_list); + if(!elem1) { - dtext(1, 1, C_BLACK, "element is not correctly initialised"); - goto Exit; - } - *(int *)elem->data = 42; - - elem_t *elem2 = elem_create(&list); - if((!elem2) || (!elem2->data)) - { - dtext(1, 1, C_BLACK, "element 2 is not correctly initialised"); + dtext(1, 1, C_RED, "elem1 is not initialised correctly"); goto Exit; } - linked_list_push_back(&list, elem); - linked_list_push_back(&list, elem2); - - if(*(int *)list.first->data == 42) + linked_list_push_back(&linked_list, elem1); + if( linked_list.first == linked_list.last && + linked_list.first && + linked_list.first->prev == NULL && + linked_list.last->prev == NULL) { - dtext(1, 1, C_BLACK, "element is correctly initialised"); - } - - if(list.first == elem && list.last == elem2) - { - dtext(1, 20, C_BLACK, "elements are correctly putted in the list"); - } - - linked_list_pop_back(&list); - if(list.first == list.last && list.first == elem && !elem2) - { - dtext(1, 40, C_BLACK, "element 2 is correctly removed from the back"); - } - - linked_list_pop_back(&list); - if(list.first == list.last && !list.first && !elem) - { - dtext(1, 60, C_BLACK, "element is correctly removed from the back"); + dtext(1, 1, C_BLACK, "elem1 is correctly inserted in linked list"); } Exit: - if(elem) free(elem->data); - if(elem) free(elem); - if(elem2) free(elem2->data); - if(elem2) free(elem2); dupdate(); - getkey(); + if(elem1) free(elem1->data); + if(elem1) free(elem1); + return 1; } \ No newline at end of file