blob: 5f4ba417081ab17a64c09613f938e532abb54382 (
plain)
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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
|
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include "util.h"
/* --8<-- stack2_type */
typedef int T;
struct stack {
T * array;
size_t sz, p;
};
/* -->8-- */
/* --8<-- stack2_init */
void
stack_init(struct stack *stack)
{
stack->array = NULL;
stack->sz = 0;
stack->p = 0;
}
/* -->8-- */
/* --8<-- stack2_push */
bool
stack_push(struct stack *stack, T data)
{
if ( stack->array == NULL ) {
if ( (stack->array = malloc(10 * sizeof *stack->array)) != NULL ) {
stack->sz = 10;
stack->p = 0;
}
else {
ERROR("out of memory");
return false;
}
}
if ( stack->p == stack->sz ) {
size_t new_sz;
T * new_array;
if ( (new_array = realloc(stack->array, (new_sz = (stack->sz * 3 / 2)) * sizeof *stack->array)) != NULL ) {
stack->array = new_array;
stack->sz = new_sz;
}
else {
ERROR("out of memory");
return false;
}
}
stack->array[stack->p++] = data;
return true;
}
/* -->8-- */
/* --8<-- stack2_pop */
bool
stack_pop(struct stack *stack, T *data)
{
if ( stack->p != 0 ) {
--stack->p;
if ( data ) {
*data = stack->array[stack->p];
}
return true;
}
else
return false;
}
/* -->8-- */
/* --8<-- stack2_empty */
bool
stack_empty(struct stack *stack)
{
return stack->p == 0;
}
/* -->8-- */
/* --8<-- stack2_free */
void
stack_free(struct stack *stack)
{
free(stack->array);
}
/* -->8-- */
int
main()
{
struct stack stack[1];
stack_init(stack);
for ( int i = 0; i != 20; ++i )
stack_push(stack, i);
while ( !stack_empty(stack) ) {
int i;
if ( stack_pop(stack, &i) )
printf("%d\n", i);
else
ERROR("this shouldn't happen!");
}
stack_free(stack);
return EXIT_SUCCESS;
}
|
