add vector.c template, update makefile, add readme.txt

vector.c

@@ -0,0 +1,113 @@
+#include <assert.h>
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include "vector.h"
+#include "util.h"
+
+#define VECTOR_START_SIZE	8
+#define VECTOR_GROW_FACTOR	2
+#define ITEMSZ sizeof(int)
+
+void
+vector_init(ivector *v)
+{
+	assert(v);
+
+	v->n = 0;
+	v->maxsz = VECTOR_START_SIZE;
+	v->data = xmalloc(ITEMSZ * VECTOR_START_SIZE);
+}
+
+void
+vector_initdata(ivector *v, int *arr, size_t arrsz)
+{
+	assert(v && arrsz);
+	// <YOURCODE>
+}
+
+void
+vector_free(ivector *v)
+{
+	assert(v);
+
+	v->n = 0;
+	v->maxsz = 0;
+	xfree(v->data);
+	v->data = NULL;
+}
+
+size_t
+vector_len(const ivector *v)
+{
+	assert(v);
+
+	// <YOURCODE>
+	return 0;
+}
+
+int *
+vector_data(const ivector *v)
+{
+	assert(v);
+	// <YOURCODE>
+	return NULL;
+}
+
+void
+vector_resize(ivector *v, int n)
+{
+	assert(v);
+
+	// <YOURCODE>
+}
+
+void
+vector_set(ivector *v, size_t idx, int val)
+{
+	assert(v && idx < v->n);
+	// <YOURCODE>
+}
+
+int
+vector_get(const ivector *v, size_t idx)
+{
+	assert(v && idx < v->n);
+	// <YOURCODE>
+	return 0;
+}
+
+void
+vector_push(ivector *v, int val)
+{
+	assert(v);
+	// <YOURCODE>
+}
+
+void
+vector_pop(ivector *v)
+{
+	assert(v);
+	// <YOURCODE>
+}
+
+void
+vector_insert(ivector *v, size_t idx, int val)
+{
+	assert(v && v->n >= idx);
+	// <YOURCODE>
+}
+
+void
+vector_del(ivector *v, size_t idx)
+{
+	// <YOURCODE>
+}
+
+void
+vector_clear(ivector *v)
+{
+	vector_resize(v, 0);
+}