forked from zwdzwd/utils
-
Notifications
You must be signed in to change notification settings - Fork 0
/
wvec.h
381 lines (367 loc) · 23.9 KB
/
wvec.h
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
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
#ifndef _VECTOR_H_
#define _VECTOR_H_
/*
* Dynamic Array (or "vector", by C++ convention)
*
* adapted from Ruan Jue's list.h, Li Heng's kvec.h
*
* Example usage:
*
* DEFINE_VECTOR(MyVector, MyElem)
*
* 1. dynamic
* MyVector *v = init_MyVector(1023);
* push_MyVector(v, elem);
* free_MyVector(v)
*
* 2. static
* MyVector v;
* MyVector_init(&v, 1023);
* push_MyVector(&v, elem);
* MyVector_free(v);
*
*/
#include <stdlib.h>
#include <string.h>
#include <stdint.h>
#include <stdio.h>
#define DEFINE_VECTOR_CORE(Vector, Element, Size, inc_size) \
\
typedef struct { \
Element* buffer; \
Size size; /* size: logic length*/ \
Size cap; /* capacity: allocated length */ \
} Vector; \
\
/* MyVector *v = init_MyVector(1023); */ \
static inline Vector* \
init_##Vector(Size init_size){ \
if (init_size == 0) init_size = 2; \
Vector *vector = (Vector*) malloc(sizeof(Vector)); \
vector->size = 0; \
vector->cap = init_size; \
vector->buffer = (Element*) malloc(sizeof(Element) * vector->cap); \
\
return vector; \
} \
\
/* MyVector v; MyVector_init(&v, 1023); */ \
static inline void \
Vector##_init(Vector *vector, \
Size init_size){ \
if (init_size == 0) init_size = 2; \
vector->size = 0; \
vector->cap = init_size; \
vector->buffer = (Element*) malloc(sizeof(Element) * vector->cap); \
} \
\
/* MyVector v; count_MyVector(&v); */ \
static inline Size count_##Vector(Vector *vector){ \
return vector->size; \
} \
\
/* MyVector v; clear_MyVector(&v); */ \
static inline void clear_##Vector(Vector *vector){ \
vector->size = 0; \
} \
\
/* ensure capacity of n more Size */ \
/* when capacity < inc_size (1M) increment by doubling */ \
/* when capacity >= inc_size (1M) increment by inc_size */ \
static inline void \
encap_##Vector(Vector *vector, Size n){ \
\
if (vector->size + n <= vector->cap) return; \
\
while (vector->size + n > vector->cap) { \
if(vector->cap < inc_size){ \
vector->cap <<= 1; \
} else { \
vector->cap += inc_size; \
} \
} \
vector->buffer = realloc(vector->buffer, \
vector->cap * sizeof(Element)); \
} \
\
/* reduce the logic length of the vector by size */ \
static inline void \
trunc_##Vector(Vector *vector, Size size) { \
if(size > count_##Vector(vector)) { \
size = count_##Vector(vector); \
} \
vector->size -= size; \
} \
\
static inline void \
set_##Vector##_size(Vector *vector, Size size) { \
vector->size = size; \
} \
\
static inline void \
incre_##Vector(Vector *vector, Size size) { \
if(size + vector->size > vector->cap) { \
vector->size = vector->cap; \
} else { \
vector->size += size; \
} \
} \
\
/* MyVector v; push_MyVector(&v, elem) */ \
static inline void \
push_##Vector(Vector *vector, Element e) { \
encap_##Vector(vector, 1); \
vector->buffer[vector->size++] = e; \
} \
\
static inline int \
pop_##Vector(Vector *vector, Element*e) { \
if(count_##Vector(vector)) { \
vector->size --; \
*e = vector->buffer[vector->size]; \
return 1; \
} else { \
return 0; \
} \
} \
\
static inline Vector* \
dup_##Vector(Vector *vec) { \
Vector *vec2 = calloc(1, sizeof(Vector)); \
vec2->buffer = malloc(sizeof(Element) * (vec->size+1)); \
vec2->cap = vec->size+1; \
vec2->size = vec->size; \
memcpy(vec2->buffer, vec->buffer, sizeof(Element)*vec->size); \
return vec2; \
} \
\
/* insert at any location (given by idx) */ \
/* may be inefficient, be careful */ \
static inline void \
insert_##Vector(Vector *vector, Size idx, Element e) { \
\
if(idx > vector->size) \
return; \
\
encap_##Vector(vector, 1); \
if(idx == vector->size){ \
vector->buffer[vector->size] = e; \
} else { \
memmove(vector->buffer + idx + 1, \
vector->buffer + idx, \
(vector->size - idx) * sizeof(Element)); \
vector->buffer[idx] = e; \
} \
vector->size ++; \
} \
\
static inline Element* \
first_ref_##Vector(Vector *vec) { \
if (vec->size > 0) return vec->buffer; \
else return NULL; \
} \
\
static inline Element* \
last_ref_##Vector(Vector *vec) { \
if (vec->size > 0) return vec->buffer+vec->size-1; \
else return NULL; \
} \
\
/* no check of size, use with caution */ \
static inline Element \
first_##Vector(Vector *vec) { \
return vec->buffer[0]; \
} \
\
/* no check of size, use with caution */ \
static inline Element \
last_##Vector(Vector *vec) { \
return vec->buffer[vec->size-1]; \
} \
\
static inline void \
remove_##Vector(Vector *vector, Size idx) { \
if(idx >= vector->size) return; \
if(idx + 1 < vector->size){ \
memmove(vector->buffer + idx, \
vector->buffer + idx + 1, \
(vector->size - idx - 1) * sizeof(Element)); \
} \
vector->size --; \
} \
\
static inline void \
set_##Vector(Vector *vector, Size idx, Element e) { \
vector->buffer[idx] = e; \
} \
\
static inline Element \
get_##Vector(Vector *vector, Size idx) { \
return vector->buffer[idx]; \
} \
\
static inline Element* \
ref_##Vector(Vector *vector, Size idx) { \
return vector->buffer + idx; \
} \
\
/* push an empty element, return its pointer */ \
static inline Element* \
next_ref_##Vector(Vector *vector) { \
encap_##Vector(vector, 1); \
vector->size++; \
return vector->buffer + vector->size - 1; \
} \
\
static inline Element* \
try_next_##Vector(Vector *vector) { \
encap_##Vector(vector, 1); \
return vector->buffer + vector->size; \
} \
\
static inline void \
commit_next_##Vector(Vector *vector) { \
vector->size++; \
} \
\
/* no encap version of next_ref, memory dangerous! */ \
static inline Element* \
ref_next_##Vector(Vector *vector) { \
vector->size++; \
return vector->buffer + vector->size - 1; \
} \
\
static inline Element* \
as_array_##Vector(Vector *vector) { \
return vector->buffer; \
} \
\
static inline void reverse_##Vector(Vector *vector){ \
Size i, j; \
Element t; \
if (count_##Vector(vector) == 0) return; \
i = 0; \
j = count_##Vector(vector) - 1; \
while(i < j){ \
t = get_##Vector(vector, i); \
set_##Vector(vector, i, get_##Vector(vector, j)); \
set_##Vector(vector, j, t); \
i++; \
j--; \
} \
} \
\
/* extend a vector by another vector */ \
static inline void \
extend_##Vector(Vector *vector1, Vector *vector2){ \
encap_##Vector(vector1, count_##Vector(vector2)); \
memcpy(vector1->buffer + vector1->size, \
vector2->buffer, \
sizeof(Element) * vector2->size); \
vector1->size += vector2->size; \
} \
\
/* dump vector to a file */ \
static inline Size \
dump_##Vector(Vector *vector, FILE *out){ \
return fwrite(vector->buffer, \
sizeof(Element), \
count_##Vector(vector), \
out); \
} \
\
/* dynamic free */ \
/* free vector buffer also free the vector pointer */ \
static inline void \
free_##Vector(Vector *vector){ \
free(vector->buffer); \
free(vector); \
} \
\
/* static free */ \
/* only free the vector buffer */ \
static inline void \
Vector##_free(Vector *vector){ \
free(vector->buffer); \
vector->buffer = NULL; \
} \
/* vector extension functions including
* search, exists, and many others */
#define DEFINE_VECTOR_EXT(Vector, Element, Size, equals) \
static inline Size \
delete_##Vector(Vector *vector, Element e){ \
Size i, ret; \
ret = 0; \
for(i=vector->size;i>0;i--){ \
if(equals(vector->buffer[i-1], e)){ \
if(i < vector->size){ \
memmove(vector->buffer + i - 1, \
vector->buffer + i, \
(vector->size - i) * sizeof(Element)); \
} \
vector->size --; \
ret ++; \
} \
} \
return ret; \
} \
\
static inline Size \
occ_##Vector(Vector *vector, Element e){ \
Size i, n; \
for(i=0,n=0;i<vector->size;i++){ \
if(equals(vector->buffer[i], e)) n++; \
} \
return n; \
} \
\
static inline int \
exists_##Vector(Vector *vector, Element e){ \
Size i; \
for(i=0;i<vector->size;i++){ \
if(equals(vector->buffer[i], e)) return 1; \
} \
return 0; \
} \
\
static inline Size \
replace_##Vector(Vector *vector, Element from, Element to){ \
Size i, ret; \
ret = 0; \
for(i=0;i<vector->size;i++){ \
if(equals(vector->buffer[i], from)){ \
vector->buffer[i] = to; \
ret ++; \
} \
} \
return ret; \
} \
\
static inline Size \
locate_##Vector(Vector *vector, Element e, Size start){ \
Size i; \
for(i=start;i<vector->size;i++){ \
if(equals(vector->buffer[i], e)) return i; \
} \
return i; \
}
/* the capacity threshold to switch
* from doubling to linear incrementation
* is 1M (0xFFFFFU) */
#define DEFINE_VECTOR(Vector, Element) \
DEFINE_VECTOR_CORE(Vector, Element, size_t, 0xFFFFFU)
#define NATIVE_NUMBER_EQUALS(e1, e2) ((e1) == (e2))
#define DEFINE_NATIVE_VECTOR(Vector, Element) \
DEFINE_VECTOR_CORE(Vector, Element, size_t, 0xFFFFFU); \
DEFINE_VECTOR_EXT(Vector, Element, size_t, NATIVE_NUMBER_EQUALS);
DEFINE_NATIVE_VECTOR(uint8_v, uint8_t);
DEFINE_NATIVE_VECTOR(uint16_v, uint16_t);
DEFINE_NATIVE_VECTOR(uint32_v, uint32_t);
DEFINE_NATIVE_VECTOR(uint64_v, uint64_t);
DEFINE_NATIVE_VECTOR(int8_v, int8_t);
DEFINE_NATIVE_VECTOR(int16_v, int16_t);
DEFINE_NATIVE_VECTOR(int32_v, int32_t);
DEFINE_NATIVE_VECTOR(int64_v, int64_t);
#define int32_v int_v
/* DEFINE_VECTOR(vpvector, void*); */
#endif