generated from freudenreichan/info2Praktikum-DobleSpiel
Compare commits
4
Commits
Sortierung
...
036158fc59
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
036158fc59 | ||
|
|
0bc9263b60 | ||
|
|
94e489cfae | ||
|
|
6671a3aacc |
No files matched your search
@@ -1 +1,2 @@
|
||||
Lukas;4985
|
||||
player1;3999
|
||||
@@ -35,7 +35,9 @@ $(program_obj_filesobj_files): %.o: %.c
|
||||
# --------------------------
|
||||
# Unit Tests
|
||||
# --------------------------
|
||||
unitTests:
|
||||
stackTests: stack.o test_stack.c $(unityfolder)/unity.c
|
||||
$(CC) $(CFLAGS) -I$(unityfolder) -o runStackTests test_stack.c stack.o $(unityfolder)/unity.c
|
||||
|
||||
echo "needs to be implemented"
|
||||
|
||||
# --------------------------
|
||||
|
||||
@@ -10,6 +10,22 @@
|
||||
// Pushes data as pointer onto the stack.
|
||||
StackNode *push(StackNode *stack, void *data)
|
||||
{
|
||||
if(!(stack)) { // check if stack is empty
|
||||
stack = malloc(sizeof(StackNode));
|
||||
if(!stack)
|
||||
return NULL;
|
||||
stack->stackData = data;
|
||||
stack->below = NULL;
|
||||
return stack;
|
||||
}
|
||||
|
||||
StackNode* newStack = malloc(sizeof(StackNode));
|
||||
if(!newStack)
|
||||
return stack;
|
||||
newStack->below = stack;
|
||||
newStack->stackData = data;
|
||||
stack = newStack;
|
||||
return stack;
|
||||
|
||||
}
|
||||
|
||||
@@ -17,17 +33,32 @@ StackNode *push(StackNode *stack, void *data)
|
||||
// freed by caller.)
|
||||
StackNode *pop(StackNode *stack)
|
||||
{
|
||||
|
||||
if(stack) {
|
||||
StackNode* temp = stack;
|
||||
stack = stack->below;
|
||||
temp->stackData = NULL;
|
||||
free(temp);
|
||||
temp = NULL;
|
||||
return stack;
|
||||
} else {
|
||||
return NULL;
|
||||
}
|
||||
}
|
||||
|
||||
// Returns the data of the top element.
|
||||
void *top(StackNode *stack)
|
||||
{
|
||||
if(stack)
|
||||
return stack->stackData;
|
||||
else
|
||||
return NULL;
|
||||
|
||||
}
|
||||
|
||||
// Clears stack and releases all memory.
|
||||
void clearStack(StackNode *stack)
|
||||
{
|
||||
while(stack)
|
||||
stack = pop(stack);
|
||||
|
||||
}
|
||||
@@ -9,6 +9,11 @@ The latest element is taken from the stack. */
|
||||
|
||||
//TODO: passenden Datentyp als struct anlegen
|
||||
|
||||
typedef struct StackNode {
|
||||
struct StackNode* below;
|
||||
void* stackData;
|
||||
} StackNode;
|
||||
|
||||
// Pushes data as pointer onto the stack.
|
||||
StackNode *push(StackNode *stack, void *data);
|
||||
|
||||
|
||||
@@ -0,0 +1,37 @@
|
||||
#include "stack.h"
|
||||
#include "unity.h"
|
||||
|
||||
|
||||
void test_firstNodeAddedCorrectly(void) {
|
||||
printf("\nStarting first test...\n");
|
||||
StackNode* modelStack = malloc(sizeof(StackNode));
|
||||
int modelData = 5;
|
||||
modelStack->below = NULL;
|
||||
modelStack->stackData = &modelData;
|
||||
|
||||
StackNode* testStack = NULL;
|
||||
int testData = 5;
|
||||
testStack = push(testStack, &testData);
|
||||
TEST_ASSERT_EQUAL_INT(*(int*)modelStack->stackData, *(int*)testStack->stackData);
|
||||
TEST_ASSERT_NULL(testStack->below);
|
||||
clearStack(modelStack);
|
||||
clearStack(testStack);
|
||||
}
|
||||
|
||||
void setUp(void) {
|
||||
|
||||
}
|
||||
|
||||
void tearDown(void) {
|
||||
|
||||
}
|
||||
|
||||
int main(void) {
|
||||
|
||||
UNITY_BEGIN();
|
||||
|
||||
printf("\n----------------------------Stack-Tests----------------------------\n");
|
||||
RUN_TEST(test_firstNodeAddedCorrectly);
|
||||
|
||||
return UNITY_END();
|
||||
}
|
||||
Reference in new issue
Block a user