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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
|
#include "queue.h"
#include <stdlib.h>
Queue*
queue_new() {
Queue *p_queue = (Queue *) malloc(sizeof(Queue));
p_queue->p_first = 0;
p_queue->p_last = 0;
p_queue->i_size = 0;
return p_queue;
}
QueueElem*
queueelem_new() {
return queueelem_new_t(TYPE_UNKNOWN);
}
QueueElem*
queueelem_new_t(TYPE type) {
QueueElem *p_elem = (QueueElem *) malloc(sizeof(QueueElem));
p_elem->p_next = 0;
p_elem->p_val = 0;
p_elem->type = type;
return p_elem;
}
_Bool
queue_empty(Queue *p_queue) {
if (p_queue == NULL)
return 0;
return p_queue->i_size == 0;
}
void
queue_push(Queue *p_queue, void *p_val) {
queue_push_t(p_queue, p_val, TYPE_UNKNOWN);
}
void
queue_push_t(Queue *p_queue, void *p_val, TYPE type) {
QueueElem *p_elem = queueelem_new_t(type);
p_elem->p_val = p_val;
if (0 == p_queue->i_size++)
p_queue->p_first = p_elem;
else
p_queue->p_last->p_next = p_elem;
p_queue->p_last = p_elem;
}
void*
queue_pop(Queue *p_queue) {
TYPE type;
return queue_pop_t(p_queue, &type);
}
void*
queue_pop_t(Queue *p_queue, TYPE *p_type) {
if (queue_empty(p_queue))
return 0;
QueueElem *p_elem = p_queue->p_first;
p_queue->p_first = p_elem->p_next;
--p_queue->i_size;
void *p_ret = p_elem->p_val;
*p_type = p_elem->type;
free(p_elem);
return p_ret;
}
void
queue_clear(Queue *p_queue) {
for (;!queue_empty(p_queue); queue_pop(p_queue));
}
void
queue_delete(Queue *p_queue) {
queue_clear(p_queue);
free(p_queue);
}
unsigned
queue_size(Queue *p_queue) {
return p_queue->i_size;
}
void
queue_iterate(Queue *p_queue, void (*func)(void *)) {
QueueElem *p_elem = p_queue->p_first;
while (p_elem) {
if (p_elem->p_val)
(*func) (p_elem->p_val);
p_elem = p_elem->p_next;
}
}
void
queue_iterate_t(Queue *p_queue, void (*func)(void *, TYPE)) {
QueueElem *p_elem = p_queue->p_first;
while (p_elem) {
if (p_elem->p_val)
(*func) (p_elem->p_val, p_elem->type);
p_elem = p_elem->p_next;
}
}
void
queue_iterate_tl(Queue *p_queue, void (*func)(void *, TYPE, _Bool)) {
QueueElem *p_elem = p_queue->p_first;
while (p_elem) {
if (p_elem->p_val)
(*func) (p_elem->p_val, p_elem->type, p_elem->p_next == NULL);
p_elem = p_elem->p_next;
}
}
QueueIter*
queueiter_new(Queue *p_queue) {
QueueIter *p_iter =
(QueueIter *) malloc(sizeof(QueueIter));
p_iter->p_current = NULL;
p_iter->p_next = p_queue->p_first;
p_iter->i_left = queue_size(p_queue);
p_iter->p_queue = p_queue;
return p_iter;
}
void
queueiter_delete(QueueIter *p_iter) {
free(p_iter);
}
void*
queueiter_next(QueueIter *p_iter) {
TYPE type;
return queueiter_next_t(p_iter, &type);
}
void*
queueiter_next_t(QueueIter *p_iter, TYPE *p_type) {
if (p_iter->p_next == NULL)
return NULL;
void *p_ret = p_iter->p_next->p_val;
*p_type = p_iter->p_next->type;
p_iter->p_current = p_iter->p_next;
p_iter->p_next = p_iter->p_next->p_next;
--p_iter->i_left;
return p_ret;
}
unsigned
queueiter_left(QueueIter *p_iter) {
return p_iter->i_left;
}
Queue*
queueiter_queue(QueueIter *p_iter) {
return p_iter->p_queue;
}
|
