Compare commits

..

No commits in common. "82b2fb283f850221a404a4b97a812ec4d87c0dfd" and "2368c9f3b9750a32591af020445e8c71f8878111" have entirely different histories.

2 changed files with 50 additions and 48 deletions

View File

@ -38,17 +38,18 @@ $(program_obj_filesobj_files): %.o: %.c
# unitTests:
# echo "needs to be implemented"
stack: stack.c
$(CC) $(FLAGS) -c stack stack.c
test_stack: stack.o test_stack.c $(unityfolder)/unity.c
$(CC) $(FLAGS) -o runstackTests test_stack.c stack.o $(unityfolder)/unity.c
bintree: bintree.c
$(CC) $(FLAGS) -c bintree bintree.c
bintreeTests: bintree.o bintreeTests.c $(unityfolder)/unity.c
$(CC) $(FLAGS) -o runbintreeTests bintreeTests.c bintree.o $(unityfolder)/unity.c
stack: stack.c
$(CC) $(FLAGS) -c stack stack.c
test_stack: stack.o test_stack.c $(unityfolder)/unity.c
$(CC) $(FLAGS) -o runstackTests test_stack.c stack.o $(unityfolder)/unity.c
# --------------------------
# Clean
# --------------------------

View File

@ -1,30 +1,24 @@
#include <stdio.h>
#include <stdlib.h>
#include "unity.h"
#include "stack.h"
void setUp(void) {
// Falls notwendig, kann hier Vorbereitungsarbeit gemacht werden
}
void tearDown(void) {
// Hier kann Bereinigungsarbeit nach jedem Test durchgeführt werden
}
void testeStackBeschreiben()
{
//printf("=== Test: push() ===\n");
printf("=== Test: push() ===\n");
StackNode *stack = NULL;
int wert1 = 42;
stack = push(stack, &wert1);
int *topValue = (int *)(stack->data);
TEST_ASSERT_NOT_NULL(topValue);
TEST_ASSERT_EQUAL_INT(42, *topValue);
if(topValue != NULL && *topValue == 42)
{
printf("Test 1: Erstes Element erfolgreich gepusht!\n");
}
else
{
printf("Test 1: FEHLGESCHLAGEN!\n");
}
int wert2 = 12;
@ -33,19 +27,23 @@ void testeStackBeschreiben()
topValue = (int *)(stack->data);
int *secondValue = (int *)((stack->next)->data);
TEST_ASSERT_NOT_NULL(topValue);
TEST_ASSERT_EQUAL_INT(12, *topValue);
TEST_ASSERT_NOT_NULL(secondValue);
TEST_ASSERT_EQUAL_INT(42, *secondValue);
if(topValue != NULL && *topValue == 12.25 && secondValue != NULL && *secondValue == 42)
{
printf("Test 2: Zweites Element erfolgreich gepusht!\n");
}
else
{
printf("Test 2: FEHLGESCHLAGEN!\n");
}
//printf("=== Ende Test: push() ===\n\n");
printf("=== Ende Test: push() ===\n\n");
return;
}
void testepop()
{
//printf("=== Test: pop() ===\n");
printf("=== Test: pop() ===\n");
StackNode *stack = NULL;
int wert1 = 20;
@ -58,15 +56,21 @@ void testepop()
int *topValue = (int *)(stack->data);
TEST_ASSERT_NOT_NULL(topValue);
TEST_ASSERT_EQUAL_INT(20, *topValue);
if(topValue != NULL && *topValue == 20)
{
printf("Test: Erstes Element erfolgreich gelöscht!\n");
}
else
{
printf("Test 1: FEHLGESCHLAGEN!\n");
}
//printf("=== Ende Test: pop() ===\n\n");
printf("=== Ende Test: pop() ===\n\n");
}
void testetop()
{
//printf("=== Test: top() ===\n");
printf("=== Test: top() ===\n");
StackNode *stack = NULL;
int wert1 = 20;
@ -77,15 +81,21 @@ void testetop()
int *topValue = top(stack);
TEST_ASSERT_NOT_NULL(topValue);
TEST_ASSERT_EQUAL_INT(74, *topValue);
if(topValue != NULL && *topValue == 74)
{
printf("Test: top() gibt korrektes Element zurück!\n");
}
else
{
printf("Test: FEHLGESCHLAGEN!\n");
}
//printf("=== Ende Test: top() ===\n\n");
printf("=== Ende Test: top() ===\n\n");
}
void testeclearStack()
{
//printf("=== Test: clearStack() ===\n");
printf("=== Test: clearStack() ===\n");
StackNode *stack = NULL;
int wert1 = 20;
@ -96,25 +106,16 @@ void testeclearStack()
clearStack(stack);
//printf("Test: clearStack() aufgerufen. Speicher freigegeben.\n");
//printf("=== Ende Test: clearStack() ===\n\n");
printf("Test: clearStack() aufgerufen. Speicher freigegeben.\n");
printf("=== Ende Test: clearStack() ===\n\n");
}
int main()
{
UNITY_BEGIN();
//printf("...");
RUN_TEST(testeStackBeschreiben);
RUN_TEST(testepop);
RUN_TEST(testetop);
RUN_TEST(testeclearStack);
/*testeStackBeschreiben();
testeStackBeschreiben();
testepop();
testetop();
testeclearStack();*/
testeclearStack();
return UNITY_END();
return 0;
}