forked from mongrel2/mongrel2
/
darray.h
72 lines (50 loc) · 1.38 KB
/
darray.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
#ifndef _darray_h
#define _darray_h
#include "dbg.h"
#include <stdlib.h>
#include <assert.h>
typedef struct darray_t {
int end;
int max;
size_t element_size;
size_t expand_rate;
void **contents;
} darray_t;
darray_t *darray_create(size_t element_size, size_t initial_max);
void darray_destroy(darray_t *array);
void darray_clear(darray_t *array);
int darray_expand(darray_t *array);
int darray_contract(darray_t *array);
int darray_push(darray_t *array, void *el);
void *darray_pop(darray_t *array);
#define darray_last(A) ((A)->contents[(A)->end - 1])
#define darray_first(A) ((A)->contents[0])
#define darray_end(A) ((A)->end)
#define darray_max(A) ((A)->max)
#define DEFAULT_EXPAND_RATE 300
static inline void darray_set(darray_t *array, int i, void *el)
{
check(i < array->max, "darray attempt to set past max");
array->contents[i] = el;
error:
return;
}
static inline void *darray_get(darray_t *array, int i)
{
assert(i < array->max && "darray attempt to get past max");
return array->contents[i];
}
static inline void *darray_remove(darray_t *array, int i)
{
void *el = array->contents[i];
array->contents[i] = NULL;
return el;
}
static inline void *darray_new(darray_t *array)
{
check(array->element_size > 0, "Can't use darray_new on 0 size darrays.");
return calloc(1, array->element_size);
error:
return NULL;
}
#endif