-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStack.c
More file actions
68 lines (53 loc) · 1.13 KB
/
Stack.c
File metadata and controls
68 lines (53 loc) · 1.13 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
/*
* Stack.c:
* This moudle implements Stack.h
*/
#include <stdio.h>
#include <stdlib.h>
#include "Stack.h"
#include "MainAux.h"
/* =============== PUBLIC FUNCTIONS =============== */
void push(int i, int j, int lastUsed, Stack *stk) {
StackNode *p = malloc(sizeof(StackNode));
assertMalloc((void*) p);
p->params.i = i;
p->params.j = j;
p->params.lastUsed = lastUsed;
p->next = stk->top;
stk->top = p;
}
Stack* initialize() {
Stack* stk = malloc(sizeof(Stack));
assertMalloc((void*) stk);
stk->top = NULL;
return stk;
}
Parameters pop(Stack *stk) {
Parameters params;
StackNode *p = NULL;
params.i = stk->top->params.i;
params.j = stk->top->params.j;
params.lastUsed = stk->top->params.lastUsed;
p = stk->top;
stk->top = stk->top->next;
free(p);
return params;
}
void destroyStack(Stack *stk) {
while (stk->top != NULL) {
pop(stk);
}
free(stk);
}
Parameters top(Stack *stk) {
return stk->top->params;
}
void popAndUpdate(Stack *stk, int *i, int *j, int *lastUsed) {
Parameters params = pop(stk);
*i = params.i;
*j = params.j;
*lastUsed = params.lastUsed;
}
int isEmpty(Stack *stk) {
return stk->top == NULL;
}