api_nilorea/ex_list_8c-example.html

#include "nilorea/n_log.h"

#include "nilorea/n_list.h"

#include "nilorea/n_str.h"


#define LIST_LIMIT 10

#define NB_TEST_ELEM 15


void print_list_info(LIST* list) {

    __n_assert(list, return);

    n_log(LOG_NOTICE, "List: %p, %d max_elements , %d elements", list, list->nb_max_items, list->nb_items);

}


int nstrcmp(const void* a, const void* b) {

    const N_STR* s1 = a;

    const N_STR* s2 = b;


    if (!s1 || !s1->data)

        return 1;

    if (!s2 || !s2->data)

        return -1;


    return strcmp(s1->data, s2->data);

}


int main(void) {

    set_log_level(LOG_DEBUG);


    LIST* list = new_generic_list(LIST_LIMIT);


    __n_assert(list, return FALSE);


    N_STR* nstr = NULL;


    n_log(LOG_NOTICE, "Testing empty list cleaning");


    list_destroy(&list);


    n_log(LOG_NOTICE, "list list: adding %d element in list element (%d) list, empty the list at the end", NB_TEST_ELEM, LIST_LIMIT);

    list = new_generic_list(LIST_LIMIT);

    for (int it = 0; it < NB_TEST_ELEM; it++) {

        nstrprintf(nstr, "Nombre aleatoire : %d", rand() % 1000);

        if (nstr) {

            int func = rand() % 4;

            switch (func) {

                case 0:

                    n_log(LOG_NOTICE, "list_push");

                    if (list_push(list, nstr, free_nstr_ptr) == FALSE)

                        free_nstr(&nstr);

                    break;

                case 1:

                    n_log(LOG_NOTICE, "list_unshift");

                    if (list_unshift(list, nstr, free_nstr_ptr) == FALSE)

                        free_nstr(&nstr);

                    break;

                case 2:

                    n_log(LOG_NOTICE, "list_push_sorted");

                    if (list_push_sorted(list, nstr, nstrcmp, free_nstr_ptr) == FALSE)

                        free_nstr(&nstr);

                    break;

                case 3:

                    n_log(LOG_NOTICE, "list_unshift");

                    if (list_unshift_sorted(list, nstr, nstrcmp, free_nstr_ptr) == FALSE)

                        free_nstr(&nstr);

                    break;

                default:

                    n_log(LOG_ERR, "should never happen: no func %d !", func);

                    break;

            }

            nstr = NULL;

            print_list_info(list);

        }

    }

    n_log(LOG_NOTICE, "Emptying the list and setting nb_max_item to unlimit");

    list_empty(list);

    /* setiing no item limit in list */

    list->nb_max_items = -1;

    for (int it = 0; it < NB_TEST_ELEM; it++) {

        nstrprintf(nstr, "Nombre aleatoire : %d", rand() % 1000);

        if (nstr) {

            int func = 2 + rand() % 1;

            switch (func) {

                case 0:

                    n_log(LOG_NOTICE, "list_push");

                    if (list_push(list, nstr, free_nstr_ptr) == FALSE)

                        free_nstr(&nstr);

                    break;

                case 1:

                    n_log(LOG_NOTICE, "list_unshift");

                    if (list_unshift(list, nstr, free_nstr_ptr) == FALSE)

                        free_nstr(&nstr);

                    break;

                case 2:

                    n_log(LOG_NOTICE, "list_push_sorted");

                    if (list_push_sorted(list, nstr, nstrcmp, free_nstr_ptr) == FALSE)

                        free_nstr(&nstr);

                    break;

                case 3:

                    n_log(LOG_NOTICE, "list_unshift sorted");

                    if (list_unshift_sorted(list, nstr, nstrcmp, free_nstr_ptr) == FALSE)

                        free_nstr(&nstr);

                    break;

                default:

                    n_log(LOG_ERR, "should never happen: no func %d !", func);

                    break;

            }

            nstr = NULL;

            print_list_info(list);

        }

    }

    list_foreach(node, list) {

        N_STR* nodestr = (N_STR*)node->ptr;

        n_log(LOG_INFO, "Listnode: %p item: %s", node, nodestr->data);

    }

    list_destroy(&list);


    exit(0);

} /* END_OF_MAIN */

__n_assert
#define __n_assert(__ptr, __ret)
macro to assert things
Definition n_common.h:258

LIST::nb_max_items
size_t nb_max_items
maximum number of item in the list.
Definition n_list.h:43

LIST::nb_items
size_t nb_items
number of item currently in the list
Definition n_list.h:41

list_empty
int list_empty(LIST *list)
Empty a LIST list of pointers.
Definition n_list.c:471

list_push
int list_push(LIST *list, void *ptr, void(*destructor)(void *ptr))
Add a pointer to the end of the list.
Definition n_list.c:199

list_foreach
#define list_foreach(__ITEM_, __LIST_)
ForEach macro helper.
Definition n_list.h:65

list_unshift
int list_unshift(LIST *list, void *ptr, void(*destructor)(void *ptr))
Add a pointer at the start of the list.
Definition n_list.c:288

list_destroy
int list_destroy(LIST **list)
Empty and Free a list container.
Definition n_list.c:518

list_unshift_sorted
int list_unshift_sorted(LIST *list, void *ptr, int(*comparator)(const void *a, const void *b), void(*destructor)(void *ptr))
Add a pointer sorted in the list , starting by the start of the list.
Definition n_list.c:321

list_push_sorted
int list_push_sorted(LIST *list, void *ptr, int(*comparator)(const void *a, const void *b), void(*destructor)(void *ptr))
Add a pointer sorted in the list , starting by the end of the list.
Definition n_list.c:233

LIST
Structure of a generic LIST container.
Definition n_list.h:39

n_log
#define n_log(__LEVEL__,...)
Logging function wrapper to get line and func.
Definition n_log.h:69

LOG_DEBUG
#define LOG_DEBUG
debug-level messages
Definition n_log.h:64

LOG_ERR
#define LOG_ERR
error conditions
Definition n_log.h:56

set_log_level
void set_log_level(const int log_level)
Set the global log level value ( static int LOG_LEVEL )
Definition n_log.c:91

LOG_NOTICE
#define LOG_NOTICE
normal but significant condition
Definition n_log.h:60

LOG_INFO
#define LOG_INFO
informational
Definition n_log.h:62

N_STR::data
char * data
the string
Definition n_str.h:41

free_nstr_ptr
void free_nstr_ptr(void *ptr)
Free a N_STR pointer structure.
Definition n_str.c:49

free_nstr
#define free_nstr(__ptr)
free a N_STR structure and set the pointer to NULL
Definition n_str.h:176

nstrprintf
#define nstrprintf(__nstr_var, __format,...)
Macro to quickly allocate and sprintf to N_STR.
Definition n_str.h:94

N_STR
A box including a string and his lenght.
Definition n_str.h:39

n_list.h
List structures and definitions.

n_log.h
Generic log system.

n_str.h
N_STR and string function declaration.