init commit

vector_test.c

@@ -0,0 +1,137 @@
+#include <stdio.h>
+
+#include "vector.h"
+#include "util.h"
+#include "macro.h"
+#include "munit/munit.h"
+
+static MunitResult
+test_vector_getters(const MunitParameter params[], void * data)
+{
+	// (Really stupid) tests for vector_len and vector_data
+	ivector v;
+	vector_init(&v);
+
+	munit_assert_size(vector_len(&v), ==, 0);
+	munit_assert_not_null(vector_data(&v));
+
+	// Lame method, that checks vector_len getter
+	v.n = 1337;
+	munit_assert_size(vector_len(&v), ==, 1337);
+	vector_free(&v);
+
+	return MUNIT_OK;
+}
+
+static MunitResult
+test_vector_init_reserve(const MunitParameter params[], void * data)
+{
+	int i;
+	int arr[] = {
+		1, 2, 3, 4, 5
+	};
+	int *p;
+
+	ivector v;
+
+	vector_initdata(&v, arr, ARRSZ(arr));
+	p = vector_data(&v);
+	munit_assert_not_null(p);
+	munit_assert_size(vector_len(&v), ==, ARRSZ(arr));
+
+	for (i = 0; i < ARRSZ(arr); i++) {
+		munit_assert_int(arr[i], ==, p[i]);
+	}
+
+	vector_resize(&v, 16);
+	munit_assert_size(vector_len(&v), ==, 16);
+
+	munit_assert_size(v.n, <=, v.maxsz);
+
+	// Try to check that new memory is really zeroed
+	i = ARRSZ(arr);
+	p = vector_data(&v);
+	for (; i < 16; i++) {
+		munit_assert_int(0, ==, p[i]);
+	}
+
+	vector_free(&v);
+
+	return MUNIT_OK;
+}
+
+static MunitResult
+test_vector_push_pop(const MunitParameter params[], void * data)
+{
+	int arr[] = {
+		1, 2, 3, 4, 5, 6, 7, 8, 9, 10,
+		11, 12, 13, 14, 15, 16, 17, 18, 19, 20};
+	int i, tmp;
+
+	ivector v;
+
+	vector_init(&v);
+
+	for (i = 0; i < ARRSZ(arr); i++) {
+		vector_push(&v, arr[i]);
+	}
+	munit_assert_size(vector_len(&v), ==, ARRSZ(arr));
+
+	// test vector_get
+	for (i = 0; i < ARRSZ(arr); i++) {
+		tmp = vector_get(&v, i);
+		munit_assert_int(tmp, ==, arr[i]);
+	}
+	munit_assert_size(vector_len(&v), ==, ARRSZ(arr));
+
+
+	vector_pop(&v);
+	vector_pop(&v);
+
+	for (i = 0; i < ARRSZ(arr) - 2; i++) {
+		tmp = vector_get(&v, i);
+		munit_assert_int(tmp, ==, arr[i]);
+	}
+	munit_assert_size(vector_len(&v), ==, ARRSZ(arr) - 2);
+
+	//test vector_pop underflow
+	for (i = 0; i < ARRSZ(arr); i++) {
+		vector_pop(&v);
+	}
+	munit_assert_size(vector_len(&v), ==, 0);
+
+	//test vector_pop
+
+	vector_free(&v);
+
+	return MUNIT_OK;
+}
+
+#define TEST_ITEM(func) {#func, func, NULL, NULL, MUNIT_TEST_OPTION_NONE }
+
+static MunitTest test_suite_tests[] = {
+	TEST_ITEM(test_vector_getters),
+
+	TEST_ITEM(test_vector_init_reserve),
+	TEST_ITEM(test_vector_push_pop),
+	//TEST_ITEM(test_pvector_init),
+
+	{ NULL, NULL, NULL, NULL, MUNIT_TEST_OPTION_NONE, NULL }
+};
+
+static const MunitSuite test_suite = {
+	(char *) "",
+	test_suite_tests,
+	NULL,
+	1,
+	MUNIT_SUITE_OPTION_NONE
+};
+
+
+int
+main(int argc, const char *argv[])
+{
+	munit_suite_main(&test_suite, (void *) "vector_test", argc, (char * const*) argv);
+	return 0;
+}
+