javascript-database/js_vector.h at master · malbrain/javascript-database · GitHub

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
#pragma once

// API

#definevec_free(a) ((a) ? js_free(vec_raw(a)),0 : 0)
#definevec_push(a,v) (vec_maybegrow(a,1), (a)[vec_size(a)++] = (v))
#definevec_pop(a) ((a)[--vec_size(a)])
#definevec_cnt(a) ((a) ? vec_size(a) : 0)
#definevec_max(a) ((a) ? vec_cap(a) : 0)
#definevec_add(a,n) (vec_maybegrow(a,n), vec_size(a)+=(n))
#definevec_last(a) ((a)[vec_size(a)-1])

// access with a[i]

// internal

#definevec_raw(a) (((uint32_t *) (a)) - 2)
#definevec_cap(a) vec_raw(a)[0] // maximum capacity
#definevec_size(a) vec_raw(a)[1] // current size

#definevec_needgrow(a,n) ((a)==0 || vec_size(a)+(n) > vec_cap(a))
#definevec_maybegrow(a,n) (vec_needgrow((a),(n)) ? ((a) = vec_grow((a), (n), sizeof(*(a)), 0)) : 0)
#definevec_slice(a,q) vec_sliceqty((a), (q), sizeof(*(a)))

void*vec_grow(void*vector, uint32_tincrement, uint32_titemsize, boolmap);
void*vec_sliceqty(void*vector, uint32_tqty, uint32_titemsize);
void*vec_dup(void*vector);

#definenewVector(numitems,itemsize,map) (vec_grow(NULL, numitems, itemsize, map))