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
|
#include <stdlib.h>
#include <assert.h>
#include "stack.h"
typedef xc_stack_t* S;
void xc_stack_init_ex(S stack, int initsize)
{
stack->cnt = 0;
stack->size = initsize;
stack->data = malloc(sizeof(void *) * stack->size);
}
void xc_stack_destroy(S stack)
{
free(stack->data);
}
void xc_stack_push(S stack, void *item)
{
if (stack->cnt == stack->size) {
stack->size <<= 1;
stack->data = realloc(stack->data, sizeof(void *) * stack->size);
}
stack->data[stack->cnt++] = item;
}
void* xc_stack_pop(S stack)
{
assert(stack != NULL && stack->size > 0);
return stack->data[--stack->cnt];
}
void* xc_stack_top(S stack)
{
assert(stack != NULL && stack->cnt > 0);
return stack->data[stack->cnt-1];
}
void* xc_stack_get(S stack, int n)
{
assert(stack != NULL && stack->cnt > 0);
return stack->data[n];
}
int xc_stack_count(S stack)
{
assert(stack != NULL);
return stack->cnt;
}
void xc_stack_reverse(S stack)
{
int i, j;
void *tmp;
assert(stack != NULL);
for (i = 0, j = stack->cnt - 1; i < j; i ++, j --) {
tmp = stack->data[i];
stack->data[i] = stack->data[j];
stack->data[j] = tmp;
}
}
|
