malloc Überprüfung

I2_Dobble/bintreeTest.c

@@ -107,6 +107,8 @@ void test_treeSize_returns_correct_size()
 int main(void)
 {
     UNITY_BEGIN();
+    
+    printf("\n============================\n Bintree tests\n============================\n");
 
     RUN_TEST(test_addToTree_single_element);
     RUN_TEST(test_addToTree_multiple_elements_and_size);

I2_Dobble/numbers.c

@@ -16,9 +16,7 @@ static void dublicateRandomEntry (unsigned int *numbers, unsigned int len)
    if (numbers && len > 2)
    {
         unsigned int dubIndx = rand() % (len - 1);
-        unsigned int copyIndx;
+        unsigned int copyIndx = rand() % len;
-        
-        copyIndx = rand() % len;
 
         numbers[len - 1] = numbers[dubIndx];
 
@@ -69,7 +67,7 @@ unsigned int *createNumbers(unsigned int len)
     // Duplicate one random entry
     dublicateRandomEntry(numbers, len);
 
-    clearTree(root); //Notwendigkeit muss noch restlichem Code entnommen werden
+    clearTree(root);
     return numbers;
 }
 

I2_Dobble/numbersTest.c

@@ -61,6 +61,8 @@ int main(void)
 {
     UNITY_BEGIN();
 
+    printf("\n============================\n Numbers tests\n============================\n");
+
     RUN_TEST(test_createNumbers_no_null);
     RUN_TEST(test_createNumbers_has_exactly_one_duplicate);
     RUN_TEST(test_createNumbers_has_correct_value_range);

I2_Dobble/stack.c

@@ -15,6 +15,10 @@ StackNode *push(StackNode *stack, void *data)
     {
         StackNode *newNode;
         newNode = (StackNode *)malloc(sizeof(StackNode));
+        if (!newNode) 
+            printf("Speicherfehler: nicht genug Speicher");
+            return stack;
+
         newNode->data = data;
         
         //         ,-→ bedeutet Liste war leer - das neue Element hat keinen Nachfolger (next = NULL)