Upload New File

projet j3/test.c

+#include <CUnit/CUnit.h>
+#include <CUnit/Console.h>
+#include <CUnit/Basic.h>
+#include <CUnit/Automated.h>
+#include <stdlib.h>
+#include <stdio.h>
+#include "factfun.h"
+
+
+/*
+ * Test Cunit pour une liste null
+*/
+void test_add_node1() {
+	CU_ASSERT_EQUAL(add_node(NULL, 1),1);
+}
+
+/*
+* Test CUnit pour une liste vide
+*/
+
+void test_add_node2() {
+
+	list_t* vide = malloc(sizeof(list_t));
+
+	if (vide != NULL) {
+
+		vide -> first = NULL;
+		vide -> last = NULL;
+		vide -> size = 0;
+		add_node(vide,1);
+		CU_ASSERT_EQUAL(vide -> first -> value, 1);
+		CU_ASSERT_EQUAL(vide -> last -> value, 1);
+		CU_ASSERT_EQUAL(vide -> size, 1);
+		free(vide);
+	}
+}
+
+/*
+* Test CUnit pour une liste normale
+*/
+
+void test_add_node3() {
+
+	list_t *UnNoeud = malloc(sizeof(list_t));
+	node_t *noeud = malloc(sizeof(node_t));
+
+	if (UnNoeud != NULL && noeud != NULL) {
+		noeud -> value = 1;
+		noeud -> next = NULL;
+		UnNoeud -> first = noeud;
+		UnNoeud -> last = noeud;
+		UnNoeud -> size = 1;
+		add_node(UnNoeud,8);
+		CU_ASSERT_EQUAL(UnNoeud-> size, 2);
+		CU_ASSERT_EQUAL(UnNoeud -> first->next->value,8);
+		CU_ASSERT_EQUAL(UnNoeud-> last -> value,8);
+		CU_ASSERT_EQUAL(UnNoeud -> first ->value,1);
+		free(noeud);
+		free(UnNoeud);
+	}
+}
+
+/*
+* Test CUnit pour une liste normale
+*/
+
+/*
+void test_clear_ls(){
+
+	list_t* newList = (list_t*) malloc(sizeof(list_t)) ;
+	newList -> first -> value = 3 ;
+	node_t *head = newList -> first;
+	head -> next -> value = 6;
+	CU_ASSERT_EQUAL(clear_ls(newList), NULL);
+  free(head);
+  free(newList);
+}
+
+/*
+* Test CUnit pour un chiffre normal
+*/
+
+void test_prime_divs1(){
+	list_t * newList = (list_t*) malloc(sizeof(list_t));
+	newList = prime_divs(980);
+	CU_ASSERT_EQUAL(newList->size , 3);
+	CU_ASSERT_EQUAL(newList->first->value, 2);
+	CU_ASSERT_EQUAL(newList->first-> next -> value , 5);
+	CU_ASSERT_EQUAL(newList->last-> value ,7);
+	free(newList);
+}
+
+/*
+* Test CUnit pour le chiffre 0
+*/
+
+
+void test_prime_divs2(){
+	list_t * newList = (list_t*) malloc(sizeof(list_t));
+	newList = prime_divs(1);
+	CU_ASSERT_EQUAL(newList->size, NULL);
+	CU_ASSERT_EQUAL(newList->first, NULL);
+	free(newList);
+}
+
+/*
+*Fonction de test CUnit
+*/
+
+int main() {
+	if (CUE_SUCCESS != CU_initialize_registry())
+	  return CU_get_error();
+
+	CU_pSuite pSuite = NULL;
+	pSuite = CU_add_suite("Projet3",0,0);
+
+	if (NULL == pSuite) {
+		CU_cleanup_registry();
+		return CU_get_error();
+	}
+
+	if
+		((NULL == CU_add_test (pSuite, "add_node : liste nulle",test_add_node1))   ||
+		(NULL == CU_add_test (pSuite, "add_node : liste vide",test_add_node2))   ||
+		(NULL == CU_add_test (pSuite, "add_node : liste normale",test_add_node3))   ||
+		/*(NULL == CU_add_test (pSuite, "clear_ls : liste normale",      test_clear_ls))    ||*/
+		(NULL == CU_add_test (pSuite, "prime_divs: 980", test_prime_divs1)) ||
+		(NULL == CU_add_test (pSuite, "prime_divs: 0", test_prime_divs2)) )
+	{
+		CU_cleanup_registry();
+		return CU_get_error();
+	}
+
+	CU_console_run_tests();
+	CU_basic_show_failures(CU_get_failure_list());
+	CU_cleanup_registry();
+	return CU_get_error();
+
+}