renka1/lab5_ivec
1
0
Fork 0
forked from 131/lab5_ivec
Code Pull Requests Activity

cp from PAX

Browse Source
This commit is contained in:
Artem
2025-11-15 05:08:30 -05:00
parent 5c126c1b61
commit 7aa1a963e5
1 changed files with 68 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

73
vector_test.c
View File

@@ -77,7 +77,6 @@ test_vector_resize(const MunitParameter params[], void * data)
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++) {
@@ -107,7 +106,6 @@ test_vector_set_get(const MunitParameter params[], void * data)
for (i = 0; i < vector_len(&v); i++) {
int item = vector_get(&v, i);
munit_assert_int(item, ==, i);
//double check with raw pointer
munit_assert_int(p[i], ==, i);
}
@@ -132,7 +130,6 @@ test_vector_push_pop(const MunitParameter params[], void * data)
}
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]);
@@ -149,19 +146,82 @@ test_vector_push_pop(const MunitParameter params[], void * data)
}
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;
}
static MunitResult
test_vector_insert(const MunitParameter params[], void * data)
{
ivector v;
vector_init(&v);
vector_insert(&v, 0, 100);
munit_assert_size(vector_len(&v), ==, 1);
munit_assert_int(vector_get(&v, 0), ==, 100);
vector_insert(&v, 0, 200);
munit_assert_size(vector_len(&v), ==, 2);
munit_assert_int(vector_get(&v, 0), ==, 200);
munit_assert_int(vector_get(&v, 1), ==, 100);
vector_insert(&v, 2, 300);
munit_assert_size(vector_len(&v), ==, 3);
munit_assert_int(vector_get(&v, 2), ==, 300);
vector_insert(&v, 1, 400);
munit_assert_size(vector_len(&v), ==, 4);
munit_assert_int(vector_get(&v, 0), ==, 200);
munit_assert_int(vector_get(&v, 1), ==, 400);
munit_assert_int(vector_get(&v, 2), ==, 100);
munit_assert_int(vector_get(&v, 3), ==, 300);
vector_free(&v);
return MUNIT_OK;
}
static MunitResult
test_vector_del(const MunitParameter params[], void * data)
{
ivector v;
vector_init(&v);
int i;
for (i = 0; i < 5; i++) {
vector_push(&v, i * 10);
}
munit_assert_size(vector_len(&v), ==, 5);
vector_del(&v, 0);
munit_assert_size(vector_len(&v), ==, 4);
munit_assert_int(vector_get(&v, 0), ==, 10);
vector_del(&v, 3);
munit_assert_size(vector_len(&v), ==, 3);
munit_assert_int(vector_get(&v, 0), ==, 10);
munit_assert_int(vector_get(&v, 1), ==, 20);
munit_assert_int(vector_get(&v, 2), ==, 30);
vector_del(&v, 1);
munit_assert_size(vector_len(&v), ==, 2);
munit_assert_int(vector_get(&v, 0), ==, 10);
munit_assert_int(vector_get(&v, 1), ==, 30);
vector_del(&v, 0);
vector_del(&v, 0);
munit_assert_size(vector_len(&v), ==, 0);
vector_free(&v);
return MUNIT_OK;
}
#define TEST_ITEM(func) {#func, func, NULL, NULL, MUNIT_TEST_OPTION_NONE }
static MunitTest test_suite_tests[] = {
@@ -173,6 +233,9 @@ static MunitTest test_suite_tests[] = {
TEST_ITEM(test_vector_set_get),
TEST_ITEM(test_vector_push_pop),
TEST_ITEM(test_vector_insert),
TEST_ITEM(test_vector_del),
{ NULL, NULL, NULL, NULL, MUNIT_TEST_OPTION_NONE, NULL }
};