39 lines
1.0 KiB
C
39 lines
1.0 KiB
C
/* vector.h - A simple vector implementation in c
|
|
*/
|
|
|
|
#ifndef _VECTOR_H_
|
|
#define _VECTOR_H_
|
|
|
|
#include <sys/types.h>
|
|
|
|
struct vector {
|
|
unsigned size;
|
|
unsigned cap;
|
|
void **data;
|
|
};
|
|
|
|
void vec_init(struct vector *v);
|
|
void vec_push_back(struct vector *v, void *p);
|
|
void vec_push_back_all(struct vector *v, void *p, ...);
|
|
void *vec_pop_back(struct vector *v);
|
|
void vec_sort(struct vector *v, int (*compar)(const void *, const void *));
|
|
void vec_destroy(struct vector *v);
|
|
void vec_deep_destroy(struct vector *v);
|
|
void vec_dup(struct vector *v, struct vector *vv);
|
|
|
|
#define vec_size(v) (v)->size
|
|
#define vec_cap(v) (v)->cap
|
|
#define vec_entry(v) (v)->data
|
|
/* Usage: vec_for_each(vector *v, void *e) */
|
|
#define vec_for_each(v, e) \
|
|
e = v ? (v)->data[0] : NULL; \
|
|
for (int _ = 0; v && _ < (v)->size; ++_, e = (v)->data[_])
|
|
|
|
#define vec_for_each_r(v, e) \
|
|
e = (v && (v)->size > 0) ? (v)->data[(v)->size - 1] : NULL; \
|
|
for (int _ = ((int) (v)->size) - 1; v && _ >= 0; --_, e = (v)->data[_])
|
|
|
|
#define vec_cur(v) vec_entry(v)[_]
|
|
|
|
#endif
|