You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
198 lines
5.6 KiB
198 lines
5.6 KiB
/*
|
|
Copyright (c) 2013 Nir Soffer <nirsof@gmail.com>
|
|
|
|
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
of this software and associated documentation files (the "Software"),
|
|
to deal in the Software without restriction, including without limitation
|
|
the rights to use, copy, modify, merge, publish, distribute, sublicense,
|
|
and/or sell copies of the Software, and to permit persons to whom
|
|
the Software is furnished to do so, subject to the following conditions:
|
|
|
|
The above copyright notice and this permission notice shall be included
|
|
in all copies or substantial portions of the Software.
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
|
THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
|
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
|
|
IN THE SOFTWARE.
|
|
*/
|
|
|
|
#include "../utils/cont.h"
|
|
|
|
#include "../utils/err.h"
|
|
#include "../utils/list.h"
|
|
|
|
static struct nn_list_item sentinel;
|
|
|
|
/* Typical object that can be added to a list. */
|
|
struct item {
|
|
int value;
|
|
struct nn_list_item item;
|
|
};
|
|
|
|
/* Initializing list items statically so they can be inserted into a list. */
|
|
static struct item that = {1, NN_LIST_ITEM_INITIALIZER};
|
|
static struct item other = {2, NN_LIST_ITEM_INITIALIZER};
|
|
|
|
int testlist()
|
|
{
|
|
int rc;
|
|
struct nn_list list;
|
|
struct nn_list_item *list_item;
|
|
struct item *item;
|
|
printf("test list\n");
|
|
|
|
/* List item life cycle. */
|
|
|
|
/* Initialize the item. Make sure it's not part of any list. */
|
|
nn_list_item_init (&that.item);
|
|
nn_assert (!nn_list_item_isinlist (&that.item));
|
|
|
|
/* That may be part of some list, or uninitialized memory. */
|
|
that.item.prev = &sentinel;
|
|
that.item.next = &sentinel;
|
|
nn_assert (nn_list_item_isinlist (&that.item));
|
|
that.item.prev = NULL;
|
|
that.item.next = NULL;
|
|
nn_assert (nn_list_item_isinlist (&that.item));
|
|
|
|
/* Before termination, item must be removed from the list. */
|
|
nn_list_item_init(&that.item);
|
|
nn_list_item_term(&that.item);
|
|
|
|
/* Initializing a list. */
|
|
|
|
/* Uninitialized list has random content. */
|
|
list.first = &sentinel;
|
|
list.last = &sentinel;
|
|
|
|
nn_list_init (&list);
|
|
|
|
nn_assert (list.first == NULL);
|
|
nn_assert (list.last == NULL);
|
|
|
|
nn_list_term (&list);
|
|
|
|
/* Empty list. */
|
|
|
|
nn_list_init (&list);
|
|
|
|
rc = nn_list_empty (&list);
|
|
nn_assert (rc == 1);
|
|
|
|
list_item = nn_list_begin (&list);
|
|
nn_assert (list_item == NULL);
|
|
|
|
list_item = nn_list_end (&list);
|
|
nn_assert (list_item == NULL);
|
|
|
|
nn_list_term (&list);
|
|
|
|
/* Inserting and erasing items. */
|
|
|
|
nn_list_init (&list);
|
|
nn_list_item_init (&that.item);
|
|
|
|
/* Item doesn'tt belong to list yet. */
|
|
nn_assert (!nn_list_item_isinlist (&that.item));
|
|
|
|
nn_list_insert (&list, &that.item, nn_list_end (&list));
|
|
|
|
/* Item is now part of a list. */
|
|
nn_assert (nn_list_item_isinlist (&that.item));
|
|
|
|
/* Single item does not have prev or next item. */
|
|
nn_assert (that.item.prev == NULL);
|
|
nn_assert (that.item.next == NULL);
|
|
|
|
/* Item is both first and list item. */
|
|
nn_assert (list.first == &that.item);
|
|
nn_assert (list.last == &that.item);
|
|
|
|
/* Removing an item. */
|
|
nn_list_erase (&list, &that.item);
|
|
nn_assert (!nn_list_item_isinlist (&that.item));
|
|
|
|
nn_assert (list.first == NULL);
|
|
nn_assert (list.last == NULL);
|
|
|
|
nn_list_item_term (&that.item);
|
|
nn_list_term (&list);
|
|
|
|
/* Iterating items. */
|
|
|
|
nn_list_init (&list);
|
|
nn_list_item_init (&that.item);
|
|
|
|
nn_list_insert (&list, &that.item, nn_list_end (&list));
|
|
|
|
list_item = nn_list_begin (&list);
|
|
nn_assert (list_item == &that.item);
|
|
|
|
item = nn_cont (list_item, struct item, item);
|
|
nn_assert (item == &that);
|
|
|
|
list_item = nn_list_end (&list);
|
|
nn_assert (list_item == NULL);
|
|
|
|
list_item = nn_list_prev (&list, &that.item);
|
|
nn_assert (list_item == NULL);
|
|
|
|
list_item = nn_list_next (&list, &that.item);
|
|
nn_assert (list_item == NULL);
|
|
|
|
rc = nn_list_empty (&list);
|
|
nn_assert (rc == 0);
|
|
|
|
nn_list_erase (&list, &that.item);
|
|
nn_list_item_term (&that.item);
|
|
nn_list_term (&list);
|
|
|
|
/* Appending items. */
|
|
|
|
nn_list_init (&list);
|
|
nn_list_item_init (&that.item);
|
|
nn_list_item_init (&other.item);
|
|
|
|
nn_list_insert (&list, &that.item, nn_list_end (&list));
|
|
nn_list_insert (&list, &other.item, nn_list_end (&list));
|
|
|
|
list_item = nn_list_begin (&list);
|
|
nn_assert (list_item == &that.item);
|
|
|
|
list_item = nn_list_next (&list, list_item);
|
|
nn_assert (list_item == &other.item);
|
|
|
|
nn_list_erase (&list, &that.item);
|
|
nn_list_erase (&list, &other.item);
|
|
nn_list_item_term (&that.item);
|
|
nn_list_item_term (&other.item);
|
|
nn_list_term (&list);
|
|
|
|
/* Prepending items. */
|
|
|
|
nn_list_init (&list);
|
|
nn_list_item_init (&that.item);
|
|
nn_list_item_init (&other.item);
|
|
|
|
nn_list_insert (&list, &that.item, nn_list_begin (&list));
|
|
nn_list_insert (&list, &other.item, nn_list_begin (&list));
|
|
|
|
list_item = nn_list_begin (&list);
|
|
nn_assert (list_item == &other.item);
|
|
|
|
list_item = nn_list_next (&list, list_item);
|
|
nn_assert (list_item == &that.item);
|
|
|
|
nn_list_erase (&list, &that.item);
|
|
nn_list_erase (&list, &other.item);
|
|
nn_list_item_term (&that.item);
|
|
nn_list_item_term (&other.item);
|
|
nn_list_term (&list);
|
|
|
|
return 0;
|
|
}
|
|
|
|
|