aboutsummaryrefslogtreecommitdiff
path: root/vec.h
diff options
context:
space:
mode:
Diffstat (limited to 'vec.h')
-rw-r--r--vec.h117
1 files changed, 117 insertions, 0 deletions
diff --git a/vec.h b/vec.h
new file mode 100644
index 0000000..df2242d
--- /dev/null
+++ b/vec.h
@@ -0,0 +1,117 @@
+#ifndef ALGDS_VEC_H_
+#define ALGDS_VEC_H_
+
+#include <stdlib.h>
+#include <string.h>
+#include <stdio.h>
+
+#include "type_alias.h"
+
+#define VECTOR_DEF(T) \
+ typedef struct { \
+ T* buffer; \
+ int size; \
+ int cap; \
+ } T##Vector; \
+ \
+ void T##Vector_init(T##Vector *self); \
+ void T##Vector_push_back(T##Vector *self, T elem); \
+ void T##Vector_insert_before(T##Vector *self, int n, T elem); \
+ void T##Vector_pop(T##Vector *self); \
+ bool T##Vector_empty(T##Vector *self); \
+ void T##Vector_remove(T##Vector *self, size_t n); \
+ size_t T##Vector_len(T##Vector *self); \
+ T* T##Vector_begin(T##Vector *self); \
+ T* T##Vector_last(T##Vector *self); \
+ T* T##Vector_end(T##Vector *self); \
+ T* T##Vector_ref(T##Vector *self, size_t n); \
+ void T##Vector_swap(T##Vector *self, int i, int j); \
+ T##Vector T##Vector_move(T##Vector *self); \
+ void T##Vector_show(T##Vector *self, FILE* fp); \
+ void T##Vector_free(T##Vector *self);
+
+#define VECTOR_IMPL(T) \
+ void T##Vector_init(T##Vector *self) { \
+ self->buffer = (T*)malloc(sizeof(T) * 16); \
+ self->cap = 16; \
+ self->size = 0; \
+ } \
+ \
+ void T##Vector_push_back(T##Vector *self, T elem) { \
+ if (self->size + 1 > self->cap) { \
+ self->buffer = realloc(self->buffer, sizeof(T) * self->cap * 2); \
+ self->cap *= 2; \
+ } \
+ self->buffer[self->size] = elem; \
+ self->size += 1; \
+ } \
+ void T##Vector_insert_before(T##Vector *self, int n, T elem) { \
+ if (n < 0 || n > self->size) { \
+ return; \
+ } \
+ if (self->size + 1 > self->cap) { \
+ self->buffer = malloc(sizeof(T) * self->cap * 2); \
+ self->cap *= 2; \
+ } \
+ if (n != self->size) { \
+ memmove(self->buffer + n + 1, \
+ self->buffer + n, \
+ sizeof(T) * (self->size - n)); \
+ self->buffer[n] = elem; \
+ self->size += 1; \
+ } \
+ } \
+ void T##Vector_pop(T##Vector *self) { \
+ self->size -= 1; \
+ } \
+ void T##Vector_remove(T##Vector *self, size_t n) { \
+ if (n < 0 || n >= self->size) return; \
+ memmove(self->buffer + n, \
+ self->buffer + n + 1, \
+ sizeof(T) * self->size - n - 1); \
+ self->size -= 1; \
+ } \
+ T* T##Vector_begin(T##Vector *self) { return self->buffer; } \
+ bool T##Vector_empty(T##Vector *self) { return self->size == 0; } \
+ T* T##Vector_end(T##Vector *self) { return self->buffer + self->size; } \
+ T* T##Vector_last(T##Vector *self) { return self->buffer + self->size - 1; } \
+ T* T##Vector_ref(T##Vector *self, size_t n) { return self->buffer + n; } \
+ void T##Vector_swap(T##Vector *self, int i, int j) { \
+ T buf; \
+ memcpy(&buf, self->buffer + i, sizeof(T)); \
+ memcpy(self->buffer + i, self->buffer + j, sizeof(T)); \
+ memcpy(self->buffer + j, &buf, sizeof(T)); \
+ } \
+ T##Vector T##Vector_move(T##Vector *self) { \
+ T##Vector dup = *self; \
+ self->buffer = NULL; \
+ self->size = 0; \
+ self->cap = 0; \
+ return dup; \
+ } \
+ void T##Vector_show(T##Vector *self, FILE* fp) { \
+ fprintf(fp, "["); \
+ for (int i = 0; i < self->size-1; i++) { \
+ T##_show(self->buffer[i], fp); \
+ fprintf(fp, ", "); \
+ } \
+ if (self->size > 1) { \
+ T##_show(self->buffer[self->size - 1], fp); \
+ } \
+ fprintf(fp, "]"); \
+ } \
+ size_t T##Vector_len(T##Vector *self) { return self->size; } \
+ void T##Vector_free(T##Vector *self) { free(self->buffer); }
+
+VECTOR_DEF(Int);
+VECTOR_DEF(Bool);
+VECTOR_DEF(Long);
+VECTOR_DEF(Char);
+VECTOR_DEF(UInt);
+VECTOR_DEF(ULong);
+VECTOR_DEF(Double);
+VECTOR_DEF(Float);
+VECTOR_DEF(String);
+VECTOR_DEF(VoidPtr);
+
+#endif