39 lines
1.0 KiB
C
Raw Normal View History

2017-04-05 03:44:13 +08:00
/* vector.h - A simple vector implementation in c
*/
#ifndef _VECTOR_H_
#define _VECTOR_H_
#include <sys/types.h>
struct vector {
2017-12-21 03:36:18 +08:00
unsigned size;
unsigned cap;
2017-04-05 03:44:13 +08:00
void **data;
};
2017-05-05 04:16:00 +08:00
2017-04-05 03:44:13 +08:00
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);
2017-04-05 03:44:13 +08:00
void vec_sort(struct vector *v, int (*compar)(const void *, const void *));
void vec_destroy(struct vector *v);
2017-04-06 06:12:29 +08:00
void vec_deep_destroy(struct vector *v);
void vec_dup(struct vector *v, struct vector *vv);
2017-05-05 04:16:00 +08:00
2017-04-05 03:44:13 +08:00
#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) \
2017-05-01 01:58:52 +08:00
e = v ? (v)->data[0] : NULL; \
2017-12-21 03:36:18 +08:00
for (int _ = 0; v && _ < (v)->size; ++_, e = (v)->data[_])
2017-04-05 03:44:13 +08:00
2017-04-06 06:12:29 +08:00
#define vec_for_each_r(v, e) \
e = (v && (v)->size > 0) ? (v)->data[(v)->size - 1] : NULL; \
2017-12-21 03:36:18 +08:00
for (int _ = ((int) (v)->size) - 1; v && _ >= 0; --_, e = (v)->data[_])
2017-04-06 06:12:29 +08:00
2017-09-07 19:22:30 +08:00
#define vec_cur(v) vec_entry(v)[_]
2017-08-20 21:36:32 +08:00
#endif