forked from freudenreichan/info2Praktikum-DobleSpiel
Compare commits
4
Commits
Krisp
...
81de4b3d36
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
81de4b3d36 | ||
|
|
624a7d8b41 | ||
|
|
73ebc36c05 | ||
|
|
ecb5f360e3 |
No files matched your search
@@ -69,11 +69,15 @@ StackNode *pop(StackNode *stack) {
|
|||||||
void *top(StackNode *stack) { return stack != NULL ? stack->data : NULL; }
|
void *top(StackNode *stack) { return stack != NULL ? stack->data : NULL; }
|
||||||
|
|
||||||
// Clears stack and releases all memory.
|
// Clears stack and releases all memory.
|
||||||
StackNode *clearStack(StackNode *stack) {
|
void clearStack(StackNode *stack) {
|
||||||
|
|
||||||
while (stack != NULL) {
|
while (stack != NULL) {
|
||||||
|
|
||||||
StackNode *next = stack->next;
|
StackNode *next = stack->next;
|
||||||
|
stack->data = NULL;
|
||||||
|
stack->prev = NULL;
|
||||||
|
stack->next = NULL;
|
||||||
|
|
||||||
free(stack);
|
free(stack);
|
||||||
stack = next;
|
stack = next;
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -13,6 +13,7 @@ typedef struct StackNode {
|
|||||||
|
|
||||||
void *data;
|
void *data;
|
||||||
struct StackNode *next;
|
struct StackNode *next;
|
||||||
|
struct StackNode *prev;
|
||||||
|
|
||||||
} StackNode;
|
} StackNode;
|
||||||
|
|
||||||
@@ -29,6 +30,6 @@ StackNode *pop(StackNode *stack);
|
|||||||
void *top(StackNode *stack);
|
void *top(StackNode *stack);
|
||||||
|
|
||||||
// Clears stack and releases all memory.
|
// Clears stack and releases all memory.
|
||||||
StackNode *clearStack(StackNode *stack);
|
void clearStack(StackNode *stack);
|
||||||
|
|
||||||
#endif
|
#endif
|
||||||
+1
-1
@@ -36,7 +36,7 @@ void test_clearStack(void) {
|
|||||||
testStack = push(testStack, &testInts[i]);
|
testStack = push(testStack, &testInts[i]);
|
||||||
}
|
}
|
||||||
|
|
||||||
testStack = clearStack(testStack);
|
clearStack(testStack);
|
||||||
TEST_ASSERT_NULL(testStack);
|
TEST_ASSERT_NULL(testStack);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
Reference in new issue
Block a user