estimate calc utility (WIP)
[mkp224o.git] / vec.h
blobcf4920768c3311ec23ebdaf3b1ecdc83eaaa4073
1 #define VEC_STRUCT(typename,inttype) \
2 struct typename { \
3 inttype *buf; \
4 size_t len,alen; \
6 VEC_STRUCT(vec_basestruct,void) ;
8 #define VEC_INIT(ctl) memset(&ctl,0,sizeof(ctl))
10 #define VEC_ELSIZE(ctl) (sizeof(*(ctl).buf))
12 void vec_add1(struct vec_basestruct *ctl,size_t sz);
13 #define VEC_ADD1(ctl) \
14 vec_add1((struct vec_basestruct *)&(ctl),VEC_ELSIZE(ctl))
15 #define VEC_ADD(ctl,val) \
16 do { \
17 VEC_ADD1(ctl); \
18 (ctl).buf[(ctl).len - 1] = (val); \
19 } while (0)
21 void vec_addn(struct vec_basestruct *ctl,size_t sz,size_t n);
22 #define VEC_ADDN(ctl,n) \
23 vec_addn((struct vec_basestruct *)&(ctl),VEC_ELSIZE(ctl),(size_t)(n))
25 #define VEC_SETLENGTH(ctl,n) \
26 do { \
27 (ctl).len = n; \
28 } while (0)
30 #define VEC_REMOVEN(ctl,n,m) \
31 do { \
32 (ctl).len -= m; \
33 memmove( \
34 &(ctl).buf[n], \
35 &(ctl).buf[(n) + (m)], \
36 ((ctl).len - (n)) * VEC_ELSIZE(ctl)); \
37 } while (0)
38 #define VEC_REMOVE(ctl,n) VEC_REMOVEN(ctl,n,1)
40 #define VEC_INSERT1(ctl,n) \
41 do { \
42 VEC_ADD1(ctl); \
43 memmove( \
44 &(ctl).buf[(n) + 1], \
45 &(ctl).buf[n], \
46 ((ctl).len - (n) - 1) * VEC_ELSIZE(ctl)); \
47 } while (0)
48 #define VEC_INSERT(ctl,n,val) \
49 do { \
50 VEC_INSERT1(ctl,n); \
51 (ctl).buf[n] = (val); \
52 } while (0)
54 #define VEC_INSERTN(ctl,n,m) \
55 do { \
56 VEC_ADDN(ctl,m); \
57 memmove( \
58 &(ctl).buf[(n) + (m)], \
59 &(ctl).buf[n], \
60 ((ctl).len - (n) - (m)) * VEC_ELSIZE(ctl)); \
61 } while (0)
63 #define VEC_ZERO(ctl) \
64 do { \
65 if ((ctl).buf) \
66 memset((ctl).buf,0,(ctl).len * VEC_ELSIZE(ctl)); \
67 } while (0)
69 #define VEC_FREE(ctl) \
70 do { \
71 free((ctl).buf); \
72 memset(&(ctl), 0, sizeof(ctl)); \
73 } while (0)
75 #define VEC_LENGTH(ctl) ((ctl).len)
76 #define VEC_BUF(ctl,num) ((ctl).buf[num])
78 #define VEC_FOR(ctl,it) for (size_t it = 0;it < VEC_LENGTH((ctl));++it)