test_stack.c

@@ -25,75 +25,30 @@ void test_push(void)
     TEST_ASSERT_EQUAL_INT(2, testNode->next->value);
 }
 
-StackNode* setup(int value, StackNode* next) {
-    StackNode* node = malloc(sizeof(StackNode)); // allocate memory on heap
-    if (node == NULL) {
-        perror("malloc failed");
-        exit(EXIT_FAILURE); // or handle the error differently
-    }
-    node->value = value;
-    node->next = next;
-    return node;
-}
-
 void test_pop(void)
 {
-    StackNode* node2 = setup(3, NULL);
-    StackNode* node1 = setup(2, node2);
-    StackNode* header = setup(1, node1);
-    StackNode* temp;
     
-    temp = pop(header);
-    int after = 0;
-    while(temp) 
-    {
-        after++;
-        temp = temp->next;
-    }
+    TEST_ASSERT_NULL(pop(NULL));
 
-    
-    TEST_ASSERT_EQUAL_INT(2, after);
-    TEST_ASSERT_NULL(node1->next);
 }
 
 void test_top(void)
 {
-    StackNode* node2 = setup(3, NULL);
-    StackNode* node1 = setup(2, node2);
-    StackNode* header = setup(1, node1);
 
-    int data = *(int *)top(header);
-    TEST_ASSERT_EQUAL_INT(node2->value, data);
+    TEST_ASSERT_NULL(top(NULL));
 }
 
-void test_clear()
+void test_clear(void)
 {
-    StackNode* node2 = setup(3, NULL);
-    StackNode* node1 = setup(2, node2);
-    StackNode* header = setup(1, node1);
-    StackNode* temp;
 
-    clearStack(header);
-    temp = header;
-    
-    int after = 0;
-    while(temp) 
-    {
-        after++;
-        temp = temp->next;
+    // TEST_ASSERT_NULL(clearStack(NULL));
 }
 
-    
-    TEST_ASSERT_NULL(after);
-}
-
-void setUp(void)
-{
+void setUp(void) {
     // Falls notwendig, kann hier Vorbereitungsarbeit gemacht werden
 }
 
-void tearDown(void)
-{
+void tearDown(void) {
     // Hier kann Bereinigungsarbeit nach jedem Test durchgeführt werden
 }