diff options
author | Kenny Levinsen <kl@kl.wtf> | 2020-08-31 02:26:47 +0200 |
---|---|---|
committer | Kenny Levinsen <kl@kl.wtf> | 2020-08-31 14:09:59 +0200 |
commit | bbfb770c73498413055c7af8d3e1b8db36560016 (patch) | |
tree | 8d7130502352a1dc523d4959f7945899491b9e40 /tests | |
parent | d75b617fafa41b83aab5943827224df8b7ff9e4a (diff) |
linked_list: linked_list_take should concat lists
Diffstat (limited to 'tests')
-rw-r--r-- | tests/linked_list.c | 28 |
1 files changed, 28 insertions, 0 deletions
diff --git a/tests/linked_list.c b/tests/linked_list.c index a29cff6..71322b8 100644 --- a/tests/linked_list.c +++ b/tests/linked_list.c @@ -204,6 +204,7 @@ static void test_linked_list_loop_iterate(void) { static void test_linked_list_take_empty(void) { struct linked_list list1, list2; linked_list_init(&list1); + linked_list_init(&list2); linked_list_take(&list2, &list1); @@ -214,6 +215,7 @@ static void test_linked_list_take_empty(void) { static void test_linked_list_take_single(void) { struct linked_list list1, list2; linked_list_init(&list1); + linked_list_init(&list2); struct list_elem elem1 = {{0}, NULL}; linked_list_insert(&list1, &elem1.link); @@ -228,6 +230,7 @@ static void test_linked_list_take_single(void) { static void test_linked_list_take_many(void) { struct linked_list list1, list2; linked_list_init(&list1); + linked_list_init(&list2); struct list_elem elem1 = {{0}, NULL}; struct list_elem elem2 = {{0}, NULL}; @@ -242,6 +245,30 @@ static void test_linked_list_take_many(void) { assert(elem2.link.next == &list2 && elem2.link.prev == &elem1.link); } +static void test_linked_list_take_concat(void) { + struct linked_list list1, list2; + linked_list_init(&list1); + linked_list_init(&list2); + + struct list_elem elem1 = {{0}, NULL}; + struct list_elem elem2 = {{0}, NULL}; + struct list_elem elem3 = {{0}, NULL}; + struct list_elem elem4 = {{0}, NULL}; + linked_list_insert(&list1, &elem2.link); + linked_list_insert(&list1, &elem1.link); + linked_list_insert(&list2, &elem4.link); + linked_list_insert(&list2, &elem3.link); + + linked_list_take(&list2, &list1); + + assert(linked_list_empty(&list1)); + assert(list2.next == &elem1.link && list2.prev == &elem4.link); + assert(elem1.link.next == &elem2.link && elem1.link.prev == &list2); + assert(elem2.link.next == &elem3.link && elem2.link.prev == &elem1.link); + assert(elem3.link.next == &elem4.link && elem3.link.prev == &elem2.link); + assert(elem4.link.next == &list2 && elem4.link.prev == &elem3.link); +} + int main(int argc, char *argv[]) { (void)argc; (void)argv; @@ -258,6 +285,7 @@ int main(int argc, char *argv[]) { test_linked_list_take_empty(); test_linked_list_take_single(); test_linked_list_take_many(); + test_linked_list_take_concat(); return 0; } |