blob: 162324e224c717ce8747a8151facb9be06f4701d (
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
|
/* Standard C */
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
/* Project */
#include "util.h"
/* --8<-- stack_type */
typedef int T;
struct stack_item {
struct stack_item *next;
T data;
};
struct stack {
struct stack_item *head;
};
/* -->8-- */
/* --8<-- stack_init */
void
stack_init(struct stack *stack)
{
stack->head = NULL;
}
/* -->8-- */
/* --8<-- stack_push */
void
stack_push(struct stack *stack, T data)
{
struct stack_item *new_item;
if ( (new_item = malloc(sizeof(*new_item))) != NULL ) {
new_item->data = data;
new_item->next = stack->head;
stack->head = new_item;
}
else
ERROR("out of memory");
}
/* -->8-- */
/* --8<-- stack_pop */
bool
stack_pop(struct stack *stack, T *data)
{
if ( stack->head ) {
struct stack_item *next = stack->head->next;
if ( data ) {
*data = stack->head->data;
}
free(stack->head);
stack->head = next;
return true;
}
else
return false;
}
/* -->8-- */
/* --8<-- stack_empty */
bool
stack_empty(struct stack *stack)
{
return stack->head == NULL;
}
/* -->8-- */
/* --8<-- stack_free */
void
stack_free(struct stack *stack)
{
struct stack_item *item, *next;
for ( item = stack->head; item; item = next ) {
next = item->next;
free(item);
}
}
/* -->8-- */
int
main()
{
struct stack stack[1];
stack_init(stack);
for ( int i = 0; i != 10; ++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;
}
|
