-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathstack.h
69 lines (55 loc) · 1.01 KB
/
stack.h
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
67
68
69
#ifndef CANDLEBROT_STACK_H
#define CANDLEBROT_STACK_H
#ifndef _STDLIB_H
#include <stdlib.h>
#endif
typedef struct
{
int x;
int y;
void *prev;
} stack_element_t;
typedef struct
{
stack_element_t *current;
size_t size;
} stack_t;
static stack_t *new_stack()
{
stack_t *stack = malloc(sizeof(stack_t));
stack->size = 0;
return stack;
}
static void stack_push(stack_t *stack, stack_element_t *element)
{
if(stack->size > 0)
{
element->prev = stack->current;
}
stack->current = element;
stack->size++;
}
static stack_element_t *stack_pop(stack_t *stack)
{
if(stack->current == NULL)
{
return NULL;
}
else
{
stack_element_t *result = stack->current;
stack->current = result->prev;
stack->size--;
result->prev = NULL;
return result;
}
}
static void free_stack(stack_t *stack)
{
while(stack->size > 0)
{
free(stack_pop(stack));
}
free(stack);
}
#endif //CANDLEBROT_STACK_H