1 files changed, 286 insertions, 0 deletions

diff --git a/collections/vector/vector.c b/collections/vector/vector.c
new file mode 100644
index 0000000..f14c302
--- /dev/null
+++ b/collections/vector/vector.c
@@ -0,0 +1,286 @@
+#include "vector.h"
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <assert.h>
+
+#define START_SIZE 64;
+
+struct vector {
+	void **base;
+	int end, limit;
+};
+
+void vec_debug_print(root)
+vec *root;
+{
+	int i;
+
+	fprintf(stderr, "VEC[base: %p, end: %p, limit:%p]:\n\t ",
+			root->base, root->end, root->limit);
+	for (i=0; i < root->end; i++){
+		fprintf(stderr, "[%p]", vec_index(root,i));
+	}
+	fprintf(stderr, "\n");
+}
+
+vec* vec_new()
+{
+	vec *root;
+
+	root = malloc(sizeof(vec));
+	assert(root);
+
+	root->limit = START_SIZE;
+	root->base = malloc(root->limit * sizeof(void*));
+	assert(root->base);
+
+	return root;
+}
+
+vec* vec_with_capacity(n)
+int n;
+{
+	vec *root;
+
+	root = malloc(sizeof(vec));
+	assert(root);
+
+	root->limit = n;
+	root->base = malloc(root->limit * sizeof(void*));
+	assert(root->base);
+
+	return root;
+}
+
+int vec_size(root)
+vec *root;
+{
+	if (!root) {
+		return -1;
+	}
+	return root->end;
+}
+
+int vec_capacity(root)
+vec *root;
+{
+	if (!root) {
+		return -1;
+	}
+	
+	return root->limit;
+}
+
+void vec_resize(root)
+vec *root;
+{
+	if (!root)
+		return;
+
+	root->base = reallocarray(root->base, root->limit * 2, sizeof(void*));
+	assert(root->base);
+}
+
+vec* vec_cp(root)
+vec *root;
+{
+	vec *copy;
+
+	if (!root)
+		return NULL;
+
+	copy = vec_with_capacity(root->limit);
+
+	copy->base = memcpy(copy->base, root->base,
+			vec_size(root) * sizeof(void*));
+	assert(copy->base);
+
+	copy->end = root->end;
+	copy->limit = root->limit;
+
+	return copy;
+}
+
+void vec_print(root, to_string)
+vec *root;
+char* to_string(void*);
+{
+	int i;
+	char *tmp;
+
+	printf("[");
+	for(i = 0; i < root->end; i++) {
+		printf("%s", tmp = to_string(vec_index(root, i)));
+		free(tmp);
+		tmp = NULL;
+	}
+	printf("\b]\n");
+
+}
+
+void vec_push(root, item)
+vec *root;
+void *item;
+{
+	if (!root) {
+		return;
+	}
+
+	if (root->end >= root->limit) {
+		vec_resize(root);
+	}
+
+	root->base[root->end++] = item;
+}
+
+void* vec_pop(root)
+vec *root;
+{
+	if (!root || root->end <= 0) {
+		return NULL;
+	}
+
+	return root->base[--root->end];
+}
+
+void* vec_back(root)
+vec *root;
+{
+	if (!root || root->end == 0) {
+		return NULL;
+	}
+
+	return root->base[root->end - 1];
+}
+
+void vec_set(root, index, item)
+vec *root;
+int index;
+void *item;
+{
+	if (!root || index >= root->end || index < 0)
+		return;
+
+	root->base[index] = item;
+}
+
+void* vec_index(root, index)
+vec *root;
+int index;
+{
+	if (!root || index >= root->end || index < 0) {
+		return NULL;
+	}
+
+	return root->base[index];
+}
+
+void vec_insert(root, index, item)
+vec *root;
+int index;
+void *item;
+{
+	if (!root || index > root->end || index < 0)
+		return;
+
+	if (root->end >= root->limit)
+		vec_resize(root);
+
+	memmove(root->base + index + 1, root->base + index,
+			(root->end++ - index) * sizeof(void*));
+
+	root->base[index] = item;
+}
+
+void* vec_remove(root, index)
+vec *root;
+int index;
+{
+	void *tmp;
+
+	if (!root || index > root->end || index < 0)
+		return NULL;
+
+	tmp = vec_index(root, index);
+	memmove(root->base + index, root->base + index + 1,
+			(--root->end - index) * sizeof(void*));
+
+	return tmp;
+}
+
+void vec_swap(root, i, j)
+vec *root;
+int i,j;
+{
+	void *tmp;
+
+	if (!root || i >= root->end || i < 0 || j >= root->end || j < 0)
+		return;
+
+	tmp = root->base[i];
+	root->base[i] = root->base[j];
+	root->base[j] = tmp;
+
+	return;
+}
+
+void* vec_swap_pop(root, i)
+vec *root;
+int i;
+{
+	void *tmp;
+	int j;
+
+	if (!root || i >= root->end || i < 0 || root->end <= 0)
+		return NULL;
+
+	vec_swap(root, i, root->end - 1);
+	return vec_pop(root);
+}
+
+void vec_truncate(root, size)
+vec *root;
+int size;
+{
+	if (!root || size < 0 || size >= root->end)
+		return;
+
+	root->end = size;
+}
+
+void vec_reserve(root, n)
+vec *root;
+int n;
+{
+	int i;
+
+	if (!root || n + root->end <= root->limit)
+		return;
+
+	for (i = root->limit; i < root->end + n; i*=2);
+
+	root->base = reallocarray(root->base, i, sizeof(void*));
+}
+
+void vec_clear(root)
+vec *root;
+{
+	int i;
+
+	for (i = 0; i < root->end; i++) {
+		free(vec_index(root, i));
+	}
+
+	root->end = 0;
+}
+
+void vec_free(root)
+vec *root;
+{
+	free(root->base);
+	root->base = NULL;
+
+	free(root);
+}