generated from freudenreichan/info2Praktikum-DobleSpiel
small fixes
This commit is contained in:
parent
a04005486d
commit
e17e9b2b68
BIN
stacktest.exe
Normal file
BIN
stacktest.exe
Normal file
Binary file not shown.
@ -17,6 +17,7 @@ void test_push_data_NULL(void)
|
||||
StackNode *stack = NULL;
|
||||
//data = NULL -> stack bleibt NULL
|
||||
TEST_ASSERT_NULL(push(NULL,NULL));
|
||||
clearStack(stack);
|
||||
}
|
||||
|
||||
// 2. Test: push data ungleich NULL -> data wird erneuert und next bleibt NULL
|
||||
@ -30,6 +31,7 @@ void test_push_erster_push(void)
|
||||
TEST_ASSERT_EQUAL_PTR(&test, stack->data);
|
||||
TEST_ASSERT_EQUAL_MEMORY(&expected, stack, sizeof(StackNode));
|
||||
TEST_ASSERT_NULL(stack->next);
|
||||
clearStack(stack);
|
||||
}
|
||||
|
||||
//3. Test: zweimal pushen -> data wird zur zweiten Variable; next wird zur ersten
|
||||
@ -45,6 +47,7 @@ void test_push_zweiter_push(void)
|
||||
TEST_ASSERT_NOT_NULL(stack->next);
|
||||
TEST_ASSERT_EQUAL_PTR(&test, stack->next->data);
|
||||
TEST_ASSERT_NULL(stack->next->next);
|
||||
clearStack(stack);
|
||||
}
|
||||
|
||||
// 4. Test: dreimal pushen -> data wird zur dritten variable; next zur zweiten; zweiter next zur dritten
|
||||
@ -64,6 +67,7 @@ void test_push_dritter_push(void)
|
||||
TEST_ASSERT_NOT_NULL(stack->next->next);
|
||||
TEST_ASSERT_EQUAL_PTR(&test, stack->next->next->data);
|
||||
TEST_ASSERT_NULL(stack->next->next->next);
|
||||
clearStack(stack);
|
||||
}
|
||||
|
||||
|
||||
@ -73,6 +77,7 @@ void test_pop_stack_gleich_NULL(void)
|
||||
StackNode *stack = NULL;
|
||||
stack = pop(stack);
|
||||
TEST_ASSERT_NULL(stack);
|
||||
clearStack(stack);
|
||||
}
|
||||
|
||||
|
||||
@ -84,6 +89,7 @@ void test_pop_Stack_ungleich_NULL_eine_Node(void)
|
||||
stack = push(stack, &test);
|
||||
stack = pop(stack);
|
||||
TEST_ASSERT_NULL(stack);
|
||||
clearStack(stack);
|
||||
}
|
||||
|
||||
// 7. Test: pop mit zwei Nodes -> data wird zur ersten Variable; next wird Null
|
||||
@ -98,6 +104,7 @@ void test_pop_Stack_ungleich_NULL_zwei_Nodes(void)
|
||||
TEST_ASSERT_NOT_NULL(stack);
|
||||
TEST_ASSERT_EQUAL_PTR(&test, stack->data);
|
||||
TEST_ASSERT_NULL(stack->next);
|
||||
clearStack(stack);
|
||||
}
|
||||
|
||||
|
||||
@ -117,6 +124,7 @@ void test_pop_Stack_ungleich_NULL_drei_Nodes(void)
|
||||
TEST_ASSERT_NOT_NULL(stack->next);
|
||||
TEST_ASSERT_EQUAL_PTR(&test, stack->next->data);
|
||||
TEST_ASSERT_NULL(stack->next->next);
|
||||
clearStack(stack);
|
||||
}
|
||||
|
||||
|
||||
@ -125,6 +133,7 @@ void test_top_stack_gleich_NULL(void)
|
||||
{
|
||||
StackNode *stack = NULL;
|
||||
TEST_ASSERT_NULL(stack);
|
||||
clearStack(stack);
|
||||
}
|
||||
|
||||
|
||||
@ -135,6 +144,7 @@ void test_top_stack_ungleich_NULL_eine_Node(void)
|
||||
StackNode *stack = NULL;
|
||||
stack = push(stack, &test);
|
||||
TEST_ASSERT_EQUAL_PTR(&test, top(stack));
|
||||
clearStack(stack);
|
||||
}
|
||||
|
||||
|
||||
@ -147,6 +157,7 @@ void test_top_stack_ungleich_NULL_zwei_Node(void)
|
||||
int test2 = 40;
|
||||
stack = push(stack, &test2);
|
||||
TEST_ASSERT_EQUAL_PTR(&test2, top(stack));
|
||||
clearStack(stack);
|
||||
}
|
||||
|
||||
|
||||
@ -161,6 +172,7 @@ void test_top_stack_ungleich_NULL_drei_Node(void)
|
||||
int test3 = 60;
|
||||
stack = push(stack, &test3);
|
||||
TEST_ASSERT_EQUAL_PTR(&test3, top(stack));
|
||||
clearStack(stack);
|
||||
}
|
||||
|
||||
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user