gramppto99138/Info2DopleSpiel
1
0
Fork 0
generated from freudenreichan/info2Praktikum-DobleSpiel
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Compare commits

base: gramppto99138:c663833b6e6f0c9448a3a5378aefc74e52f12807
Branches Tags
gramppto99138:main
gramppto99138:stack
gramppto99138:Sortierung
...
compare: gramppto99138:288385a2200343e38d90e1a25197000cce82ff12
Branches Tags
gramppto99138:main
gramppto99138:stack
gramppto99138:Sortierung

2 Commits
c663833b6e ... 288385a220

Author SHA1 Message Date
Lukas Weber
288385a220 Third test working now, everything should be ready for merge to main 2025-12-03 13:37:44 +01:00
Lukas Weber
bf4c41b897 Test 2 working now, only one test missing 2025-12-03 13:30:29 +01:00
1 changed files with 47 additions and 3 deletions
Show Stats Expand all files Collapse all files

50
test_stack.c
View File

@ -22,14 +22,57 @@ void test_topReturnsCorrectValues(void) {
printf("Starting second test...\n");
StackNode* testStack = NULL;
int data1 = 1;
testStack = push(testStack, &data1);
int* returnData1 = (int*) top(testStack);
int data2 = 0;
testStack = push(testStack, &data2);
int* returnData2 = (int*) top(testStack);
int data3 = 3;
testStack = push(testStack, &data3);
int* returnData3 = (int*) top(testStack);
size_t counter = 0;
if(*returnData1 == 1)
counter++;
if(*returnData2 == 0)
counter++;
if(*returnData3 == 3)
counter++;
TEST_ASSERT_EQUAL_INT(3, counter);
clearStack(testStack);
}
void test_popRemovesCorrectly(void) {
printf("Starting third test...\n");
StackNode* testStack = NULL;
int data1 = 1;
testStack = push(testStack, &data1);
int data2 = 0;
testStack = push(testStack, &data2);
int data3 = 3;
testStack = push(testStack, &data3);
TEST_ASSERT_EQUAL_INT(1, *(int*)testStack->stackData);
TEST_ASSERT_EQUAL_INT(0, *(int*)testStack->stackData);
TEST_ASSERT_EQUAL_INT(3, *(int*)testStack->stackData);
int data4 = 9;
testStack = push(testStack, &data4);
int* returnData1 = (int*) top(testStack);
testStack = pop(testStack);
int* returnData2 = (int*) top(testStack);
testStack = pop(testStack);
int* returnData3 = (int*) top(testStack);
testStack = pop(testStack);
int* returnData4 = (int*) top(testStack);
testStack = pop(testStack);
size_t counter = 0;
if(*returnData1 == 9)
counter++;
if(*returnData2 == 3)
counter++;
if(*returnData3 == 0)
counter++;
if(*returnData4 == 1)
counter++;
TEST_ASSERT_EQUAL_INT(4, counter);
clearStack(testStack);
}
@ -48,6 +91,7 @@ int main(void) {
printf("\n----------------------------Stack-Tests----------------------------\n");
RUN_TEST(test_firstNodeAddedCorrectly);
RUN_TEST(test_topReturnsCorrectValues);
RUN_TEST(test_popRemovesCorrectly);
return UNITY_END();
}