kachelto100370/info2Praktikum-DobleSpiel
1
0
Fork 0
forked from freudenreichan/info2Praktikum-DobleSpiel
Code Pull Requests Activity

stacktest überarbeitet

Browse Source
This commit is contained in:
Kristin 2025-12-09 09:57:41 +01:00
parent 09d7f457dd
commit 57f9914e2b
1 changed files with 12 additions and 15 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

27
test_stack.c
View File

@ -75,11 +75,12 @@ void test_deleteTopElement(void) {
stack = push(stack, &testInts[i]); stack = push(stack, &testInts[i]);
} }
TEST_ASSERT_EQUAL_PTR(&testInts[2], stack->data); TEST_ASSERT_EQUAL_PTR(&testInts[2], stack->data); // oberstes Element ist 30
stack = pop(stack); stack = pop(stack); // oberstes Element löschen
TEST_ASSERT_EQUAL_PTR(&testInts[1], stack->data); TEST_ASSERT_EQUAL_PTR(&testInts[1], stack->data);
TEST_ASSERT_NULL(stack->prev); TEST_ASSERT_NULL(
stack->prev); // pointer zum alten head wurde auf NULL gesetzt
stack = pop(stack); stack = pop(stack);
TEST_ASSERT_EQUAL_PTR(&testInts[0], stack->data); TEST_ASSERT_EQUAL_PTR(&testInts[0], stack->data);
@ -98,20 +99,16 @@ void test_returnData(void) {
stack = push(stack, &testInts[i]); stack = push(stack, &testInts[i]);
} }
TEST_ASSERT_EQUAL_PTR(&testInts[2], top(stack)); TEST_ASSERT_EQUAL_PTR(&testInts[2],
top(stack)); // top gibt richtige Adresse zurück
stack = pop(stack); // oberstes Element löschen
TEST_ASSERT_EQUAL_PTR(&testInts[1], top(stack));
if (stack->next != NULL) { stack = pop(stack);
TEST_ASSERT_EQUAL_PTR(&testInts[1], stack->next->data); TEST_ASSERT_EQUAL_PTR(&testInts[0], top(stack));
if (stack->next->next != NULL) {
TEST_ASSERT_EQUAL_PTR(&testInts[0], stack->next->next->data);
}
}
StackNode *last = stack; stack = pop(stack); // bei leerem Stack wird NULL zurückgegeben
while (last->next != NULL) { TEST_ASSERT_NULL(stack);
last = last->next;
}
TEST_ASSERT_NULL(last->next);
} }
void test_clearStack(void) { void test_clearStack(void) {