Leonardo
4f755f0915
./codecov is a stalled version for code coverage. It will be merged with main when the library is done with breaking changes
75 lines
1.7 KiB
C
75 lines
1.7 KiB
C
#include "utl/assert.h"
|
|
#include "utl/test.h"
|
|
#include "../src/linkedlist.c"
|
|
|
|
CMC_CREATE_UNIT(linkedlist_test, false, {
|
|
CMC_CREATE_TEST(new, {
|
|
linkedlist *ll = ll_new();
|
|
|
|
cmc_assert_not_equals(ptr, NULL, ll);
|
|
cmc_assert_equals(size_t, 0, ll_count(ll));
|
|
cmc_assert_equals(ptr, NULL, ll->head);
|
|
cmc_assert_equals(ptr, NULL, ll->tail);
|
|
|
|
ll_free(ll);
|
|
});
|
|
|
|
CMC_CREATE_TEST(clear[count capacity], {
|
|
linkedlist *ll = ll_new();
|
|
|
|
cmc_assert_not_equals(ptr, NULL, ll);
|
|
|
|
for (size_t i = 0; i < 50; i++)
|
|
ll_push_back(ll, i);
|
|
|
|
cmc_assert_equals(size_t, 50, ll_count(ll));
|
|
|
|
ll_clear(ll);
|
|
|
|
cmc_assert_equals(size_t, 0, ll_count(ll));
|
|
|
|
ll_free(ll);
|
|
});
|
|
|
|
CMC_CREATE_TEST(clear[edge_case:count = 0], {
|
|
linkedlist *ll = ll_new();
|
|
|
|
cmc_assert_not_equals(ptr, NULL, ll);
|
|
|
|
ll_clear(ll);
|
|
|
|
cmc_assert_equals(size_t, 0, ll_count(ll));
|
|
|
|
ll_free(ll);
|
|
});
|
|
|
|
CMC_CREATE_TEST(push_front[count], {
|
|
linkedlist *ll = ll_new();
|
|
|
|
cmc_assert_not_equals(ptr, NULL, ll);
|
|
|
|
ll_push_front(ll, 1);
|
|
|
|
cmc_assert_not_equals(ptr, NULL, ll->head);
|
|
cmc_assert_not_equals(ptr, NULL, ll->tail);
|
|
cmc_assert_equals(size_t, 1, ll_count(ll));
|
|
|
|
ll_free(ll);
|
|
});
|
|
|
|
CMC_CREATE_TEST(push_front[item_preservation], {
|
|
linkedlist *ll = ll_new();
|
|
|
|
cmc_assert_not_equals(ptr, NULL, ll);
|
|
|
|
for (size_t i = 0; i < 200; i++)
|
|
ll_push_front(ll, i);
|
|
|
|
for (size_t i = 0; i < ll_count(ll); i++)
|
|
cmc_assert_equals(size_t, ll_get(ll, i), ll_count(ll) - i - 1);
|
|
|
|
ll_free(ll);
|
|
});
|
|
|
|
});
|