forked from freudenreichan/info2Praktikum-DobleSpiel
107 lines
3.0 KiB
C
107 lines
3.0 KiB
C
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include "numbers.h"
|
|
#include "unity.h"
|
|
|
|
//Initialisierung
|
|
void setUp(void){}
|
|
void tearDown(void){}
|
|
|
|
// Hilfsfunktion: zählt Vorkommen eines Werts
|
|
static unsigned int countOccurrences(unsigned int* arr, unsigned int n, unsigned int value)
|
|
{
|
|
unsigned int count = 0;
|
|
for (unsigned int i = 0; i < n; i++)
|
|
if (arr[i] == value)
|
|
count++;
|
|
return count;
|
|
}
|
|
|
|
// ---------------------------------------------------------------------------
|
|
// Test 1: createNumbers erzeugt ein Array der richtigen Größe
|
|
// ---------------------------------------------------------------------------
|
|
void test_createNumbers_returns_valid_array(void)
|
|
{
|
|
unsigned int n = 50;
|
|
unsigned int* arr = createNumbers(n);
|
|
|
|
TEST_ASSERT_NOT_NULL(arr);
|
|
|
|
// Ein paar Werte prüfen (dürfen alles sein, nur kein Segfault)
|
|
for (unsigned int i = 0; i < n; i++)
|
|
TEST_ASSERT_TRUE(arr[i] >= 0);
|
|
|
|
free(arr);
|
|
}
|
|
|
|
// ---------------------------------------------------------------------------
|
|
// Test 2: createNumbers erzeugt GENAU EIN Duplikat
|
|
// ---------------------------------------------------------------------------
|
|
void test_createNumbers_contains_exactly_one_duplicate(void)
|
|
{
|
|
unsigned int n = 50;
|
|
unsigned int* arr = createNumbers(n);
|
|
|
|
TEST_ASSERT_NOT_NULL(arr);
|
|
|
|
// zähle wie viele Werte doppelt vorkommen
|
|
unsigned int duplicateValue = 0;
|
|
unsigned int totalDuplicateAppearances = 0;
|
|
|
|
for (unsigned int i = 0; i < n; i++)
|
|
{
|
|
unsigned int c = countOccurrences(arr, n, arr[i]);
|
|
if (c == 2) // genau zweimal → Bestandteil des Duplikats
|
|
{
|
|
duplicateValue = arr[i];
|
|
totalDuplicateAppearances++;
|
|
}
|
|
}
|
|
|
|
// Wenn genau eine Zahl doppelt vorkommt,
|
|
// finden wir sie zweimal → totalDuplicateAppearances == 2
|
|
TEST_ASSERT_EQUAL_UINT(2, totalDuplicateAppearances);
|
|
|
|
free(arr);
|
|
}
|
|
// ---------------------------------------------------------------------------
|
|
// Test 3: getDuplicated findet genau die richtige doppelte Zahl
|
|
// ---------------------------------------------------------------------------
|
|
void test_getDuplicated_finds_correct_duplicate(void)
|
|
{
|
|
unsigned int n = 50;
|
|
unsigned int* arr = createNumbers(n);
|
|
TEST_ASSERT_NOT_NULL(arr);
|
|
|
|
// Ermittle das Duplikat manuell
|
|
unsigned int expected = 0;
|
|
|
|
for (unsigned int i = 0; i < n; i++)
|
|
{
|
|
if (countOccurrences(arr, n, arr[i]) == 2)
|
|
{
|
|
expected = arr[i];
|
|
break;
|
|
}
|
|
}
|
|
|
|
unsigned int result = getDuplicate(arr, n);
|
|
|
|
TEST_ASSERT_EQUAL_UINT(expected, result);
|
|
|
|
free(arr);
|
|
}
|
|
|
|
// ---------------------------------------------------------------------------
|
|
// main() für Unity
|
|
// ---------------------------------------------------------------------------
|
|
int main(void)
|
|
{
|
|
UNITY_BEGIN();
|
|
|
|
RUN_TEST(test_createNumbers_returns_valid_array);
|
|
RUN_TEST(test_createNumbers_contains_exactly_one_duplicate);
|
|
RUN_TEST(test_getDuplicated_finds_correct_duplicate);
|
|
|
|
return UNITY_END();
|
|
} |