/
arrqueue.c
177 lines (140 loc) · 2.77 KB
/
arrqueue.c
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 <stdlib.h>
#include "listworks.h"
// initialization {
arrqueue* alloc_arrqueue()
{
return (arrqueue*)malloc(sizeof(arrqueue));
}
arrqueue* init_arrqueue(arrqueue* q, void** arr, int size)
{
q->arr = (arr ? arr : (void**)malloc(sizeof(void*)*size));
q->arrsize = size;
q->size = 0;
q->xn = 0;
q->xd = 0;
return q;
}
arrqueue* new_arrqueue(void* target, int size)
{
return init_arrqueue(alloc_arrqueue(),target,size);
}
//}
// deletion {
void del_arrqueue(arrqueue* q, bit_flag del_flags)
{
bit_flag flags = (del_flags ? del_flags : DEL_STRUCT);
// DEL_DATA will free the target array
if (flags & DEL_DATA)
{
// Dequeue items and DESTROY THEM ALL
void* a;
while (a = arrqueue_dq(q))
free(a);
// Then free
free(q->arr);
}
if (flags & DEL_STRUCT)
free(q);
}
//}
// arrqueue functions {
int sizeof_arrqueue()
{
return sizeof(arrqueue);
}
int arrqueue_size(arrqueue* q)
{
return q->size;
}
void* arrqueue_nq(arrqueue* q, void* p)
{
if (q->size == q->arrsize)
return 0;
q->size++;
q->arr[q->xn % q->arrsize] = p;
q->xn++;
}
void* arrqueue_dq(arrqueue* q)
{
if (q->xd == q->xn)
return 0;
if (q->xd >= q->size)
{
q->xd -= q->size;
q->xn -= q->size;
}
q->size--;
return q->arr[q->xd++];
}
void* iter_arrqueue(arrqueue* q, int* handle)
{
// Assumed to be an... int**?
int* ip = (int*)handle;
*ip = q->xd;
return q->arr[q->xd];
}
void* iter_arrqueue_next(arrqueue* q, int* handle)
{
int* ip = (int*)handle;
if (*ip == q->xn) return 0;
void* ret = q->arr[*ip % q->arrsize];
(*ip)++;
return ret;
}
int iter_arrqueue_has_next(arrqueue* q, int* handle)
{
int* ip = (int*)handle;
return (*ip < q->arrsize);
}
//}
// test code {
#ifdef arrqueue_active
#include <stdio.h>
#ifdef mtrace_active
#include <mcheck.h>
#endif
int main(int argc, char** argv)
{
#ifdef mtrace_active
mtrace();
#endif
printf("testing arrqueue\n");
// Test bare alloc and del
arrqueue* q = new_arrqueue(0,10);
del_arrqueue(q,(DEL_STRUCT|DEL_DATA));
//*
int i;
char* arr[] = {"Articulate","Breathe","Circulate","Diaphragm","Esophagus"};
q = new_arrqueue(arr,5);
// Straight-up insertion
printf("size before: %i\n", arrqueue_size(q));
for (i=0; i < q->arrsize; ++i)
arrqueue_nq(q,arr[i]);
for (i=0; i < q->arrsize; ++i)
printf("%s ",q->arr[i]); printf("\n");
printf("size after: %i\n", arrqueue_size(q));
//
void* a;
void* b;
int it;
char* s;
a = arrqueue_dq(q);
b = arrqueue_dq(q);
iter_arrqueue(q,&it);
while (s = iter_arrqueue_next(q,&it))
printf("%s ",s); printf("\n");
arrqueue_nq(q,b);
arrqueue_nq(q,a);
iter_arrqueue(q,&it);
while (s = iter_arrqueue_next(q,&it))
printf("%s ",s); printf("\n");
del_arrqueue(q,0);
//*/
#ifdef mtrace_active
printf("\nMTRACE OUTPUT:\n");
muntrace();
#endif
return 0;
}
#endif
//}